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.

Creation contraction bounds

Statement

Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). Let H be a complex Hilbert space with inner product linear in the first argument (Hilbert space, Real and complex inner-product spaces and their induced length), with completed tensor powers H⊗n, symmetric projections P+(n), Fock space F(H) and finite-particle space F0 as in Hilbert direct-sum construction and Fock sector projections.

(a) Contraction map. For every f∈H and n≥0 there is a unique bounded linear map Ψf(n):H⊗(n+1)→H⊗n with ⟨φ,Ψf(n)χ⟩=⟨f⊗φ,χ⟩(φ∈H⊗n, χ∈H⊗(n+1)) (Riesz representation for Hilbert spaces); it satisfies ∥Ψf(n)∥≤∥f∥, Ψf(n)(u1⊗⋯⊗un+1)=⟨u1,f⟩ u2⊗⋯⊗un+1 on elementary tensors, Ψf(n)(ran⁡P+(n+1))⊆ran⁡P+(n), and the map f↦Ψf(n) is conjugate-linear.

(b) Creation and annihilation on the core. Define, for f∈H and ψ∈F0, (S+(f)ψ)n:=n P+(n)(f⊗ψn−1) (n≥1),(S+(f)ψ)0:=0, (S−(f)ψ)n:=n+1 Ψf(n)(ψn+1) (n≥0). Then S+(f)ψ,S−(f)ψ∈F0; S+(f) is linear in f and S−(f) is conjugate-linear in f; and with ∥ψ∥12:=∑n(n+1)∥ψn∥2<∞ for ψ∈F0, ∥S+(f)ψ∥≤∥f∥ ∥ψ∥1,∥S−(f)ψ∥≤∥f∥ ∥ψ∥1.

(c) Adjoint relation. ⟨S+(f)φ,ψ⟩=⟨φ,S−(f)ψ⟩ for all f∈H and φ,ψ∈F0 (The operator norm as the least bound and as the unit-sphere or unit-ball supremum, A bounded linear operator between normed spaces).

(d) Canonical commutation relation. For all f,g∈H and ψ∈F0, S−(f)S+(g)ψ−S+(g)S−(f)ψ=⟨g,f⟩ ψ, and consequently ∥S+(g)ψ∥2=∥S−(g)ψ∥2+∥g∥2∥ψ∥2.

Neither S+(f) nor S−(f) is asserted to be bounded on F(H), and no physical interpretation (particle creation, radiation or measurement) is asserted.

Facts & Assumptions

Given: the complex Hilbert space H with inner product linear in the first argument, completed tensor powers H⊗n with symmetric projections P+(n) (n≥1), the Fock space F(H) and its dense finite-particle subspace F0, vectors f,g,u,u1,…,un+1∈H, indices n≥0, and φ,ψ∈F0.

[F1]

F(H) is a Hilbert space with ⟨ψ,φ⟩=∑n⟨ψn,φn⟩; ψ∈F0 has finitely many nonzero coordinates; F0 is dense (Hilbert direct-sum construction).

[F2]

Πn is the orthogonal projection onto the vectors supported in coordinate n; ∥Πn∥≤1, with equality when its sector is nonzero; the sectors are orthogonal (Fock sector projections).

[F3]

For n≥1: P+(n) is an orthogonal projection; every vector of ran⁡P+(n) is fixed by each permutation unitary Uπ (π∈Sn), and conversely; for fixed v the map u↦u⊗v is linear and bounded with ∥u⊗v∥=∥u∥ ∥v∥ (Permutation sector projections on the n-fold tensor power, Hilbert tensor construction: inner product, completion and product bases).

[F4]

Cauchy-Schwarz in each Hilbert tensor power follows from Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs. For square-summable scalar sequences, apply that theorem to finite nonnegative real vectors (∣a0∣,…,∣aN∣) and (∣b0∣,…,∣bN∣) in RN+1 with inner product ⟨a,b⟩:=∑n=0Nanbn, then take the limit of the nonnegative partial sums; this gives ∑n∣anbn∣≤(∑n∣an∣2)1/2(∑n∣bn∣2)1/2.

