Documentation

LeanPool.FormalizingGMT.TangentMeasures.Basic

Basic definitions for tangent measures #

This file defines blow-up maps, rescaled measures, tangent measures, and the basic facts used by the Chapter 14 results.

noncomputable def blowUpMap {n : ℕ} (a : EuclideanSpace ℝ (Fin n)) (r : ℝ) (x : EuclideanSpace ℝ (Fin n)) :

The blow-up map T_{a,r}(x) = (x - a) / r on Euclidean space ℝⁿ.

Equations
Instances For

    IsTangentMeasure μ ν a asserts that ν is a tangent measure of μ at the point a: ν is a nonzero Radon measure which is the weak limit of a sequence of rescaled blow-ups of μ at a along radii tending to 0.

    Equations
    • One or more equations did not get rendered due to their size.
    Instances For

      Elementary facts about weak convergence #

      theorem MeasureTheory.Measure.WeaklyConverges.comp {n : ℕ} {μ : ℕ → Measure (EuclideanSpace ℝ (Fin n))} {ν : Measure (EuclideanSpace ℝ (Fin n))} (h : WeaklyConverges μ ν) {φ : ℕ → ℕ} (hφ : Filter.Tendsto φ Filter.atTop Filter.atTop) :
      WeaklyConverges (fun (j : ℕ) => μ (φ j)) ν

      Weak convergence is inherited by subsequences (more generally, by any reindexing along a map tending to infinity).

      theorem MeasureTheory.Measure.WeaklyConverges.smul_of_tendsto_one {n : ℕ} {μ : ℕ → Measure (EuclideanSpace ℝ (Fin n))} {ν : Measure (EuclideanSpace ℝ (Fin n))} (h : WeaklyConverges μ ν) {e : ℕ → ENNReal} (he1 : Filter.Tendsto (fun (i : ℕ) => (e i).toReal) Filter.atTop (nhds 1)) :
      WeaklyConverges (fun (i : ℕ) => e i • μ i) ν

      Rescaling a weakly convergent sequence by constants tending to 1 does not change the weak limit.

      theorem MeasureTheory.Measure.WeaklyConverges.congr_seq {n : ℕ} {F G : ℕ → Measure (EuclideanSpace ℝ (Fin n))} {ν : Measure (EuclideanSpace ℝ (Fin n))} (hFG : ∀ (i : ℕ), F i = G i) (h : WeaklyConverges G ν) :

      Weak convergence only depends on the underlying sequence of measures.

      Extracting a strictly decreasing sequence of radii #

      theorem exists_strictMono_strictAnti_subseq {r : ℕ → ℝ} (hpos : ∀ (i : ℕ), 0 < r i) (hr : Filter.Tendsto r Filter.atTop (nhds 0)) :
      ∃ (φ : ℕ → ℕ), StrictMono φ ∧ StrictAnti fun (j : ℕ) => r (φ j)

      A positive sequence tending to 0 has a strictly decreasing subsequence.

      Basic properties of the blow-up maps #

      theorem blowUpMap_preimage_ball {n : ℕ} (a : EuclideanSpace ℝ (Fin n)) {r : ℝ} (hr : 0 < r) (ρ : ℝ) :
      theorem blowUpMap_preimage_closedBall {n : ℕ} (a : EuclideanSpace ℝ (Fin n)) {r : ℝ} (hr : 0 < r) (ρ : ℝ) :
      noncomputable def blowUpHomeomorph {n : ℕ} (a : EuclideanSpace ℝ (Fin n)) {r : ℝ} (hr : r ≠ 0) :

      The blow-up map as a homeomorphism of Euclidean space.

      Equations
      Instances For
        theorem regular_map_blowUp {n : ℕ} {μ : MeasureTheory.Measure (EuclideanSpace ℝ (Fin n))} (hμ : μ.Regular) (a : EuclideanSpace ℝ (Fin n)) {r : ℝ} (hr : r ≠ 0) :

        The push-forward of a Radon measure under a blow-up map is a Radon measure.

        theorem regular_smul_map_blowUp {n : ℕ} {μ : MeasureTheory.Measure (EuclideanSpace ℝ (Fin n))} (hμ : μ.Regular) (a : EuclideanSpace ℝ (Fin n)) {r : ℝ} (hr : r ≠ 0) {c : ENNReal} (hc : c ≠ ⊤) :

        A finite rescaling of the push-forward of a Radon measure under a blow-up map is again a Radon measure.

        theorem map_blowUp_apply_ball {n : ℕ} (μ : MeasureTheory.Measure (EuclideanSpace ℝ (Fin n))) (a : EuclideanSpace ℝ (Fin n)) {r : ℝ} (hr : 0 < r) (ρ : ℝ) :

        Balls of positive and finite measure #

        theorem measure_ball_pos_of_mem_support {n : ℕ} {μ : MeasureTheory.Measure (EuclideanSpace ℝ (Fin n))} {a : EuclideanSpace ℝ (Fin n)} (ha : a ∈ μ.support) {ρ : ℝ} (hρ : 0 < ρ) :
        0 < μ (Metric.ball a ρ)