Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generated
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Marker overlap contraction of the two-path cross term

Statement

Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). Let (D,A,μ) be a σ-finite measure space, let L2(D,μ) denote the quotient of square-integrable measurable functions modulo almost-everywhere equality (The space Lp(μ) as the quotient by null functions), let K be a complex Hilbert space (Hilbert space) with unit vectors e1,e2, let a,b∈L2(D,μ) be unit vectors, and let α,β∈C with ∣α∣2+∣β∣2=1. Choose measurable representatives of a,b; all displayed pointwise expressions are understood almost everywhere, and the integrals below are independent of the representatives. Put

Ψ:=α a⊗e1+β b⊗e2∈L2(D)⊗^K.

Then:

(a) the reduced positive trace-class weight ρ:=Tr⁡KTΨ,Ψ on L2(D) is

ρ=∣α∣2Ta,a+∣β∣2Tb,b+αβ‾ ⟨e1,e2⟩ Ta,b+α‾β ⟨e2,e1⟩ Tb,a;

(b) for every measurable B⊆D with finite measure, writing PB for the multiplication operator by 1B,

tr⁡(ρPB)=∫B(∣α∣2∣a∣2+∣β∣2∣b∣2+2Re⁡(αβ‾⟨e1,e2⟩ a(x)b(x)‾))dμ;

(c) the marker overlap contracts the cross term: ∣⟨e1,e2⟩∣≤1, and if e1⊥e2 the cross term in (b) vanishes, leaving the incoherent weight ∣α∣2∣a∣2+∣β∣2∣b∣2.

The weight satisfies tr⁡ρ=∥Ψ∥2=1+2Re⁡(αβ‾⟨a,b⟩⟨e1,e2⟩); it is a density operator precisely when ∥Ψ∥=1. The stated assumptions do not force this normalization. These are identities for the specified vector and its unnormalized weight; they assert no measured detector law and cover no selective conditioning.

Facts & Assumptions

Given: D,K,e1,e2,a,b,α,β,Ψ as in the Statement; a measurable B⊆D with finite measure.

[F0]

Under the assumed Countable Choice, complex L2(D,μ) is complete for its L2 norm and has the first-variable-linear inner product ⟨f,g⟩=∫Dfg‾ dμ inducing that norm (Complex completeness, density, and inner product: the consumer interface). Thus it is a complex Hilbert space. The given unit vectors a,b make it nonzero; the unit e1 makes K nonzero, so both tensor and partial-trace suppliers apply.

[F1]

The completed tensor product L2(D)⊗^K carries the inner product ⟨f⊗u,f′⊗u′⟩=⟨f,f′⟩⟨u,u′⟩ and ∥f⊗u∥=∥f∥ ∥u∥ (Hilbert tensor construction: inner product, completion and product bases).

[F2]

Tr⁡K is linear with Tr⁡KTf⊗u,f′⊗u′=⟨u,u′⟩Tf,f′; Tf,f′g=⟨g,f′⟩f; and tr⁡(Tf,f′PB)=⟨f,PBf′⟩=∫Bff′‾ dμ for the self-adjoint multiplication operator PB (Separable partial trace and its basic properties, Nuclear bounded cyclicity for trace-class operators).

[F3]

∣⟨e1,e2⟩∣≤1 (Cauchy–Schwarz: ∣⟨u,v⟩∣≤∥u∥∥v∥, with equality exactly for linearly dependent vectors); the functions ab‾, ∣a∣2, ∣b∣2 are integrable on B of finite measure by Cauchy-Schwarz (Cauchy-Schwarz inequality for L2).

Proof

1.1givenF0F1F2algebra

[The reduced state] Expanding TΨ,Ψ into its four rank-one summands and applying the rank-one rule [F2] termwise gives Tr⁡KTΨ,Ψ=∣α∣2Ta,a+∣β∣2Tb,b+αβ‾⟨e1,e2⟩Ta,b+α‾β⟨e2,e1⟩Tb,a, which is (a). The trace-preserving partial trace [F2] gives tr⁡ρ=∥Ψ∥2; expanding the tensor norm by [F1] gives the displayed normalization formula. Positivity follows from positivity of TΨ,Ψ and the positive partial trace [F2], so trace one is exactly the density condition.

2.1step 1.1F2F3algebra

[The bin weight] By [F2], tr⁡(ρPB)=∣α∣2∫B∣a∣2+∣β∣2∫B∣b∣2+αβ‾⟨e1,e2⟩∫Bab‾+α‾β⟨e2,e1⟩∫Bba‾; since the last two integrals are conjugates of one another (because ⟨e2,e1⟩=⟨e1,e2⟩‾ and ∫Bba‾=∫Bab‾‾), their sum is 2Re⁡(αβ‾⟨e1,e2⟩∫Bab‾), giving (b).

3.1step 2.1F3algebra∎

[The overlap bound] By [F3], ∣⟨e1,e2⟩∣≤1. Thus the modulus of the complex cross-term coefficient αβ‾⟨e1,e2⟩ is at most ∣αβ∣, and the real cross-term contribution at x is bounded in magnitude by 2∣αβ∣ ∣a(x)b(x)∣. A complex phase may rotate that contribution, so no comparison of its real part with the real part for overlap one is asserted. When e1⊥e2, the overlap is zero and the cross term vanishes, leaving exactly the diagonal sum, as claimed in (c).

Depends on

Dependency tree · 2 levels

Sources