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, , and the finite-mode Fock conventions of Finite-mode quadratures and symplectic data. Let obey where is conjugate transpose and is transpose without conjugation. On the transported Schwartz domain , which contains the finite-particle core (the finite Hermite span under ), use and , and define Let , and have the interleaved conventions of the definition. Define the real permutation matrix by and, writing and , set Then the satisfy and on the finite Hermite core. The real matrix is symplectic in grouped coordinate order: . There is a unitary on finite-mode Fock, obtained by transporting an individual finite symplectic implementer through the Fock–Schrödinger unitary, such that and on the transported Schwartz core, and Equivalently, with the interleaved matrix , for every interleaved label . The transformed vacuum has finite mean number No infinite-mode implementability assertion is made.
Statement references
Facts & Assumptions
Given: AC, finite , matrices satisfying the two displayed matrix identities, the finite-mode Fock vacuum , and the quadrature and Weyl conventions of the definition.
The matrices obey and , with AC adopted for the finite-dimensional uniqueness interface (The Axiom of Choice).
On the finite Hermite span, and all annihilators mutually commute, as do all creators; and (Creation contraction bounds, Finite-mode Fock to Schrödinger identification).
With and , the matrix is the unique real coefficient matrix satisfying on that core, where , and the subscripts denote the first and last grouped components; this follows by separating real and imaginary parts.
Every interleaved finite symplectic matrix has an implementer and 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).
The Fock–Schrödinger map is unitary, sends to , and sends the finite-particle span to the finite Hermite span (Finite-mode Fock to Schrödinger identification).
Proof
Expand the commutator using [F1]. The only nonzero terms in are Likewise These are finite sums on the common core, so no unbounded product is used outside its domain.
Substitute and into . Its real quadrature part is and its imaginary part is . These two blocks form . Since step 1.1 gives the canonical commutators for these transformed quadratures, bilinearity yields Here follows from and . Since , the displayed identity implies . Taking determinants shows , so is invertible. Inverting this identity and using gives , as required.
Use the permutation defined in the Statement and set . Since and , step 2.1 gives , so is symplectic in interleaved order. Apply [F3] to and transport its unitary to Fock by [F4]. For every grouped label , the definition of gives Likewise, on the transported Schwartz core, 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 . Each generator in [F3] preserves Schwartz space, so lies in that core. Therefore, using and , one has The equality is finite and proves the claimed finite mean number. No step passes to infinitely many modes.