Positive real L² operator: actual complexification
AutoSamplingTheory.TechnicalLemmas.Measure.L2RealComplexOperator.exists_positive_complex_lift · theorem · Teaching coverage
Mathematical statement
Let Ω be an arbitrary measurable space, μ any measure, and D a bounded positive real-linear endomorphism of L²(μ;ℝ). Positivity includes selfadjointness. Define the actual quotient maps ιu=u+0i, Rg=Re g, Qg=Im g and Cg=conj(g) via Mathlib compLpL. The embedding preserves norm: ‖ιu‖=‖u‖ for every u, and its full range is exactly the fixed space of C: Cg=g iff there exists u with ιu=g. There exists a bounded complex-linear positive operator Dc on L²(μ;ℂ), with for every g, Dc g=ιD(Rg)+iιD(Qg), for every real u, Dc(ιu)=ι(Du), and for every complex g, C(Dc g)=Dc(Cg). No root or inverse is asserted.
Lean statement · exists_positive_complex_lift
Let Ω be an arbitrary measurable space, μ any measure, and D a bounded positive real-linear endomorphism of L²(μ;ℝ). Positivity includes selfadjointness. Define the actual quotient maps ιu=u+0i, Rg=Re g, Qg=Im g and Cg=conj(g) via Mathlib compLpL. The embedding preserves norm: ‖ιu‖=‖u‖ for every u, and its full range is exactly the fixed space of C: Cg=g iff there exists u with ιu=g. There exists a bounded complex-linear positive operator Dc on L²(μ;ℂ), with for every g, Dc g=ιD(Rg)+iιD(Qg), for every real u, Dc(ιu)=ι(Du), and for every complex g, C(Dc g)=Dc(Cg). No root or 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 exists_positive_complex_lift
{Ω : Type*} [MeasurableSpace Ω] (μ : Measure Ω)
(D : Lp ℝ 2 μ →L[ℝ] Lp ℝ 2 μ) (hD : D.IsPositive) :
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 μ
(∀ 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 = ι (D (R g)) + Complex.I • ι (D (Q g))) ∧
(∀ u : Lp ℝ 2 μ, Dc (ι u) = ι (D u)) ∧
(∀ g : Lp ℂ 2 μ, C (Dc g) = Dc (C g))Proof roadmap
- 1Construct the actual quotient maps
The scalar maps ofReal, Re, Im and conjugation are bounded real-linear maps. compLpL carries them to the same AE quotient spaces. Its AE representative formula proves Rι=I, Qι=0 and ιRg+iιQg=g. No representative is chosen as an additional input.
- 2Identify the real subspace and its norm
Integrating the pointwise inner products gives ⟨ιu,ιv⟩ℂ=⟨u,v⟩ℝ. Thus ι preserves norm. The equality Cg=g implies Im g=0 almost everywhere, so g=ιRg; the converse follows from conjugating a real value. This proves the exact fixed range for arbitrary μ.
- 3Build a bounded complex-linear operator
First form the bounded real-linear map Dc g=ιD(Rg)+iιD(Qg). The identities R(ig)=−Qg and Q(ig)=Rg show Dc(ig)=iDc g. Writing c=Re c+i Im c upgrades real linearity to complex linearity, while preserving the already proved continuity.
- 4Cancel the imaginary cross terms
Expand the complex inner product at g=ιa+iιb, where a=Rg,b=Qg. Real selfadjointness gives ⟨Db,a⟩ℝ=⟨Da,b⟩ℝ, cancelling the imaginary cross terms. The remaining two real quadratic forms are nonnegative by the original positivity of D.
- 5Prove both compatibility identities
On real inputs, Rι=I and Qι=0 give Dcι=ιD. Conjugation preserves the real part and negates the imaginary part; substituting into the literal formula gives CDc=DcC. Operator adjoint and pointwise conjugation are distinct operations.
Full assumptions and notation
All objects and hypotheses
- Let Ω be an arbitrary measurable space, μ any measure, and D a bounded positive real-linear endomorphism of L²(μ;ℝ). Positivity includes selfadjointness. Define the actual quotient maps ιu=u+0i, Rg=Re g, Qg=Im g and Cg=conj(g) via Mathlib compLpL.
- No finite/probability measure, finite-dimensional L2, nontriviality, chosen embedding or CFC input.
- Pointwise conjugation C is real linear; it is distinct from operator adjoint. Complex-root preservation and descent remain separate obligations.
Mathematical proof
1. Construct the actual quotient maps
The scalar maps ofReal, Re, Im and conjugation are bounded real-linear maps. compLpL carries them to the same AE quotient spaces. Its AE representative formula proves Rι=I, Qι=0 and ιRg+iιQg=g. No representative is chosen as an additional input.
Corresponding Lean step
real_embed; imag_embed; parts
2. Identify the real subspace and its norm
Integrating the pointwise inner products gives ⟨ιu,ιv⟩ℂ=⟨u,v⟩ℝ. Thus ι preserves norm. The equality Cg=g implies Im g=0 almost everywhere, so g=ιRg; the converse follows from conjugating a real value. This proves the exact fixed range for arbitrary μ.
Corresponding Lean step
inner_embed; norm_embed; conjugate_embed; fixed_range
3. Build a bounded complex-linear operator
First form the bounded real-linear map Dc g=ιD(Rg)+iιD(Qg). The identities R(ig)=−Qg and Q(ig)=Rg show Dc(ig)=iDc g. Writing c=Re c+i Im c upgrades real linearity to complex linearity, while preserving the already proved continuity.
Corresponding Lean step
real_I; imag_I; liftReal; liftReal_I; liftComplex
4. Cancel the imaginary cross terms
Expand the complex inner product at g=ιa+iιb, where a=Rg,b=Qg. Real selfadjointness gives ⟨Db,a⟩ℝ=⟨Da,b⟩ℝ, cancelling the imaginary cross terms. The remaining two real quadratic forms are nonnegative by the original positivity of D.
Corresponding Lean step
inner_lift; liftComplex_positive; ContinuousLinearMap.isPositive_iff_complex
5. Prove both compatibility identities
On real inputs, Rι=I and Qι=0 give Dcι=ιD. Conjugation preserves the real part and negates the imaginary part; substituting into the literal formula gives CDc=DcC. Operator adjoint and pointwise conjugation are distinct operations.
Corresponding Lean step
liftComplex_embed; real_conjugate; imag_conjugate; liftComplex_conjugate
Lean verification
The exact proof begins folded immediately after the mathematical argument; the statement is folded beside the claim above.
Lean proof · exists_positive_complex_lift
Construct the actual quotient maps; Identify the real subspace and its norm; Build a bounded complex-linear operator; Cancel the imaginary cross terms; Prove both compatibility identities
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 exists_positive_complex_lift
{Ω : Type*} [MeasurableSpace Ω] (μ : Measure Ω)
(D : Lp ℝ 2 μ →L[ℝ] Lp ℝ 2 μ) (hD : D.IsPositive) :
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 μ
(∀ 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 = ι (D (R g)) + Complex.I • ι (D (Q g))) ∧
(∀ u : Lp ℝ 2 μ, Dc (ι u) = ι (D u)) ∧
(∀ g : Lp ℂ 2 μ, C (Dc g) = Dc (C g)) := by
dsimp only
refine ⟨norm_embed μ, fixed_range μ, liftComplex μ D, liftComplex_positive μ D hD,
liftComplex_apply μ D, liftComplex_embed μ D, liftComplex_conjugate μ D⟩
end
end AutoSamplingTheory.TechnicalLemmas.Measure.L2RealComplexOperator
#print axioms AutoSamplingTheory.TechnicalLemmas.Measure.L2RealComplexOperator.exists_positive_complex_liftSource assumptions versus formal assumptions
| Source | Actual Lean | Difference kind | Why it matters |
|---|---|---|---|
| Real complete L2 and positive operator background for the paper square-root route. | Arbitrary measure on a measurable base; exact bounded positive real D; actual compLpL embedding/coordinates/conjugation and complex positive lift. | generalization | ASTIS-authored background completion, correctly attributed. Generic positivity is a mathematical input; actual PBPS positivity is proved internally under original potential/step binders. |
| Canonical AE quotient observables; actual stationary conditional operator. | All maps are literal scalar compLpL maps on the same quotient; norm and full fixed range are derived for arbitrary μ. | same | No defaults, chosen representatives, abstract embeddings, operator/root certificates or hidden finite-dimensional L2 assumption. |
| Source Euclidean finite dimension convention. | Generic Ω,μ arbitrary. | generalization | Generic background does not import paper geometry as a premise; actual consumer explicitly records rank-zero extension, with original global Hessian and step restrictions unchanged. |
| Real positive Γ and B.11, centered inverse/polar and full algorithms/complexities. | No root, real descent of complex CFC root, uniqueness, Gamma0/B15/B16, weakH1/dynamics/main/error/querycost/composition, paper or Goal closure. | unresolved | The positive complex lift and an auxiliary complex CFC test do not construct a real square root or close any paper main theorem. No conceptual mirror or certified functor is admitted. |
No root, real descent of complex CFC root, uniqueness, Gamma0/B15/B16, weakH1/dynamics/main/error/querycost/composition, paper or Goal closure.
Encoder–denoiser: accepted · equivalent-after-elaboration
Detected semantic differences
- domains: Arbitrary measurable base/measure background — Independent native attributed-background-generalization nonblocking classification retained in runs/20261007-companion-priority/pbps-real-complex-lift60/source-review60/source.0.review.json
- scopes: Complex lift only; printed real Gamma/B11 and centered inverse/polar/full paper remain open. Test-only complex CFC is a separate API consumer. No source theorem weakening is used to pretend to close them. — Independent native unresolved-source-boundary nonblocking classification retained in runs/20261007-companion-priority/pbps-real-complex-lift60/source-review60/source.0.review.json
A generalization is not a source correction. Proposed missing conditions require separate independent repair review. No proposed repair silently changes the original theorem.
Scope 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
Mathlib API called (external library)
- ContinuousLinearMap.compLpL
- ContinuousLinearMap.coeFn_compLpL
- Lp.ext
- L2.inner_def
- integral_complex_ofReal
- ContinuousLinearMap.isPositive_iff_complex
- algebraMap_smul
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.