Plain-English statement
Independently exact-science63 verified 4d02622332d02d0bd6c977d3cee48fd535ebf203. Original C2/two global Hessian bounds,0<alpha<=beta,eta>0,betaeta<=1 internally produce SAME stationary reflected S/T/U, canonical M onto complete HP=lpMeas=ran(P), and scalar positive root transported by SAME e. A=e T e^-1, typed leakage B:HP-to-joint, GammaP^2=I_HP-A^2=B.adjoint composed B, norm/energy for EVERY macro class and ALL positive same-square macro uniqueness without alternative energy. Rank0 and alphaeta=1 retained. Fulljoint Gram remains P-AJ^2. Other B5, centered root order/inverse/polar,H1/dynamics/main/error/cost/composition remain open.
Read the mathematics first, then descend into Lean
You do not need to know Lean before opening this panel. The page keeps the paper-level theorem, rigorous proof obligations, exact Lean declaration, and proof dependencies as separate layers so a first-time reader can move down one layer at a time.
Proof architecture
Start with the tree when learning: prerequisites sit below the theorem and downstream results sit above it. Switch to the network when you want to understand where this declaration lives in the local formal library. Every mapped node is clickable.
Graph rule: only dependencies found by the ASTIS source scan are drawn. Missing tactic indirection is treated as an under-approximation; the site never invents an edge just to make a prettier graph.
How to read the exact Lean declaration
Read a Lean theorem left-to-right exactly as you would unpack a mathematical sentence: name → ambient types → automatically inferred structures → explicit hypotheses → conclusion → proof. Then read the proof top-to-bottom as transformations of the current goal.
- NameWhat reusable mathematical fact is being created?
- ParametersWhich symbols are arbitrary, and which structures are inferred by typeclass search?
- PropositionAfter the colon, translate the Lean expression back into a paper statement.
- Proof actionsAfter
by, ask what each tactic does to the mathematical goal—not only what syntax it uses.
Syntax used on this page
This glossary is filtered to syntax that actually occurs in the declaration above. Open a symbol only when you meet it, rather than memorizing Lean grammar in advance.
Source voice and ASTIS voice stay separate
When Samplinglib shows a short quotation from Chewi, it is labeled as a source excerpt and linked to the canonical book page. Intuition, expanded proof steps, hidden regularity assumptions, and Lean explanations are ASTIS-authored commentary. A quotation never substitutes for a formal proof, and an ASTIS explanation is never attributed to the textbook author.
Lean statement
theorem actual_unique_positive_macroscopic_defect_root
{E : Type*} [NormedAddCommGroup E] [InnerProductSpace ℝ E]
[FiniteDimensional ℝ E] [MeasurableSpace E] [BorelSpace E]
{V : E → ℝ} {α β : ℝ≥0} {η : ℝ}
(hα : 0 < (α : ℝ)) (hαβ : α ≤ β) (hV : ContDiff ℝ 2 V)
(hH : ∀ x v : E,
(α : ℝ)*‖v‖^2 ≤ (fderiv ℝ (fderiv ℝ V) x v) v ∧
(fderiv ℝ (fderiv ℝ V) x v) v ≤ (β : ℝ)*‖v‖^2)
(hη : 0 < η) (hβη : (β : ℝ)*η ≤ 1) :
let μ := (volume : Measure E).tilted (fun x => -V x)
let J := (μ.prod (stdGaussian E)).map
(fun p : E × E => (p.1,p.1+Real.sqrt η • p.2))
let ν := J.snd
let Λ := J.map (fun p : E × E => (p.2,(2 : ℝ) • p.1-p.2))
let F := fun p : E × E => (p.1,(2 : ℝ) • p.1-p.2)
let mY := MeasurableSpace.comap Prod.snd (inferInstance : MeasurableSpace E)
letI : MeasurableSpace (E × E) := Prod.instMeasurableSpace
letI : Fact (mY ≤ (inferInstance : MeasurableSpace (E × E))) :=
⟨measurable_snd.comap_le⟩
let HP := lpMeas ℝ ℝ mY 2 J
let P : Lp ℝ 2 J →L[ℝ] Lp ℝ 2 J :=
HP.subtypeL ∘L condExpL2 ℝ ℝ (μ := J) measurable_snd.comap_le
let hp : MeasurePreserving (Prod.snd : E × E → E) J ν := ⟨measurable_snd,rfl⟩
let M : Lp ℝ 2 ν →ₗᵢ[ℝ] Lp ℝ 2 J := Lp.compMeasurePreservingₗᵢ ℝ Prod.snd hp
IsProbabilityMeasure μ ∧ IsProbabilityMeasure J ∧ IsProbabilityMeasure ν ∧
HP = P.toLinearMap.range ∧
(∀ f : HP, P (f : Lp ℝ 2 J) = f) ∧
∃ S : Kernel E E, IsMarkovKernel S ∧
(∀ y, S y = (volume : Measure E).tilted
(fun x => -V ((1/2 : ℝ) • (y+x)) - ‖y-x‖^2/(8*η))) ∧
Λ.IsCondKernel S ∧ Λ.fst = ν ∧ Λ.snd = ν ∧
∃ e : Lp ℝ 2 ν ≃ₗᵢ[ℝ] HP,
(∀ u : Lp ℝ 2 ν, (e u : Lp ℝ 2 J) = M u) ∧
∃ U : Lp ℝ 2 J →ₗᵢ[ℝ] Lp ℝ 2 J,
(∀ g : Lp ℝ 2 J, (U g : E × E → ℝ) =ᵐ[J] g ∘ F) ∧
Function.Involutive U ∧ IsSelfAdjoint U.toContinuousLinearMap ∧
∃ T : Lp ℝ 2 ν →L[ℝ] Lp ℝ 2 ν,
IsSelfAdjoint T ∧
(∀ u : Lp ℝ 2 ν,
‖T u‖ ≤ ‖u‖ ∧
(T u : E → ℝ) =ᵐ[ν] (fun y => ∫ x, u x ∂S y) ∧
(∫ y, T u y ∂ν) = ∫ y, u y ∂ν) ∧
let A : HP →L[ℝ] HP :=
HP.orthogonalProjectionOnto ∘L U.toContinuousLinearMap ∘L HP.subtypeL
let B : HP →L[ℝ] Lp ℝ 2 J :=
(((1 : Lp ℝ 2 J →L[ℝ] Lp ℝ 2 J)-P)*U.toContinuousLinearMap*P) ∘L HP.subtypeL
A = e.conjStarAlgEquiv T ∧ IsSelfAdjoint A ∧
(∀ f : HP, ‖A f‖ ≤ ‖f‖) ∧
(∀ f : HP, P (B f) = 0) ∧
∃ Γ : Lp ℝ 2 ν →L[ℝ] Lp ℝ 2 ν,
Γ.IsPositive ∧ Γ*Γ=(1 : Lp ℝ 2 ν →L[ℝ] Lp ℝ 2 ν)-T*T ∧
let ΓP : HP →L[ℝ] HP := e.conjStarAlgEquiv Γ
ΓP.IsPositive ∧ ΓP*ΓP=(1 : HP →L[ℝ] HP)-A*A ∧
B.adjoint ∘L B = ΓP*ΓP ∧
(∀ f : HP, ‖B f‖ = ‖ΓP f‖ ∧
‖ΓP f‖^2 = ‖f‖^2-‖A f‖^2) ∧
(∀ G : HP →L[ℝ] HP,
G.IsPositive → G*G=(1 : HP →L[ℝ] HP)-A*A → G=ΓP)
:= by
classical
dsimp only
let μ := (volume : Measure E).tilted (fun x => -V x)
let J := (μ.prod (stdGaussian E)).map
(fun p : E × E => (p.1,p.1+Real.sqrt η • p.2))
let ν := J.snd
let mY : MeasurableSpace (E × E) := MeasurableSpace.comap Prod.snd (inferInstance : MeasurableSpace E)
letI : MeasurableSpace (E × E) := Prod.instMeasurableSpace
letI : Fact (mY ≤ (inferInstance : MeasurableSpace (E × E))) :=
⟨measurable_snd.comap_le⟩
let HP := lpMeas ℝ ℝ mY 2 J
letI : NormedAddCommGroup HP := HP.normedAddCommGroup
letI : InnerProductSpace ℝ HP := HP.innerProductSpace
let P : Lp ℝ 2 J →L[ℝ] Lp ℝ 2 J :=
HP.subtypeL ∘L condExpL2 ℝ ℝ (μ := J) measurable_snd.comap_le
let hp : MeasurePreserving (Prod.snd : E × E → E) J ν := ⟨measurable_snd,rfl⟩
let M : Lp ℝ 2 ν →ₗᵢ[ℝ] Lp ℝ 2 J := Lp.compMeasurePreservingₗᵢ ℝ Prod.snd hp
rcases CenteredDefectOperator.actual_centered_selfadjoint_defect hα hαβ hV hH hη hβη with
⟨hμ,hJ,hν,S,hS,hSd,hSc,hSf,hSs,U,hU,hUi,hUs,M0,hM0,T,hTs,hAll,
q,hqa,hTq,hqi,hzero,hD,hDq,hDef,hRest⟩
letI : IsProbabilityMeasure μ := hμ
letI : IsProbabilityMeasure J := hJ
letI : IsProbabilityMeasure ν := hν
have hM0eq : M0 = M := by
apply LinearIsometry.ext
intro u
apply Lp.ext
exact (hM0 u).trans (Lp.coeFn_compMeasurePreserving u hp).symm
subst M0
have hPdef : P = HP.starProjection := rfl
have hPrange : P.toLinearMap.range = HP := by
change P.range = HP
rw [hPdef]
exact HP.range_starProjection
have hMR : M.toLinearMap.range = P.toLinearMap.range :=
(MacroscopicRange.actual_macroscopic_centered_range hα hαβ hV hH hη hβη).2.2.1
let e : Lp ℝ 2 ν ≃ₗᵢ[ℝ] HP :=
M.equivRange.trans (LinearIsometryEquiv.ofEq _ _ (hMR.trans hPrange))
have he (u : Lp ℝ 2 ν) : (e u : Lp ℝ 2 J) = M u := rfl
have hPf (f : HP) : P (f : Lp ℝ 2 J) = f := by
rw [hPdef]
exact HP.starProjection_mem_subspace_eq_self f
have hPP : P*P=P := by rw [hPdef];exact HP.isIdempotentElem_starProjection
have hPid (f : Lp ℝ 2 J) : P (P f)=P f := by
change (P*P) f=P f
rw [hPP]
let A : HP →L[ℝ] HP :=
HP.orthogonalProjectionOnto ∘L U.toContinuousLinearMap ∘L HP.subtypeL
let B0 : Lp ℝ 2 J →L[ℝ] Lp ℝ 2 J :=
((1 : Lp ℝ 2 J →L[ℝ] Lp ℝ 2 J)-P)*U.toContinuousLinearMap*P
let AJ := P*U.toContinuousLinearMap*P
let B : HP →L[ℝ] Lp ℝ 2 J := B0 ∘L HP.subtypeL
have hAincl (f : HP) : (A f : Lp ℝ 2 J) = AJ f := by
change P (U f) = P (U (P f))
rw [hPf]
have hAeq : A=e.conjStarAlgEquiv T := by
apply ContinuousLinearMap.ext
intro f
apply Subtype.ext
change (A f : Lp ℝ 2 J) = (e (T (e.symm f)) : Lp ℝ 2 J)
rw [hAincl,he]
have hf : M (e.symm f) = (f : Lp ℝ 2 J) := by
rw [← he,e.apply_symm_apply]
rw [← hf]
exact ((hAll (e.symm f)).2.1).symm
have hAapply (f : HP) : A f=e (T (e.symm f)) := by rw [hAeq];rfl
have hAs : IsSelfAdjoint A := by
rw [hAeq]
simpa only [LinearIsometryEquiv.conjStarAlgEquiv_apply,e.adjoint_eq_symm] using
hTs.conj_adjoint (e : Lp ℝ 2 ν →L[ℝ] HP)
have hAn (f : HP) : ‖A f‖ ≤ ‖f‖ := by
rw [hAapply,e.norm_map]
exact ((hAll (e.symm f)).2.2.1).trans_eq (e.symm.norm_map f)
have hPB (f : HP) : P (B f)=0 := by
change P (U (P f)-P (U (P f)))=0
rw [map_sub,hPid,sub_self]
obtain ⟨R,hR,hRf,U2,hU2,hU2i,hU2s,hRp,hBB,hBD,hBE⟩ :=
ReflectionL2.actual_reflection_block_identities μ hη
have hU2eq : U2=U := by
apply LinearIsometry.ext
intro f
apply Lp.ext
exact (hU2 f).trans (hU f).symm
subst U2
have hB0Gram : B0.adjoint ∘L B0=P-AJ*AJ := by
have hBBtyped : B0.adjoint ∘L B0 = P-AJ^2 := hBB
simpa only [pow_two] using hBBtyped
obtain ⟨Γ,hΓ,hΓSq,hEnergy⟩ :=
AutoSamplingTheory.TechnicalLemmas.Measure.L2RealSquareRoot.exists_positive_real_square_root
ν ((1 : Lp ℝ 2 ν →L[ℝ] Lp ℝ 2 ν)-T*T) hD
let ΓP : HP →L[ℝ] HP := e.conjStarAlgEquiv Γ
have hΓP : ΓP.IsPositive := by
simpa only [ΓP,LinearIsometryEquiv.conjStarAlgEquiv_apply,e.adjoint_eq_symm] using
hΓ.conj_adjoint (e : Lp ℝ 2 ν →L[ℝ] HP)
have hΓPSq : ΓP*ΓP=(1 : HP →L[ℝ] HP)-A*A := by
change e.conjStarAlgEquiv Γ*e.conjStarAlgEquiv Γ=_
rw [← map_mul,hΓSq,map_sub,map_one,map_mul,← hAeq]
have hGram : B.adjoint ∘L B=ΓP*ΓP := by
calc
B.adjoint ∘L B = HP.subtypeL.adjoint ∘L (B0.adjoint ∘L B0) ∘L HP.subtypeL := by
simp only [B,ContinuousLinearMap.adjoint_comp,ContinuousLinearMap.comp_assoc]
_ = HP.subtypeL.adjoint ∘L (P-AJ*AJ) ∘L HP.subtypeL := by rw [hB0Gram]
_ = (1 : HP →L[ℝ] HP)-A*A := by
apply ContinuousLinearMap.ext
intro f
rw [HP.adjoint_subtypeL]
change HP.orthogonalProjectionOnto (P f-AJ (AJ f))=f-A (A f)
rw [hPf,← hAincl f,← hAincl (A f),map_sub]
simp only [Submodule.orthogonalProjectionOnto_mem_subspace_eq_self]
_ = ΓP*ΓP := hΓPSq.symm
have hMacroEnergy (f : HP) : ‖ΓP f‖^2=‖f‖^2-‖A f‖^2 := by
have hs : ‖Γ (e.symm f)‖^2=‖e.symm f‖^2-‖T (e.symm f)‖^2 :=
(hEnergy (e.symm f)).trans (hDef (e.symm f))
simpa only [ΓP,LinearIsometryEquiv.conjStarAlgEquiv_apply_apply,hAapply,
e.norm_map,e.symm.norm_map] using hs
have hNorm (f : HP) : ‖B f‖=‖ΓP f‖ := by
have hb := B.apply_norm_sq_eq_inner_adjoint_right f
have hg := ΓP.apply_norm_sq_eq_inner_adjoint_right f
rw [hGram] at hb
rw [hΓP.isSelfAdjoint.adjoint_eq] at hg
exact (sq_eq_sq₀ (norm_nonneg _) (norm_nonneg _)).mp (hb.trans hg.symm)
have hUnique (G : HP →L[ℝ] HP) (hG : G.IsPositive)
(hGSq : G*G=(1 : HP →L[ℝ] HP)-A*A) : G=ΓP := by
let G0 : Lp ℝ 2 ν →L[ℝ] Lp ℝ 2 ν := e.symm.conjStarAlgEquiv G
have hG0 : G0.IsPositive := by
simpa only [G0,LinearIsometryEquiv.conjStarAlgEquiv_apply,e.symm.adjoint_eq_symm] using
hG.conj_adjoint (e.symm : HP →L[ℝ] Lp ℝ 2 ν)
have hPullA : e.symm.conjStarAlgEquiv A=T := by
rw [hAeq]
apply ContinuousLinearMap.ext
intro u
simp only [LinearIsometryEquiv.conjStarAlgEquiv_apply_apply,
LinearIsometryEquiv.symm_symm,e.symm_apply_apply,e.apply_symm_apply]
have hG0Sq : G0*G0=(1 : Lp ℝ 2 ν →L[ℝ] Lp ℝ 2 ν)-T*T := by
change e.symm.conjStarAlgEquiv G*e.symm.conjStarAlgEquiv G=_
rw [← map_mul,hGSq,map_sub,map_one,map_mul,hPullA]
have hEq : G0=Γ :=
AutoSamplingTheory.TechnicalLemmas.Measure.L2RealSquareRootUnique.positive_square_roots_unique
ν G0 Γ hG0 hΓ (hG0Sq.trans hΓSq.symm)
calc
G=e.conjStarAlgEquiv G0 := by
apply ContinuousLinearMap.ext
intro f
simp only [G0,LinearIsometryEquiv.conjStarAlgEquiv_apply_apply,
LinearIsometryEquiv.symm_symm,e.symm_apply_apply,e.apply_symm_apply]
_ = e.conjStarAlgEquiv Γ := congrArg e.conjStarAlgEquiv hEq
_ = ΓP := rfl
refine ⟨hμ,hJ,hν,hPrange.symm,hPf,S,hS,hSd,hSc,hSf,hSs,e,he,U,hU,hUi,hUs,
T,hTs,?_,hAeq,hAs,hAn,hPB,Γ,hΓ,hΓSq,hΓP,hΓPSq,hGram,?_,hUnique⟩
· intro u
exact (hAll u).2.2
· intro f
exact ⟨hNorm f,hMacroEnergy f⟩
end
end AutoSamplingTheory.ExampleCases.ProximalBPS.MacroscopicDefectRoot
#print axioms AutoSamplingTheory.ExampleCases.ProximalBPS.MacroscopicDefectRoot.actual_unique_positive_macroscopic_defect_root
Open AutoSamplingTheory/ExampleCases/ProximalBPS/MacroscopicDefectRoot.lean:15published source at ed709a7f320d
Proof architecture
Actual PBPS consumer; no SALD admission
Lean proof walkthrough
- Read the quantified variables and typeclass brackets as part of the mathematical statement; inferred arguments are not missing assumptions.
- `intro` introduces quantified hypotheses into the local proof context.
- `have` creates a named intermediate mathematical fact.
- `calc` records an equality or inequality chain matching a paper calculation.
- `rw` rewrites by an established identity.
- `simp` normalizes through registered definitional and theorem rewrites.
- `apply` reduces the goal to the hypotheses of a reusable theorem.
- `refine` instantiates a reusable theorem while leaving explicit subgoals.
Why the statement has this shape
The declaration is kept at the reusable level recorded by its Registry tags and direct consumers. Explicit measures, spaces, wrappers, and regularity hypotheses expose interfaces that paper notation often infers. A theorem card explains those interfaces but never widens the compiled statement.
Hidden assumptions and non-claims
- Measurability is represented explicitly or must be supplied by a dependency.
- Totalized `fderiv` values must not be read as a differentiability theorem.
- Almost-everywhere hypotheses depend on the stated measure and representative.