Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passverified 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.

Certified positive finite quadratic Bose Hamiltonian is normalizable

Statement

Assume the Axiom of Choice and Countable Choice. Let r≥1, ℏ>0 in joule-seconds, β>0 in inverse joules, c∈R in joules, and let G=GT be a strictly positive real 2r×2r matrix whose entries have units of inverse seconds. Assume (U,V,ω1,…,ωr) is a finite diagonalization certificate for G as defined earlier, with each ωj>0 in inverse seconds. Let HG,c(0) be the symmetric quadratic operator on the stated Schwartz domain. Then its graph closure H:=HG,c(0)‾ exists and is self-adjoint, and its finite-mode Gibbs partition sum is Zβ:=Tr⁡(e−βH)=e−βc∏j=1r[2sinh⁡ ⁣(βℏωj2)]−1∈(0,∞),sinh⁡x:=ex−e−x2. The matrix G acts on the finite grouped quadratures; the bosonic Fock space remains infinite-dimensional at each r≥1. This conditional finite-mode conclusion neither proves that every positive G has a diagonalization certificate nor asserts infinite-mode implementability, interacting depletion bounds, or superfluidity.

Facts & Assumptions

Given: The constants, finite mode count, positive matrix, positive frequencies, and explicit diagonalization certificate in the Statement. Assume both Choice principles there.

[A1]

The Axiom of Choice and The Axiom of Countable Choice (ACω): adopt both Choice principles, with Countable Choice used for the diagonal occupation basis and trace carrier.

[A2]

The diagonalization certificate fixes matrices U,V satisfying UU∗−VV∗=Ir and UVT=VUT, with grouped symplectic matrix Sg and SgTGSg=Dω as defined in Finite positive quadratic canonical operators and diagonalization data. Every ωj is strictly positive.

[F1]

Finite positive quadratic canonical operators and diagonalization data: HG,c(0) is the symmetrically ordered quadratic in grouped quadratures on U−1S(Rr), and the certificate uses Dω=diag⁡(ω1,…,ωr,ω1,…,ωr).

[F2]

Finite Bogoliubov implementability: under AC, r≥1, ℏ>0, and the two displayed identities for U,V, there is a unitary implementer M with M∗RgM=SgRg on the transported Schwartz core. Its authored finite-mode statement makes no infinite-mode claim.

[F3]

Finite symplectic implementation by quadratic generators: every real finite symplectic matrix has a normalized implementer whose restriction is a continuous bijection of Schwartz space, and any other Weyl implementer of the same matrix differs by a scalar phase. Only the stated finite-mode action is used here.

[F4]

Finite-mode Fock to Schrödinger identification: the product Hermite functions are a complete orthonormal basis and the finite-mode quadratures act on them as ℏ xj and −iℏ ∂xj. The proof uses this exact basis and core interface.

[F5]

Explicit diagonal Fock domains and occupation trace: under Countable Choice, for a finite bosonic mode set with energies ϵj and qj=e−βϵj satisfying 0<qj<1, q∗<1, and ∑jqj<∞, the diagonal multiplier ∑jϵjnj is self-adjoint on its maximum weighted ℓ2 domain and Tr⁡(e−β∑jϵjNj)=∏j(1−qj)−1.

[F6]

Trace of a positive operator is the sum of its eigenvalues: for a positive trace-class operator, the trace is the sum of its positive eigenvalues with multiplicity and equals its trace norm.

[F7]

Adjoint of a densely defined operator: g∈D(B∗) exactly when f↦⟨Bf,g⟩ is bounded on the dense domain D(B) in the ambient Hilbert norm; then B∗g is the representing vector.

[F8]

Densely defined, closed and closable operators, and cores: the graph norm of B is (∥f∥2+∥Bf∥2)1/2, a core for a closed operator is a subdomain dense in that norm, and graph closure is taken in the product Hilbert space.

[F9]

Unbounded Borel functional calculus: domains, products, spectral mapping: for self-adjoint B with spectral measure E, a Borel function u defines u(B)=u(E) by spectral functional calculus on the domain D(u(B))={f:∫R∣u(x)∣2 dEf(x)<∞}, where Ef(A):=⟨E(A)f,f⟩ for each Borel set A⊆R. In particular the Borel function u(x)=e−βx acts on an eigenvector of eigenvalue λ by e−βλ. This function is unbounded on R; its boundedness on the spectra used here is established in step 7.1.

[F10]

Trace class operator, Absolute value and singular values of a compact operator, and Positive square root of a compact positive operator: trace-class is summability of singular values. For α>0, ∣αB∣=α∣B∣; for unitary M, ∣MBM∗∣=M∣B∣M∗, by uniqueness of the positive square root. Thus positive scalar multiples and unitary conjugates of a trace-class operator remain trace class, with the scalar multiple scaling all singular values by α and the unitary conjugate preserving them.

Proof

1.1A1A2F2F3givenalgebra

By [F2], the certificate's matrices give a unitary M satisfying M∗RgM=SgRg on the common transported Schwartz core. By [F3], we may take this implementer to preserve Schwartz space: its normalized metaplectic implementer has that property, and multiplying by a scalar phase leaves M∗RgM unchanged.

2.1A2F1step 1.1algebra

Conjugating each symmetrically ordered term of HG,c(0) by M replaces Rg by SgRg . Collecting the finite sums gives M∗HG,c(0)M=14∑a,b(SgTGSg)ab(Rg,aRg,b+Rg,bRg,a)+cI. By [A2] this is the diagonal quadratic with coefficient Dω on the same core.

3.1F1F4step 2.1algebra

