AutoSamplingTheory.TechnicalLemmas.StochasticProcesses.CarreDuChamp
8 named declarations scanned from AutoSamplingTheory/TechnicalLemmas/StochasticProcesses/CarreDuChamp.lean.
Declarations
def AutoSamplingTheory.TechnicalLemmas.StochasticProcesses.CarreDuChamp.carreDuChamp Compiled Compiled
- Chewi Definition 1.2.12: the carre du champ of a linear generator.
def carreDuChamp
(generator : (X → ℝ) →ₗ[ℝ] (X → ℝ))
(f g : X → ℝ) : X → ℝ :=
fun x => (2 : ℝ)⁻¹ *
(generator (f * g) x - f x * generator g x - g x * generator f x)
/-- The carre du champ is symmetric in its observable arguments. -/
AutoSamplingTheory/TechnicalLemmas/StochasticProcesses/CarreDuChamp.lean:35published source at 7bcd37294df1Open detailed card
theorem AutoSamplingTheory.TechnicalLemmas.StochasticProcesses.CarreDuChamp.carreDuChamp_comm Compiled Not mapped
- The carre du champ is symmetric in its observable arguments.
theorem carreDuChamp_comm
(generator : (X → ℝ) →ₗ[ℝ] (X → ℝ))
(f g : X → ℝ) :
carreDuChamp generator f g = carreDuChamp generator g f := by
funext x
have hfg : f * g = g * f := by
funext y
exact mul_comm (f y) (g y)
simp only [carreDuChamp, hfg]
ring
/-- Chewi Definition 1.2.28: the iterated carre du champ. -/
AutoSamplingTheory/TechnicalLemmas/StochasticProcesses/CarreDuChamp.lean:42published source at 7bcd37294df1
def AutoSamplingTheory.TechnicalLemmas.StochasticProcesses.CarreDuChamp.iteratedCarreDuChamp Compiled Compiled
- Chewi Definition 1.2.28: the iterated carre du champ.
def iteratedCarreDuChamp
(generator : (X → ℝ) →ₗ[ℝ] (X → ℝ))
(f g : X → ℝ) : X → ℝ :=
fun x => (2 : ℝ)⁻¹ *
(generator (carreDuChamp generator f g) x
- carreDuChamp generator f (generator g) x
- carreDuChamp generator g (generator f) x)
/-- The iterated carre du champ inherits symmetry from the first one. -/
AutoSamplingTheory/TechnicalLemmas/StochasticProcesses/CarreDuChamp.lean:54published source at 7bcd37294df1Open detailed card
theorem AutoSamplingTheory.TechnicalLemmas.StochasticProcesses.CarreDuChamp.iteratedCarreDuChamp_comm Compiled Not mapped
- The iterated carre du champ inherits symmetry from the first one.
theorem iteratedCarreDuChamp_comm
(generator : (X → ℝ) →ₗ[ℝ] (X → ℝ))
(f g : X → ℝ) :
iteratedCarreDuChamp generator f g =
iteratedCarreDuChamp generator g f := by
funext x
simp only [iteratedCarreDuChamp, carreDuChamp_comm]
ring
/-- Chewi Definition 1.2.29: the curvature-dimension condition
`CD(alpha, infinity)`, including the source requirement `alpha > 0`. -/
AutoSamplingTheory/TechnicalLemmas/StochasticProcesses/CarreDuChamp.lean:63published source at 7bcd37294df1
def AutoSamplingTheory.TechnicalLemmas.StochasticProcesses.CarreDuChamp.SatisfiesBakryEmery Compiled Compiled
- Chewi Definition 1.2.29: the curvature-dimension condition `CD(alpha, infinity)`, including the source requirement `alpha > 0`.
def SatisfiesBakryEmery
(generator : (X → ℝ) →ₗ[ℝ] (X → ℝ))
(alpha : ℝ) : Prop :=
0 < alpha ∧ ∀ (f : X → ℝ) (x : X),
alpha * carreDuChamp generator f f x ≤
iteratedCarreDuChamp generator f f x
/-- Chewi Lemma 1.2.13: the Markov-semigroup Jensen inequality implies
nonnegativity of the carre du champ after taking the right-generator limit.
The theorem is pointwise. `hf` and `hf2` are the actual right difference-
quotient limits for `f` and `f²`; `hcontinuous` is strong/right continuity of
the orbit at the selected state. -/
AutoSamplingTheory/TechnicalLemmas/StochasticProcesses/CarreDuChamp.lean:74published source at 7bcd37294df1Open detailed card
theorem AutoSamplingTheory.TechnicalLemmas.StochasticProcesses.CarreDuChamp.carreDuChamp_nonneg_of_markov_jensen_rightGenerator Compiled Compiled
- Chewi Lemma 1.2.13: the Markov-semigroup Jensen inequality implies nonnegativity of the carre du champ after taking the right-generator limit. The theorem is pointwise. `hf` and `hf2` are the actual right difference- quotient limits for `f` and `f²`; `hcontinuous` is strong/right continuity of the orbit at the selected state.
theorem carreDuChamp_nonneg_of_markov_jensen_rightGenerator
(P : ℝ≥0 → (X → ℝ) → X → ℝ)
(generator : (X → ℝ) →ₗ[ℝ] (X → ℝ))
(f : X → ℝ) (x : X)
(hjensen : ∀ h : ℝ≥0, 0 < h → (P h f x) ^ 2 ≤ P h (f * f) x)
(hf : Tendsto
(fun h : ℝ≥0 => (P h f x - f x) / (h : ℝ))
(𝓝[>] 0) (𝓝 (generator f x)))
(hf2 : Tendsto
(fun h : ℝ≥0 => (P h (f * f) x - (f x) ^ 2) / (h : ℝ))
(𝓝[>] 0) (𝓝 (generator (f * f) x)))
(hcontinuous : Tendsto (fun h : ℝ≥0 => P h f x)
(𝓝[>] 0) (𝓝 (f x))) :
0 ≤ carreDuChamp generator f f x := by
let gap : ℝ≥0 → ℝ := fun h =>
(P h (f * f) x - (P h f x) ^ 2) / (2 * (h : ℝ))
have hgap_nonneg : ∀ᶠ h in 𝓝[>] (0 : ℝ≥0), 0 ≤ gap h := by
filter_upwards [self_mem_nhdsWithin] with h hh
have hh0 : 0 < h := by simpa only [mem_Ioi] using hh
exact div_nonneg (sub_nonneg.mpr (hjensen h hh0)) (by positivity)
have hrewrite : ∀ᶠ h in 𝓝[>] (0 : ℝ≥0),
gap h =
(2 : ℝ)⁻¹ * ((P h (f * f) x - (f x) ^ 2) / (h : ℝ)) -
(2 : ℝ)⁻¹ * (((P h f x - f x) / (h : ℝ)) *
(P h f x + f x)) := by
filter_upwards [self_mem_nhdsWithin] with h hh
have hh0 : (h : ℝ) ≠ 0 := by
have : 0 < h := by simpa only [mem_Ioi] using hh
exact_mod_cast this.ne'
dsimp [gap]
field_simp
ring
have hlimit : Tendsto gap (𝓝[>] (0 : ℝ≥0))
(𝓝 (carreDuChamp generator f f x)) := by
have hconst : Tendsto (fun _ : ℝ≥0 => f x)
(nhdsWithin 0 (Set.Ioi 0)) (nhds (f x)) :=
tendsto_const_nhds
have hsum : Tendsto (fun h : ℝ≥0 => P h f x + f x)
(nhdsWithin 0 (Set.Ioi 0)) (nhds (f x + f x)) :=
hcontinuous.add hconst
have hprod := hf.mul hsum
have hcombined := (hf2.const_mul (2 : ℝ)⁻¹).sub
(hprod.const_mul (2 : ℝ)⁻¹)
have hvalue :
-- Source excerpt truncated; follow the exact source link.
AutoSamplingTheory/TechnicalLemmas/StochasticProcesses/CarreDuChamp.lean:87published source at 7bcd37294df1Open detailed card
Excerpt truncated; the exact source link is authoritative.
theorem AutoSamplingTheory.TechnicalLemmas.StochasticProcesses.CarreDuChamp.fundamental_integration_by_parts Compiled Compiled
- Chewi Theorem 1.2.14: stationarity and generator symmetry imply the fundamental integration-by-parts identity between the Dirichlet form and the integrated carre du champ. The three integrability hypotheses are the exact terms expanded from Gamma; they prevent the totalized Bochner integral from hiding a domain failure.
theorem fundamental_integration_by_parts
[MeasurableSpace X]
(mu : Measure X) (generator : (X → ℝ) →ₗ[ℝ] (X → ℝ))
(f g : X → ℝ)
(hLfg : Integrable (generator (f * g)) mu)
(hfLg : Integrable (fun x => f x * generator g x) mu)
(hgLf : Integrable (fun x => g x * generator f x) mu)
(hstationary : (∫ x, generator (f * g) x ∂mu) = 0)
(hsymmetric :
(∫ x, f x * generator g x ∂mu) =
∫ x, g x * generator f x ∂mu) :
FunctionalInequalities.Generator.dirichletForm mu generator f g =
FunctionalInequalities.Generator.dirichletForm mu generator g f ∧
FunctionalInequalities.Generator.dirichletForm mu generator f g =
∫ x, carreDuChamp generator f g x ∂mu := by
have hsub : Integrable
(fun x => generator (f * g) x - f x * generator g x) mu :=
hLfg.sub hfLg
have hgammaIntegral :
(∫ x, carreDuChamp generator f g x ∂mu) =
(2 : ℝ)⁻¹ *
((∫ x, generator (f * g) x ∂mu) -
(∫ x, f x * generator g x ∂mu) -
∫ x, g x * generator f x ∂mu) := by
change
(∫ x, (2 : ℝ)⁻¹ *
(generator (f * g) x - f x * generator g x -
g x * generator f x) ∂mu) = _
rw [integral_const_mul,
integral_sub hsub hgLf, integral_sub hLfg hfLg]
constructor
· simp only [FunctionalInequalities.Generator.dirichletForm]
rw [hsymmetric]
· simp only [FunctionalInequalities.Generator.dirichletForm]
rw [hgammaIntegral, hstationary, hsymmetric]
ring
/-- Chewi Corollary 1.2.15: the negative reversible generator has a
nonnegative quadratic form once Gamma is pointwise nonnegative. -/
AutoSamplingTheory/TechnicalLemmas/StochasticProcesses/CarreDuChamp.lean:153published source at 7bcd37294df1Open detailed card
theorem AutoSamplingTheory.TechnicalLemmas.StochasticProcesses.CarreDuChamp.negativeGenerator_quadratic_nonneg Compiled Compiled
- Chewi Corollary 1.2.15: the negative reversible generator has a nonnegative quadratic form once Gamma is pointwise nonnegative.
theorem negativeGenerator_quadratic_nonneg
[MeasurableSpace X]
(mu : Measure X) (generator : (X → ℝ) →ₗ[ℝ] (X → ℝ))
(f : X → ℝ)
(hLf2 : Integrable (generator (f * f)) mu)
(hfLf : Integrable (fun x => f x * generator f x) mu)
(hstationary : (∫ x, generator (f * f) x ∂mu) = 0)
(hgamma : ∀ x, 0 ≤ carreDuChamp generator f f x) :
0 ≤ FunctionalInequalities.Generator.dirichletForm mu generator f f := by
have hibp := fundamental_integration_by_parts mu generator f f
hLf2 hfLf hfLf hstationary rfl
rw [hibp.2]
exact integral_nonneg_of_ae (Filter.Eventually.of_forall hgamma)
end CarreDuChamp
end StochasticProcesses
end TechnicalLemmas
end AutoSamplingTheory
AutoSamplingTheory/TechnicalLemmas/StochasticProcesses/CarreDuChamp.lean:192published source at 7bcd37294df1Open detailed card