Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedverified 2026-10-22 (gpt-6.1-sol)
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.

Finite Bogoliubov implementability

Statement

Assume AC, r≥1, and the finite-mode Fock conventions of Finite-mode quadratures and symplectic data. Let U,V∈Mr(C) obey UU∗−VV∗=Ir,UVT=VUT, where ∗ is conjugate transpose and T is transpose without conjugation. On the transported Schwartz domain DS:=U−1S(Rr), which contains the finite-particle core (the finite Hermite span under U), use aj=(Qj+iPj)/2ℏ and aj∗=(Qj−iPj)/2ℏ, and define aj′=∑k(Ujkak+Vjkak∗). Let R=(Q1,P1,…,Qr,Pr)T, J and W(z) have the interleaved conventions of the definition. Define the real permutation matrix Π by Π(x1,y1,…,xr,yr)T=(x1,…,xr,y1,…,yr)T, and, writing Q=(Q1,…,Qr)T and P=(P1,…,Pr)T, set Rg=ΠR=(QP),J0=ΠJΠT=(0Ir−Ir0),Wg(w)=W(ΠTw). Then the aj′ satisfy [aj′,(ak′)∗]=δjkI and [aj′,ak′]=0 on the finite Hermite core. The real matrix Sg=(Re⁡(U+V)−Im⁡(U−V)Im⁡(U+V)Re⁡(U−V)) is symplectic in grouped coordinate order: SgTJ0Sg=J0. There is a unitary M on finite-mode Fock, obtained by transporting an individual finite symplectic implementer through the Fock–Schrödinger unitary, such that M∗aM=a′ and M∗RgM=SgRg on the transported Schwartz core, and M∗Wg(w)M=Wg(SgTw)(w∈R2r). Equivalently, with the interleaved matrix Si=ΠTSgΠ, M∗W(z)M=W(SiTz) for every interleaved label z. The transformed vacuum MΩ has finite mean number ∑j∥ajMΩ∥2=tr⁡(VV∗). No infinite-mode implementability assertion is made.

Facts & Assumptions

Given: AC, finite r≥1, matrices U,V satisfying the two displayed matrix identities, the finite-mode Fock vacuum Ω, and the quadrature and Weyl conventions of the definition.

[A1]

The matrices obey UU∗−VV∗=Ir and UVT=VUT, with AC adopted for the finite-dimensional uniqueness interface (The Axiom of Choice).

[F1]

On the finite Hermite span, [aj,ak∗]=δjkI and all annihilators mutually commute, as do all creators; ajΩ=0 and aj∗Ω=∣ej⟩ (Creation contraction bounds, Finite-mode Fock to Schrödinger identification).

[F2]

With Qj=ℏ/2(aj+aj∗) and Pj=−iℏ/2(aj−aj∗), the matrix Sg is the unique real coefficient matrix satisfying a′=(SgRg)Q+i(SgRg)P2ℏ on that core, where Q=(Q1,…,Qr)T, P=(P1,…,Pr)T and the subscripts denote the first and last r grouped components; this follows by separating real and imaginary parts.

[F3]

Every interleaved finite symplectic matrix Si has an implementer M∗W(z)M=W(SiTz) and M∗RM=SiR on the transported Schwartz core; conjugating by the fixed interleaved-to-grouped permutation gives the same covariance for grouped matrices (Finite symplectic implementation by quadratic generators).

[F4]

The Fock–Schrödinger map is unitary, sends Ω to g0⊗r, and sends the finite-particle span to the finite Hermite span (Finite-mode Fock to Schrödinger identification).

Proof

1.1A1F1givenalgebra

Expand the commutator using [F1]. The only nonzero terms in [aj′,(ak′)∗] are ∑lUjlUkl‾−∑lVjlVkl‾=(UU∗−VV∗)jk=δjk. Likewise [aj′,ak′]=∑l(UjlVkl−VjlUkl)=(UVT−VUT)jk=0. These are finite sums on the common core, so no unbounded product is used outside its domain.

2.1F1F2step 1.1algebra

Substitute a=(Q+iP)/2ℏ and a∗=(Q−iP)/2ℏ into Ua+Va∗. Its real quadrature part is Re⁡(U+V)Q−Im⁡(U−V)P and its imaginary part is Im⁡(U+V)Q+Re⁡(U−V)P. These two blocks form SgRg. Since step 1.1 gives the canonical commutators for these transformed quadratures, bilinearity yields [(SgRg)j,(SgRg)k]=iℏ(SgJ0SgT)jk=iℏ(J0)jk. Here [Rg,j,Rg,k]=iℏ(J0)jk follows from Rg=ΠR and J0=ΠJΠT. Since ℏ>0, the displayed identity implies SgJ0SgT=J0. Taking determinants shows (det⁡Sg)2=1, so Sg is invertible. Inverting this identity and using J0−1=−J0 gives SgTJ0Sg=J0, as required.

3.1F1F3F4step 2.1algebra∎

Use the permutation Π defined in the Statement and set Si=ΠTSgΠ. Since ΠTΠ=I and J0=ΠJΠT, step 2.1 gives SiTJSi=J, so Si is symplectic in interleaved order. Apply [F3] to Si and transport its unitary to Fock by [F4]. For every grouped label w, the definition of Wg gives M∗Wg(w)M=W(SiTΠTw)=W(ΠTSgTw)=Wg(SgTw). Likewise, on the transported Schwartz core, M∗RgM=ΠM∗RM=ΠSiR=SgRg. The Weyl covariance holds on all Fock space because each Weyl operator and the implementer are bounded. The complex recombination in step 2.1 gives M∗aM=a′. Each generator in [F3] preserves Schwartz space, so MΩ lies in that core. Therefore, using ajΩ=0 and aj′Ω=∑kVjkak∗Ω, one has ∑j∥ajMΩ∥2=∑j∥Maj′Ω∥2=∑j,k∣Vjk∣2=tr⁡(VV∗). The equality is finite and proves the claimed finite mean number. No step passes to infinitely many modes.

Depends on

Dependency tree · 2 levels

Sources