On the finite Hermite core put aj=(Qj+iPj)/2ℏ and aj∗=(Qj−iPj)/2ℏ . The relation [Qj,Pj]=iℏI gives Qj2+Pj2=2ℏ(aj∗aj+12I) by direct multiplication. Consequently the diagonal quadratic is ∑jℏωj(aj∗aj+12I)+cI . Write gn∈L2(Rr) for the product Hermite basis and set ϕn:=U−1gn∈Fs(Cr) . Then Uϕn=gn , and the diagonal quadratic has eigenvalue En=c+∑jℏωj(nj+12) . Denote this diagonal differential expression on S by T~ω(0) , and its Fock-space transport on D by Tω(0):=U−1T~ω(0)U .

4.1A1F5F7F8step 3.1algebra

Put ϵj=ℏωj and let A be the maximal diagonal multiplier in the basis (ϕn) with eigenvalues ∑jϵjnj . By [F5], A is self-adjoint on the domain where ∑n∣∑jϵjnj∣2∣fn∣2<∞ . The diagonal operator with eigenvalues En is A+c0I , where c0=c+12∑jϵj . Its domain is the same: for real x,c0 , ∣x+c0∣2≤2∣x∣2+2∣c0∣2 and ∣x∣2≤2∣x+c0∣2+2∣c0∣2 , and each coefficient sequence (fn) is in ℓ2 . For g∈D((A+c0I)∗) , [F7] says that boundedness of f↦⟨(A+c0I)f,g⟩ and boundedness of f↦c0⟨f,g⟩ imply boundedness of f↦⟨Af,g⟩ . Thus g∈D(A∗)=D(A) and (A+c0I)∗g=Ag+c0g . Conversely, every g∈D(A) satisfies this adjoint identity, so T=A+c0I is self-adjoint. Finite Hermite truncations converge in its graph norm, because the tail of ∑n(1+∣En∣2)∣fn∣2 tends to zero. Thus finite Hermite sums are a core for T in the graph norm of [F8].

5.1F1F4F8step 3.1step 4.1algebra

For ψ∈D , put f=Uψ∈S . The coordinate expression T~ω(0) sends f to an L2 function. Integration by parts against each Schwartz Hermite function gives ⟨Tω(0)ψ,ϕn⟩=En⟨ψ,ϕn⟩ ; equivalently, this is the L2 pairing of the differential expression on f with gn=Uϕn . Boundary terms vanish because both functions are Schwartz. For every finite set F of occupation indices, orthogonal projection therefore gives ∑n∈F∣En⟨ψ,ϕn⟩∣2≤∥Tω(0)ψ∥2 . These coefficients are square-summable, and completeness of (ϕn) from [F4] identifies their vector with Tω(0)ψ . Hence D⊆D(T) and the diagonal expression is T on D . The finite Hermite sums from step 4.1 lie in D because [F1] places each gn in S , and are graph-norm dense in D(T) ; so the graph closure of this restriction is T.

6.1F8step 1.1step 2.1step 5.1algebra

By step 1.1, M and M∗ preserve Schwartz space, and by step 2.1 HG,c(0)=MTω(0)M∗ there. Step 5.1 gives graph closure T for the diagonal restriction. Conjugation by the unitary M carries the graph and its closure in Fs⊕Fs to the graph and closure of HG,c(0) , so H=HG,c(0)‾=MTM∗ . This is self-adjoint because T is self-adjoint and M is unitary.

7.1A1F4F5F6F9F10step 4.1step 5.1step 6.1algebra∎

Set qj=e−βϵj=e−βℏωj . Since β>0 and every ωj>0 , 0<qj<1 ; the mode set is finite, so q∗<1 and ∑jqj<∞ . Apply [F5] to the diagonal number-energy operator A to get Tr⁡(e−βA)=∏j(1−qj)−1<∞ . On the occupation basis, T has eigenvalues En=c0+∑jϵjnj≥c0. Its spectral measure is supported on these eigenvalues because this basis is complete. Hence e−βx≤e−βc0 on that support, so its spectral exponential is bounded and everywhere defined, with positive eigenvalues e−βEn=e−βc0∏jqjnj by [F9]. Thus e−βT=e−βc0e−βA on the occupation basis; [F10] and the trace-class conclusion for e−βA from [F5] show that e−βT is positive trace class. Its eigenvalue sum is e−βc0∏j(1−qj)−1<∞ by [F5], so [F6] identifies that sum with its trace. By steps 6.1 and 5.1, the vectors Mϕn form a complete orthonormal eigenbasis for H with the same eigenvalues; equivalently e−βH=Me−βTM∗ . The unitary invariance in [F10] makes e−βH trace class with the same eigenvalue sum, and [F6] gives the same trace. Finally, e−βc0∏j(1−e−βℏωj)−1=e−βc∏je−βℏωj/21−e−βℏωj=e−βc∏j[2sinh⁡ ⁣(βℏωj2)]−1. Every factor is strictly positive and finite, proving Zβ∈(0,∞) . The only infinite-dimensional Hilbert space used here is the bosonic Fock space for the stated finite number r of modes.

Remarks

The proof uses the finite-mode quadrature conventions of Finite-mode quadratures and symplectic data, the occupation and Hermite core identification of Finite-mode Fock to Schrödinger identification, the individual Bogoliubov implementer of Finite Bogoliubov implementability, and the Schwartz-preserving normalized implementer of Finite symplectic implementation by quadratic generators at the exact interfaces in [F1]–[F4]. These are mathematical supplier uses; the theorem remains conditional on its explicit diagonalization certificate and hypotheses. Run-readiness records are separate operational evidence and are not mathematical premises or independent proof approval.

Depends on

Dependency tree · 2 levels

Sources