Actual PBPS squared defect: positive complex lift
AutoSamplingTheory.ExampleCases.ProximalBPS.DefectComplexLift.actual_positive_defect_complex_lift · 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², let 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∼μ,Z∼N(0,I), ν=J.snd, and Λ as the law of (Y,2X−Y) under J. The laws μ,J,ν are probabilities. There exists a Markov kernel S with, for every y, S(y)=volume.tilted(x↦−V((y+x)/2)−‖y−x‖²/(8η)), Λ.IsCondKernel S, Λ.fst=ν and Λ.snd=ν. There exists a selfadjoint bounded T on L²(ν;ℝ) such that for every u, ‖Tu‖≤‖u‖, Tu(y)=∫u(x)S(y,dx) ν-almost everywhere, and ∫Tu dν=∫u dν. Set D=I−T²; this exact full-domain squared defect is positive. Define the actual quotient maps ιu=u+0i, Rg=Re g, Qg=Im g and Cg=conj(g). Then ι preserves norm, Cg=g iff g=ιu for some real u, and there exists a bounded complex-linear positive Dc on L²(ν;ℂ) such that Dc g=ιD(Rg)+iιD(Qg), Dc(ιu)=ι(Du), and C(Dc g)=Dc(Cg), universally on their displayed domains. The operator T, positivity, kernel/law certificates and Dc are produced conclusions. No real Γ/root/descent/inverse is asserted.
Lean statement · actual_positive_defect_complex_lift
Let E be a finite-dimensional real Hilbert Borel space with canonical volume, including the explicit rank-zero extension. Let V:E→ℝ be C², let 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∼μ,Z∼N(0,I), ν=J.snd, and Λ as the law of (Y,2X−Y) under J. The laws μ,J,ν are probabilities. There exists a Markov kernel S with, for every y, S(y)=volume.tilted(x↦−V((y+x)/2)−‖y−x‖²/(8η)), Λ.IsCondKernel S, Λ.fst=ν and Λ.snd=ν. There exists a selfadjoint bounded T on L²(ν;ℝ) such that for every u, ‖Tu‖≤‖u‖, Tu(y)=∫u(x)S(y,dx) ν-almost everywhere, and ∫Tu dν=∫u dν. Set D=I−T²; this exact full-domain squared defect is positive. Define the actual quotient maps ιu=u+0i, Rg=Re g, Qg=Im g and Cg=conj(g). Then ι preserves norm, Cg=g iff g=ιu for some real u, and there exists a bounded complex-linear positive Dc on L²(ν;ℂ) such that Dc g=ιD(Rg)+iιD(Qg), Dc(ιu)=ι(Du), and C(Dc g)=Dc(Cg), universally on their displayed domains. The operator T, positivity, kernel/law certificates and Dc are produced conclusions. No real Γ/root/descent/inverse is asserted.
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_positive_defect_complex_lift
{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 ι : Lp ℝ 2 ν →L[ℝ] Lp ℂ 2 ν := Complex.ofRealCLM.compLpL 2 ν
let R : Lp ℂ 2 ν →L[ℝ] Lp ℝ 2 ν := Complex.reCLM.compLpL 2 ν
let Q : Lp ℂ 2 ν →L[ℝ] Lp ℝ 2 ν := Complex.imCLM.compLpL 2 ν
let C : Lp ℂ 2 ν →L[ℝ] Lp ℂ 2 ν := Complex.conjCLE.toContinuousLinearMap.compLpL 2 ν
IsProbabilityMeasure μ ∧ IsProbabilityMeasure J ∧ IsProbabilityMeasure ν ∧
∃ 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 = ν ∧
∃ 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 ∂ν) ∧
((1 : Lp ℝ 2 ν →L[ℝ] Lp ℝ 2 ν)-T*T).IsPositive ∧
(∀ u : Lp ℝ 2 ν, ‖ι u‖ = ‖u‖) ∧
(∀ g : Lp ℂ 2 ν, C g = g ↔ ∃ u : Lp ℝ 2 ν, ι u = g) ∧
∃ Dc : Lp ℂ 2 ν →L[ℂ] Lp ℂ 2 ν,
Dc.IsPositive ∧
(∀ g : Lp ℂ 2 ν, Dc g =
ι (((1 : Lp ℝ 2 ν →L[ℝ] Lp ℝ 2 ν)-T*T) (R g)) +
Complex.I • ι (((1 : Lp ℝ 2 ν →L[ℝ] Lp ℝ 2 ν)-T*T) (Q g))) ∧
(∀ u : Lp ℝ 2 ν, Dc (ι u) = ι (((1 : Lp ℝ 2 ν →L[ℝ] Lp ℝ 2 ν)-T*T) u)) ∧
(∀ g : Lp ℂ 2 ν, C (Dc g) = Dc (C g))Proof roadmap
- 1Produce the actual stationary operator
Invoke the independently verified centered-defect producer under exactly the displayed potential and step assumptions. It supplies the probability laws, a Markov kernel S with the every-state normalized reflection density, Λ.IsCondKernel S, both stationary marginals, and the same selfadjoint contraction T with its AE conditional-integral action and preserved mean. These are conclusions, not caller certificates.
- 2Use the produced positive defect
The same producer proves D=I−T² positive on the full real L²(ν), even though it vanishes on the constant class. Apply the canonical complexification theorem to this D and the actual ν. The resulting embedding, fixed range and complex operator have exactly the displayed formulas; no new positivity or CFC premise is introduced.
- 3Keep the next theorem boundary explicit
This constructs the genuine complex lift needed for a positive-root route. It does not construct the real Γ, prove that a complex root preserves Fix(C), descend that root, establish B.11, or supply centered inverse/polar/dynamics/error/cost conclusions. A separate test of the complex CFC API, if compiled, remains only a complex-root interface check.
Full assumptions and notation
All objects and hypotheses
- Let E be a finite-dimensional real Hilbert Borel space with canonical volume, including the explicit rank-zero extension. Let V:E→ℝ be C², let 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∼μ,Z∼N(0,I), ν=J.snd, and Λ as the law of (Y,2X−Y) under J.
- All kernel, probability, T and D certificates are conclusions. Finite E does not imply finite L2; rank-zero E and αη=1 are explicitly retained.
- Pointwise conjugation C is real linear; it is distinct from operator adjoint. Complex-root preservation and descent remain separate obligations.
Mathematical proof
1. Produce the actual stationary operator
Invoke the independently verified centered-defect producer under exactly the displayed potential and step assumptions. It supplies the probability laws, a Markov kernel S with the every-state normalized reflection density, Λ.IsCondKernel S, both stationary marginals, and the same selfadjoint contraction T with its AE conditional-integral action and preserved mean. These are conclusions, not caller certificates.
Corresponding Lean step
CenteredDefectOperator.actual_centered_selfadjoint_defect; hBase; hAll
2. Use the produced positive defect
The same producer proves D=I−T² positive on the full real L²(ν), even though it vanishes on the constant class. Apply the canonical complexification theorem to this D and the actual ν. The resulting embedding, fixed range and complex operator have exactly the displayed formulas; no new positivity or CFC premise is introduced.
Corresponding Lean step
L2RealComplexOperator.exists_positive_complex_lift; hD; hformula; hintertwine; hconj
3. Keep the next theorem boundary explicit
This constructs the genuine complex lift needed for a positive-root route. It does not construct the real Γ, prove that a complex root preserves Fix(C), descend that root, establish B.11, or supply centered inverse/polar/dynamics/error/cost conclusions. A separate test of the complex CFC API, if compiled, remains only a complex-root interface check.
Corresponding Lean step
actual_positive_defect_complex_lift
Lean verification
The exact proof begins folded immediately after the mathematical argument; the statement is folded beside the claim above.
Lean proof · actual_positive_defect_complex_lift
Produce the actual stationary operator; Use the produced positive defect; Keep the next theorem boundary explicit
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_positive_defect_complex_lift
{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 ι : Lp ℝ 2 ν →L[ℝ] Lp ℂ 2 ν := Complex.ofRealCLM.compLpL 2 ν
let R : Lp ℂ 2 ν →L[ℝ] Lp ℝ 2 ν := Complex.reCLM.compLpL 2 ν
let Q : Lp ℂ 2 ν →L[ℝ] Lp ℝ 2 ν := Complex.imCLM.compLpL 2 ν
let C : Lp ℂ 2 ν →L[ℝ] Lp ℂ 2 ν := Complex.conjCLE.toContinuousLinearMap.compLpL 2 ν
IsProbabilityMeasure μ ∧ IsProbabilityMeasure J ∧ IsProbabilityMeasure ν ∧
∃ 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 = ν ∧
∃ 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 ∂ν) ∧
((1 : Lp ℝ 2 ν →L[ℝ] Lp ℝ 2 ν)-T*T).IsPositive ∧
(∀ u : Lp ℝ 2 ν, ‖ι u‖ = ‖u‖) ∧
(∀ g : Lp ℂ 2 ν, C g = g ↔ ∃ u : Lp ℝ 2 ν, ι u = g) ∧
∃ Dc : Lp ℂ 2 ν →L[ℂ] Lp ℂ 2 ν,
Dc.IsPositive ∧
(∀ g : Lp ℂ 2 ν, Dc g =
ι (((1 : Lp ℝ 2 ν →L[ℝ] Lp ℝ 2 ν)-T*T) (R g)) +
Complex.I • ι (((1 : Lp ℝ 2 ν →L[ℝ] Lp ℝ 2 ν)-T*T) (Q g))) ∧
(∀ u : Lp ℝ 2 ν, Dc (ι u) = ι (((1 : Lp ℝ 2 ν →L[ℝ] Lp ℝ 2 ν)-T*T) u)) ∧
(∀ g : Lp ℂ 2 ν, C (Dc g) = Dc (C g)) := 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
have hBase := CenteredDefectOperator.actual_centered_selfadjoint_defect
hα hαβ hV hH hη hβη
rcases hBase with ⟨hμ,hJ,hν,S,hS,hSd,hSc,hSf,hSs,U,hU,hUi,hUs,M,hM,T,hTs,hAll,
q,hq,hTq,hqi,hzero,hD,hRest⟩
obtain ⟨hι,hfixed,Dc,hpos,hformula,hintertwine,hconj⟩ :=
AutoSamplingTheory.TechnicalLemmas.Measure.L2RealComplexOperator.exists_positive_complex_lift
ν ((1 : Lp ℝ 2 ν →L[ℝ] Lp ℝ 2 ν)-T*T) hD
refine ⟨hμ,hJ,hν,S,hS,hSd,hSc,hSf,hSs,T,hTs,?_,hD,hι,hfixed,Dc,hpos,
hformula,hintertwine,hconj⟩
intro u
exact (hAll u).2.2
end
end AutoSamplingTheory.ExampleCases.ProximalBPS.DefectComplexLift
#print axioms AutoSamplingTheory.ExampleCases.ProximalBPS.DefectComplexLift.actual_positive_defect_complex_liftScope and omitted-condition boundaries
- No root, real descent of complex CFC root, uniqueness, Gamma0/B15/B16, weakH1/dynamics/main/error/querycost/composition, paper or Goal closure.
Sources, dependencies, and reuse
Source and reuse
Samplinglib parents called
AutoSamplingTheory.ExampleCases.ProximalBPS.CenteredDefectOperator.actual_centered_selfadjoint_defectAutoSamplingTheory.TechnicalLemmas.Measure.L2RealComplexOperator.exists_positive_complex_lift
Mathlib API called (external library)
No direct Mathlib call recorded; see the Samplinglib parents.
Mathematical sources
- Appendix D.1 real Hilbert conventions and positive square-root background; B.10-B.11 actual all-macro square-root prerequisite, attributed ASTIS complexification completion, not a printed paper theorem. — No root, real descent of complex CFC root, uniqueness, Gamma0/B15/B16, weakH1/dynamics/main/error/querycost/composition, paper or Goal closure.
Samplinglib prose is not a quotation or a source-equivalence certificate. Definitions and aliases are explained as constructions, not counted as new mathematical proofs.