Actual PBPS: the unique positive macroscopic defect root
AutoSamplingTheory.ExampleCases.ProximalBPS.MacroscopicDefectRoot.actual_unique_positive_macroscopic_defect_root · theorem · Teaching coverage
Mathematical statement
Let E be a finite-dimensional real Hilbert Borel space with canonical volume, including the explicit rank-zero extension. Let V:E→ℝ be C², 0<α≤β, and assume α‖v‖²≤D²V(x)[v,v]≤β‖v‖² for every x,v. Assume η>0 and βη≤1. Define μ(dx) proportional to exp(−V(x))dx, J as the law of (X,X+√η Z) for independent X~μ and Z~N(0,I), ν=J.snd, and Λ as the law of (Y,2X−Y) under J. These are probability laws. Put mY=comap(snd), H_P=L² classes measurable with respect to mY, P=i∘E[·|Y] and the canonical M:u↦u∘snd. Then H_P=ran(P), P is identity on H_P, and there exists an onto linear isometry e:L²(ν;ℝ)≃H_P with i e=M. There is a Markov kernel S whose every-state normalized law is S(y)=volume.tilted(x↦−V((y+x)/2)−‖y−x‖²/(8η)); Λ.IsCondKernel S and both Λ marginals equal ν. The same joint reflection F(x,y)=(x,2x−y) gives the involutive selfadjoint isometry U, with Uf=f∘F J-almost everywhere for every f. There is a bounded selfadjoint T on the full real L²(ν), with ‖Tu‖≤‖u‖, Tu(y)=∫u(x)S(y,dx) ν-almost everywhere for each u, and preserved integral. On H_P put A=PUP restricted via i and orthogonal projection, and B=(I_J−P)UPi:H_P→L²(J). Then A=eTe⁻¹ is selfadjoint and contractive, PB=0. There is a bounded positive real scalar Γ with Γ²=I−T². For the SAME transported Γ_P=eΓe⁻¹, positivity holds and Γ_P²=I_H_P−A²=B*B. Every f∈H_P satisfies ‖Bf‖=‖Γ_Pf‖ and ‖Γ_Pf‖²=‖f‖²−‖Af‖². EVERY bounded positive G on H_P whose square is I_H_P−A² equals Γ_P, independently of any energy premise. The genuine original-input consumer additionally derives ‖Γ_Pf‖≤‖f‖. Closedness/completeness, normalization, onto-M, positivity, roots and energy are internally derived; no caller certificate is assumed.
Lean statement · actual_unique_positive_macroscopic_defect_root
Let E be a finite-dimensional real Hilbert Borel space with canonical volume, including the explicit rank-zero extension. Let V:E→ℝ be C², 0<α≤β, and assume α‖v‖²≤D²V(x)[v,v]≤β‖v‖² for every x,v. Assume η>0 and βη≤1. Define μ(dx) proportional to exp(−V(x))dx, J as the law of (X,X+√η Z) for independent X~μ and Z~N(0,I), ν=J.snd, and Λ as the law of (Y,2X−Y) under J. These are probability laws. Put mY=comap(snd), H_P=L² classes measurable with respect to mY, P=i∘E[·|Y] and the canonical M:u↦u∘snd. Then H_P=ran(P), P is identity on H_P, and there exists an onto linear isometry e:L²(ν;ℝ)≃H_P with i e=M. There is a Markov kernel S whose every-state normalized law is S(y)=volume.tilted(x↦−V((y+x)/2)−‖y−x‖²/(8η)); Λ.IsCondKernel S and both Λ marginals equal ν. The same joint reflection F(x,y)=(x,2x−y) gives the involutive selfadjoint isometry U, with Uf=f∘F J-almost everywhere for every f. There is a bounded selfadjoint T on the full real L²(ν), with ‖Tu‖≤‖u‖, Tu(y)=∫u(x)S(y,dx) ν-almost everywhere for each u, and preserved integral. On H_P put A=PUP restricted via i and orthogonal projection, and B=(I_J−P)UPi:H_P→L²(J). Then A=eTe⁻¹ is selfadjoint and contractive, PB=0. There is a bounded positive real scalar Γ with Γ²=I−T². For the SAME transported Γ_P=eΓe⁻¹, positivity holds and Γ_P²=I_H_P−A²=B*B. Every f∈H_P satisfies ‖Bf‖=‖Γ_Pf‖ and ‖Γ_Pf‖²=‖f‖²−‖Af‖². EVERY bounded positive G on H_P whose square is I_H_P−A² equals Γ_P, independently of any energy premise. The genuine original-input consumer additionally derives ‖Γ_Pf‖≤‖f‖. Closedness/completeness, normalization, onto-M, positivity, roots and energy are internally derived; no caller certificate is assumed.
Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.
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)Proof roadmap
- 1Produce the actual probability laws and reflected conditional operator
Under the original C², both global Hessian bounds and capped positive η, the accepted actual centered-defect producer gives probability μ,J,ν, the every-y normalized reflected S, stationary disintegration, literal reflection U and selfadjoint contractive mean-preserving scalar T. Align independently produced pullbacks/reflections by their every-observable almost-everywhere action; no alternate kernel or operator is supplied.
- 2Identify the exact closed macro space and canonical onto isometry
The conditional projection equals the orthogonal projection onto H_P=lpMeas. Its range is H_P and it fixes every vector in H_P. The accepted actual range theorem identifies the SAME canonical M range with ran(P); restrict M to its range and use that equality to obtain the isometric equivalence e with inclusion i e=M. Ambient product measurability and completeness of the closed subspace are derived internally.
- 3Identify the same macroscopic reflected operator
The already proved pullback intertwining relation evaluated at e⁻¹f yields A=eTe⁻¹. Isometric conjugation preserves selfadjointness, and norm preservation transfers the scalar contraction to every macro f. The ambient operator A_J=PUP and the macro endomorphism A are kept separately typed.
- 4Restrict the correct full-joint Gram identity
Write B₀=(I_J−P)UP and B=B₀i. Projection idempotence gives PBf=0. The actual reflection block theorem gives B₀*B₀=P−A_J². Compose with i* and i; using Pi=i and iA=A_Ji, this becomes B*B=I_H_P−A². Replacing full-joint P by I_J would be false, including U=I with a nonidentity P.
- 5Transport the internally constructed positive real scalar root
The shared real L² root theorem produces Γ≥0 with Γ²=I−T². Define Γ_P by the SAME e-conjugation. Adjoint conjugation preserves positivity; the star-algebra equivalence preserves multiplication, subtraction and identity, so Γ_P²=I_H_P−A² and agrees with the preceding typed Gram operator. No real CFC or root witness is a public premise.
- 6Recover the macro norm and energy identities
Apply the scalar energy theorem to e⁻¹f and use the same isometry and A-conjugation to obtain macro energy. The adjoint inner-product identities for B and the positive selfadjoint Γ_P have equal squared norms since B*B=Γ_P²; nonnegative norms then give equality of norms.
- 7Prove uniqueness for every positive same-square macro alternative
For ANY positive G with G²=I_H_P−A², pull it back by e⁻¹. Its positivity and square are preserved, so the shared real scalar uniqueness theorem forces e⁻¹Ge=Γ. Conjugate back to obtain G=Γ_P. The universal alternative-root quantifier is outside the every-f energy conjunction and assumes no alternative energy identity.
- 8Exercise the original-input consumer without certificates
The Test takes the original potential and Hessian/step assumptions, invokes the actual macro theorem, and derives root contractivity from energy and the nonnegativity of ‖Af‖². It does not supply a probability kernel, onto map, defect, root or energy premise.
Full assumptions and notation
All objects and hypotheses
- Original C² finite real Hilbert/Borel potential, 0<α≤β, both global Hessians, η>0, βη≤1. Rank-zero base extension and legal αη=1 remain explicit; L² is not assumed finite-dimensional.
- The actual probability laws, normalized every-state kernel, canonical onto isometry, same reflected/conditional operators, positivity and roots/energy are conclusions, not caller certificates. Conditional actions are per-observable almost everywhere.
- The macro domain is exactly the complete closed real HP=lpMeas=ran(P); full-joint P and identity on HP are kept distinct. L² need not be finite-dimensional. ALL positive same-square alternatives require no supplied energy identity and quantify outside every-f energy.
Mathematical proof
1. Produce the actual probability laws and reflected conditional operator
Under the original C², both global Hessian bounds and capped positive η, the accepted actual centered-defect producer gives probability μ,J,ν, the every-y normalized reflected S, stationary disintegration, literal reflection U and selfadjoint contractive mean-preserving scalar T. Align independently produced pullbacks/reflections by their every-observable almost-everywhere action; no alternate kernel or operator is supplied.
Corresponding Lean step
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
Exact excerpt from the compiled declaration in its local context; preceding canonical lets and earlier proved facts remain in scope.
2. Identify the exact closed macro space and canonical onto isometry
The conditional projection equals the orthogonal projection onto H_P=lpMeas. Its range is H_P and it fixes every vector in H_P. The accepted actual range theorem identifies the SAME canonical M range with ran(P); restrict M to its range and use that equality to obtain the isometric equivalence e with inclusion i e=M. Ambient product measurability and completeness of the closed subspace are derived internally.
Corresponding Lean step
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]
Exact excerpt from the compiled declaration in its local context; preceding canonical lets and earlier proved facts remain in scope.
3. Identify the same macroscopic reflected operator
The already proved pullback intertwining relation evaluated at e⁻¹f yields A=eTe⁻¹. Isometric conjugation preserves selfadjointness, and norm preservation transfers the scalar contraction to every macro f. The ambient operator A_J=PUP and the macro endomorphism A are kept separately typed.
Corresponding Lean step
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)
Exact excerpt from the compiled declaration in its local context; preceding canonical lets and earlier proved facts remain in scope.
4. Restrict the correct full-joint Gram identity
Write B₀=(I_J−P)UP and B=B₀i. Projection idempotence gives PBf=0. The actual reflection block theorem gives B₀*B₀=P−A_J². Compose with i* and i; using Pi=i and iA=A_Ji, this becomes B*B=I_H_P−A². Replacing full-joint P by I_J would be false, including U=I with a nonidentity P.
Corresponding Lean step
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
Exact excerpt from the compiled declaration in its local context; preceding canonical lets and earlier proved facts remain in scope.
5. Transport the internally constructed positive real scalar root
The shared real L² root theorem produces Γ≥0 with Γ²=I−T². Define Γ_P by the SAME e-conjugation. Adjoint conjugation preserves positivity; the star-algebra equivalence preserves multiplication, subtraction and identity, so Γ_P²=I_H_P−A² and agrees with the preceding typed Gram operator. No real CFC or root witness is a public premise.
Corresponding Lean step
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
Exact excerpt from the compiled declaration in its local context; preceding canonical lets and earlier proved facts remain in scope.
6. Recover the macro norm and energy identities
Apply the scalar energy theorem to e⁻¹f and use the same isometry and A-conjugation to obtain macro energy. The adjoint inner-product identities for B and the positive selfadjoint Γ_P have equal squared norms since B*B=Γ_P²; nonnegative norms then give equality of norms.
Corresponding Lean step
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)
Exact excerpt from the compiled declaration in its local context; preceding canonical lets and earlier proved facts remain in scope.
7. Prove uniqueness for every positive same-square macro alternative
For ANY positive G with G²=I_H_P−A², pull it back by e⁻¹. Its positivity and square are preserved, so the shared real scalar uniqueness theorem forces e⁻¹Ge=Γ. Conjugate back to obtain G=Γ_P. The universal alternative-root quantifier is outside the every-f energy conjunction and assumes no alternative energy identity.
Corresponding Lean step
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
Exact excerpt from the compiled declaration in its local context; preceding canonical lets and earlier proved facts remain in scope.
8. Exercise the original-input consumer without certificates
The Test takes the original potential and Hessian/step assumptions, invokes the actual macro theorem, and derives root contractivity from energy and the nonnegativity of ‖Af‖². It does not supply a probability kernel, onto map, defect, root or energy premise.
Corresponding Lean step
classical
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⟩
dsimp only
obtain ⟨hμ,hJ,hν,hHP,hPf,S,hS,hSd,hSc,hSf,hSs,e,he,U,hU,hUi,hUs,T,hTs,
hT,hA,hAs,hAn,hPB,Γ,hΓ,hΓSq,hΓP,hΓPSq,hGram,hEnergy,hUnique⟩ :=
AutoSamplingTheory.ExampleCases.ProximalBPS.MacroscopicDefectRoot.actual_unique_positive_macroscopic_defect_root
hα hαβ hV hH hη hβη
refine ⟨hμ,hJ,hν,hHP,hPf,S,hS,hSd,hSc,hSf,hSs,e,he,U,hU,hUi,hUs,T,hTs,
hT,hA,hAs,hAn,hPB,Γ,hΓ,hΓSq,hΓP,hΓPSq,hGram,?_,hUnique⟩
intro f
have hf := hEnergy f
refine ⟨hf.1,hf.2,?_⟩
have hnonneg : 0 ≤ ‖f‖^2 - ‖(e.conjStarAlgEquiv Γ) f‖^2 := by
rw [hf.2]
simp only [sub_sub_cancel]
positivity
nlinarith [norm_nonneg ((e.conjStarAlgEquiv Γ) f),norm_nonneg f]
Exact original-input consumer proof, with internally derived measurability Fact and no supplied root/energy premise.
Lean verification
The exact proof begins folded immediately after the mathematical argument; the statement is folded beside the claim above.
Lean proof · actual_unique_positive_macroscopic_defect_root
Produce the actual probability laws and reflected conditional operator; Identify the exact closed macro space and canonical onto isometry; Identify the same macroscopic reflected operator; Restrict the correct full-joint Gram identity; Transport the internally constructed positive real scalar root; Recover the macro norm and energy identities; Prove uniqueness for every positive same-square macro alternative; Exercise the original-input consumer without certificates
Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.
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_rootScope and omitted-condition boundaries
- Selected printed B1-B5 first Gram identity/B10-B11 on the exact closed macro domain H_P=lpMeas=ran(P), using the SAME actual M/e/U/T and transported root. Full-joint Gram is P−A_J², not I_J−A_J². The other B5 identity, centered root order/inverse/polar, H1, event process/nonexplosion/invariance/hypocoercivity/main mixing, implementation error and actual-input expected query costs/composition remain separate.
Sources, dependencies, and reuse
Source and reuse
Samplinglib parents called
AutoSamplingTheory.ExampleCases.ProximalBPS.CenteredDefectOperator.actual_centered_selfadjoint_defectAutoSamplingTheory.ExampleCases.ProximalBPS.MacroscopicRange.actual_macroscopic_centered_rangeAutoSamplingTheory.ExampleCases.ProximalBPS.ReflectionL2.actual_reflection_block_identitiesAutoSamplingTheory.TechnicalLemmas.Measure.L2RealSquareRoot.exists_positive_real_square_rootAutoSamplingTheory.TechnicalLemmas.Measure.L2RealSquareRootUnique.positive_square_roots_unique
Mathlib API called (external library)
- ContinuousLinearMap.ext
- Submodule.range_starProjection
- LinearIsometry.equivRange
- LinearIsometryEquiv.ofEq
- LinearIsometryEquiv.conjStarAlgEquiv
- ContinuousLinearMap.IsPositive.conj_adjoint
- ContinuousLinearMap.adjoint_comp
- ContinuousLinearMap.apply_norm_sq_eq_inner_adjoint_right
Mathematical sources
- arXiv2609.06905v1 AppendixB1-B5 first identity/B10-B11 and D1; original C2/two Hessian/positive capped eta — Selected printed B1-B5 first Gram identity/B10-B11 on the exact closed macro domain H_P=lpMeas=ran(P), using the SAME actual M/e/U/T and transported root. Full-joint Gram is P−A_J², not I_J−A_J². The other B5 identity, centered root order/inverse/polar, H1, event process/nonexplosion/invariance/hypocoercivity/main mixing, implementation error and actual-input expected query costs/composition remain separate.
Samplinglib prose is not a quotation or a source-equivalence certificate. Definitions and aliases are explained as constructions, not counted as new mathematical proofs.