[F5]

Riesz representation: every bounded linear functional on a Hilbert space is evaluation against a unique vector (Riesz representation for Hilbert spaces, A bounded linear operator between normed spaces).

Proof

1.1F3F4F5algebra

[The contraction map] Fix f∈H, n≥0 and χ∈H⊗(n+1). The map φ↦⟨f⊗φ,χ⟩ is linear, and by [F4] and [F3] ∣⟨f⊗φ,χ⟩∣≤∥f⊗φ∥ ∥χ∥=∥f∥ ∥φ∥ ∥χ∥, so it is bounded with norm at most ∥f∥ ∥χ∥; by [F5] there is a unique Ψf(n)χ∈H⊗n representing it. The assignment χ↦Ψf(n)χ is linear (the representing vectors of χ↦⟨f⊗φ,χ⟩ depend linearly on χ), and ∥Ψf(n)χ∥=sup⁡∥φ∥≤1∣⟨f⊗φ,χ⟩∣≤∥f∥ ∥χ∥ gives ∥Ψf(n)∥≤∥f∥. For an elementary tensor, the tensor-product inner product and the first-linear convention give [F3, F4, F5, algebra] ⟨f⊗φ,u1⊗⋯⊗un+1⟩=⟨f,u1⟩⟨φ,u2⊗⋯⊗un+1⟩=⟨φ,⟨u1,f⟩u2⊗⋯⊗un+1⟩. This equality for every φ and uniqueness of the representing vector imply Ψf(n)(u1⊗⋯⊗un+1)=⟨u1,f⟩u2⊗⋯⊗un+1. Finally Ψcf(n)=c‾ Ψf(n) for c∈C since ⟨u1,cf⟩=cˉ ⟨u1,f⟩ on elementary tensors, so f↦Ψf(n) is conjugate-linear.

2.1F3step 1.1algebra

[Symmetry preservation] Let χ∈ran⁡P+(n+1) and let σ∈Sn act on the last n tensor factors by U1⊗σ; by [F3] applied to the permutation (1,σ)∈Sn+1 one has U1⊗σχ=χ. Then for every φ∈H⊗n, ⟨φ,Ψf(n)χ⟩=⟨f⊗φ,χ⟩=⟨U1⊗σ−1(f⊗φ),χ⟩=⟨f⊗Uσ−1φ,χ⟩=⟨Uσ−1φ,Ψf(n)χ⟩=⟨φ,UσΨf(n)χ⟩, the third equality because U1⊗σ−1=U1⊗σ−1 permutes only the last factors and fixes f. Hence UσΨf(n)χ=Ψf(n)χ for every σ∈Sn, so Ψf(n)χ∈ran⁡P+(n) by the converse direction of [F3].

2.2F3step 1.1algebra

[Contraction bounds] For ψ∈F0, using ∥P+(n)∥≤1 ([F3]) and the tensor norm identity of [F3], ∥S+(f)ψ∥2=∑n≥1n∥P+(n)(f⊗ψn−1)∥2≤∑n≥1n∥f⊗ψn−1∥2=∥f∥2∑n≥0(n+1)∥ψn∥2=∥f∥2∥ψ∥12. Similarly ∥S−(f)ψ∥2=∑n≥0(n+1)∥Ψf(n)ψn+1∥2≤∥f∥2∑n≥0(n+1)∥ψn+1∥2≤∥f∥2∥ψ∥12, where step 1.1 supplied ∥Ψf(n)∥≤∥f∥.

3.1F1F2step 1.1step 2.1algebra

[The operators on the core] For ψ∈F0 only finitely many coordinates are nonzero, each in the appropriate range ([F1]); by [F2] and step 2.1 all displayed expressions (S±(f)ψ)n lie in ran⁡P+(n) and are nonzero only for finitely many n, so S±(f)ψ∈F0. Linearity of S+(f) in ψ and of S+(⋅)ψ in f, and conjugate-linearity of S−(f) in f from step 1.1, are immediate from the formulas.

3.2F3step 1.1step 2.1algebra

[Per-sector commutator computation] For n≥0 define Ag(n)χ:=P+(n+1)(g⊗χ) from ran⁡P+(n) to ran⁡P+(n+1), and for n≥1 define Bf(n)χ:=Ψf(n−1)χ from ran⁡P+(n) to ran⁡P+(n−1). Let χ=P+(n)(v1⊗⋯⊗vn). Since P+(n+1)(g⊗χ)=P+(n+1)(g⊗v1⊗⋯⊗vn), averaging over the (n+1)! permutations and grouping by the first tensor factor gives [F3, step 1.1, step 2.1, algebra] Bf(n+1)Ag(n)χ=1n+1(⟨g,f⟩χ+∑j=1n⟨vj,f⟩P+(n)(g⊗v1⊗⋯⊗vj^⊗⋯⊗vn)). The same grouping over the n! permutations of χ gives Bf(n)χ=1n∑j=1n⟨vj,f⟩P+(n−1)(v1⊗⋯⊗vj^⊗⋯⊗vn), so applying Ag(n−1) and multiplying by n yields exactly the sum over j in the preceding display. Therefore (n+1)Bf(n+1)Ag(n)χ−nAg(n−1)Bf(n)χ=⟨g,f⟩χ. The maps in this identity are bounded by step 1.1 and contractivity of P+(m) ([F3]); the displayed χ have dense span in ran⁡P+(n) ([F3]), so the identity extends to every vector in that sector. For the vacuum scalar c∈C, Ψf(0)P+(1)(g⊗c)=⟨g,f⟩c and the annihilation-then-creation term vanishes, so the commutator identity also holds at n=0.

4.1F1step 1.1step 3.1algebra

[Adjoint relation] Let φ,ψ∈F0. Using the definition of S+ and the self-adjointness of P+(n+1), and the fact that ψn+1∈ran⁡P+(n+1), ⟨S+(f)φ,ψ⟩=∑n≥0n+1⟨P+(n+1)(f⊗φn),ψn+1⟩=∑n≥0n+1⟨f⊗φn,ψn+1⟩. By the defining property of Ψf(n) in step 1.1 this equals ∑n≥0n+1⟨φn,Ψf(n)ψn+1⟩=⟨φ,S−(f)ψ⟩, both sums being finite.

4.2step 3.1step 3.2algebra

[Canonical commutation relation] Let f,g∈H and ψ∈F0. For n≥1, the definitions of S± and step 3.2 give (S−(f)S+(g)ψ)n=(n+1)Bf(n+1)Ag(n)ψn and (S+(g)S−(f)ψ)n=nAg(n−1)Bf(n)ψn. For n=0, the first composition is Ψf(0)P+(1)(g⊗ψ0)=⟨g,f⟩ψ0 and the second is zero. Thus each coordinate of the difference is ⟨g,f⟩ψn; all coordinates outside a finite set vanish, so the two sides agree.

5.1step 4.1step 4.2algebra∎

[The norm identity] Let g∈H and ψ∈F0. Taking the inner product of the commutation relation of step 4.2 (with f=g) with ψ gives ⟨S−(g)S+(g)ψ,ψ⟩−⟨S+(g)S−(g)ψ,ψ⟩=∥g∥2∥ψ∥2. By the adjoint relation of step 4.1, ⟨S−(g)S+(g)ψ,ψ⟩=⟨S+(g)ψ,S+(g)ψ⟩=∥S+(g)ψ∥2 and ⟨S+(g)S−(g)ψ,ψ⟩=⟨S−(g)ψ,S−(g)ψ⟩=∥S−(g)ψ∥2; hence ∥S+(g)ψ∥2=∥S−(g)ψ∥2+∥g∥2∥ψ∥2. This completes the proof of (a)-(d).

Depends on

Dependency tree · 2 levels

Sources