Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)
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-regulator Gibbs trace and bounded expectations

Statement

Assume Countable Choice and use the finite-mode data, form domain Q, and self-adjoint h from Self-adjoint unbounded polynomial interaction at fixed regulator. Let λ0≤λ1≤⋯ be its eigenvalues repeated with multiplicity, and let ψk be a corresponding orthonormal eigenbasis. For β>0 define the finite-rank truncations ρβ,Mf:=∑k=0Me−βλk⟨f,ψk⟩ψk. The proof establishes their operator-norm limit ρβ, with action ρβf:=∑k≥0e−βλk⟨f,ψk⟩ψk. Put αj:=ajc and let the oscillator eigenvalues ϵk be the nondecreasing ordering, with multiplicity, of ϵn=∑j=1N(2nj+1)αj,n∈N0N. Then ρβ is positive trace class and its trace Zβ:=Tr⁡(ρβ)=∑k≥0e−βλk satisfies the finite bound 0<Zβ≤eβC0∏j=1Ne−βαj1−e−2βαj<∞. For every bounded linear operator B:HN→HN, the normalized trace expectation is well defined and Zβ−1Tr⁡(ρβB)=Zβ−1∑k≥0e−βλk⟨Bψk,ψk⟩, with absolute convergence. This is a finite-N mathematical trace result; it assumes no statistical data and makes no continuum-limit claim.

Facts & Assumptions

Given: Countable Choice, finite data N,aj,c,C0,V, the form domain Q, and β>0.

[A1]

The Axiom of Countable Choice (ACω): countable eigenbasis choices are permitted.

[F1]

Self-adjoint unbounded polynomial interaction at fixed regulator: h is self-adjoint and has a complete orthonormal eigenbasis with real eigenvalues λk→+∞ and λk≥−C0; for u∈Q its form has the coefficient expansion qh(u)=∑kλk∣⟨u,ψk⟩∣2.

[F2]

Anisotropic Hermite oscillator and quadratic form basis: for the form with potential c∣q∣2, the product Hermite basis has energies ϵn and its form is the coefficient sum ∑nϵn∣⟨u,ψnosc⟩∣2.

[F3]

Finite-lattice polynomial Hamiltonian data and Coercive polynomial form completion and injection: HN is a complex Hilbert space, and the interacting form norm is the completion norm with weight W+1=V+C0+2, controlling the weak derivatives and weighted function.

[F4]

Nuclear series characterizes trace norm: under Countable Choice, a compact bounded operator that is the operator-norm limit of rank-one partial sums ∑k≤M⟨⋅,uk⟩vk with ∑k∥uk∥∥vk∥<∞ is trace class, with trace norm at most that coefficient sum.

[F5]

Trace of a positive operator is the sum of its eigenvalues: for a self-adjoint positive trace-class operator the trace is the sum of its eigenvalues with multiplicity.

[F6]

Riesz representation for Hilbert spaces: every bounded linear functional on a complex Hilbert space is represented by a unique inner-product vector, with representing-vector norm equal to the functional norm.

[F7]

Trace is absolutely convergent and basis independent: a trace-class operator has an absolutely convergent basis trace, equal to the trace computed from any nuclear representation.

[F8]

A bounded linear operator between normed spaces: a bounded linear B satisfies ∥Bx∥≤∥B∥∥x∥.

[F10]

Bounded finite rank operators are compact: every bounded linear operator with finite-dimensional range is compact.

[F11]

Norm limit of compact operators is compact: under Countable Choice, an operator-norm limit of compact operators into a Banach space is compact.

[F12]

Fourier expansion in a Hilbert space: for a complete orthonormal family in HN, Parseval gives ∑k∣⟨f,ψk⟩∣2=∥f∥22.

Proof

technique · direct

Given: N≥1, aj,c>0, V(q)≥c∣q∣2−C0, the interacting form, and β>0.

1.1F2algebra

Each ϵn is finite, and only finitely many multi-indices have ϵn≤M for any real M: for M≥0, that inequality bounds every nonnegative integer nj by M/(2αj), while for M<0 there are none. Fix the explicit degree-then-lexicographic enumeration of N0N. Recursively, among the remaining tuples choose one of least energy, breaking a tie by that fixed enumeration; such a least energy exists because below the energy of the first remaining tuple there are only finitely many candidates. Every tuple is eventually listed, since only finitely many tuples have energy at most its energy. This gives the nondecreasing list (ϵk)k≥0 with multiplicity.

1.2F2F3algebra

On Cc∞, the shifted interacting form has weight V+C0+2≥c∣q∣2+2, so it dominates the shifted oscillator form from [F2]. Therefore a Cauchy sequence in Q is Cauchy in the oscillator form norm; the identity map extends to a continuous map Q→Qosc, with the same L2 representative because both completions inject into HN by [F3]. Subtracting the shifts in the two form norms gives qh(u)=a(u,u)−(C0+2)∥u∥22≥qosc(u)−C0∥u∥22(u∈Q).

2.1A1F1F2step 1.2algebra

Fix k≥0 and let Lk=span⁡{ψ0,…,ψk}. The linear map from Lk to the span of the first k oscillator eigenvectors, sending u to its k oscillator coefficients, has a nonzero kernel because dim⁡Lk=k+1>k. Choose u≠0 in that kernel. Since u lies in the span of the first k+1 interacting eigenvectors, [F1] gives qh(u)≤λk∥u∥22. Its oscillator coefficients at indices below k vanish, so [F2] gives qosc(u)≥ϵk∥u∥22. Step 1.2 now yields λk∥u∥22≥qh(u)≥(ϵk−C0)∥u∥22, hence λk≥ϵk−C0. This argument also covers k=0, when the span of zero oscillator vectors is {0}.

3.1F2step 2.1algebra

By step 2.1 and β>0, ∑k≥0e−βλk≤eβC0∑n∈N0Ne−βϵn=eβC0∏j=1N(∑nj≥0e−β(2nj+1)αj)=eβC0∏j=1Ne−βαj1−e−2βαj. The factorization follows first for finite rectangular sums by distributivity and then by increasing limits of nonnegative sums. Each denominator is positive because 0<e−2βαj<1. The lower bound Zβ>0 follows from its positive ground term.

4.1A1F1F2F4F10F11F12step 3.1algebra

The coefficients satisfy 0<e−βλk≤eβC0 by [F1]. For each f, Parseval makes the finite partial sums in the defining series for ρβf Cauchy in HN, so the series converges; its coefficient formula gives linearity and ∥ρβf∥2≤eβC0∥f∥2. Moreover Parseval gives ∥ρβ−ρβ,M∥≤sup⁡k>Me−βλk⟶0, since λk→+∞ and β>0. Each truncation is finite rank and hence compact by [F10], so the operator-norm limit ρβ is compact by [F11]. The same convergence makes its rank-one partial sums converge in operator norm, and their coefficient sum is ∑ke−βλk=Zβ<∞; thus ρβ is trace class by [F4].

5.1A1F1F4F5F6F7F8F9F10F11F12step 3.1step 4.1algebra∎

Since each e−βλk is real, the Fourier expansion [F12] gives ⟨ρβf,g⟩=∑ke−βλk⟨f,ψk⟩⟨ψk,g⟩=⟨f,ρβg⟩ for all f,g∈HN; the series is absolutely convergent by Cauchy--Schwarz for the coefficient sequences and boundedness of the weights. Thus ρβ is self-adjoint. It is positive because ⟨ρβf,f⟩=∑ke−βλk∣⟨f,ψk⟩∣2≥0. The defining series gives ρβψk=e−βλkψk. If ρβx=μx, taking Fourier coefficients shows (e−βλk−μ)⟨x,ψk⟩=0 for every k. Completeness [F1, F12] then implies that every nonzero eigenspace is exactly the span of basis vectors with the corresponding repeated diagonal value; since every diagonal value is positive, 0 is not an eigenvalue. Thus the eigenvalues with multiplicity are precisely (e−βλk), and [F5] gives Tr⁡(ρβ)=Zβ. For bounded B, each ρβ,MB is finite rank and hence compact by [F10], while ∥ρβ,MB−ρβB∥≤∥ρβ,M−ρβ∥ ∥B∥→0 by step 4.1. Therefore ρβB is compact by [F11]. The functional x↦⟨Bx,ψk⟩ is linear and has norm at most ∥B∥ by [F9] and [F8]. By [F6] it is represented by a vector wk with ∥wk∥≤∥B∥ and ⟨Bx,ψk⟩=⟨x,wk⟩. Hence ρβBx=∑k⟨x,wk⟩e−βλkψk. The partial sums converge in operator norm: the norm of the tail after M is at most ∥B∥∑k>Me−βλk→0 by step 3.1. This nuclear representation has coefficient sum at most ∥B∥Zβ. Since ρβB is compact as shown above, [F4] gives that it is trace class. Its basis trace in (ψk) is absolutely convergent and equals the trace by [F7]. The kth diagonal entry is ⟨ρβBψk,ψk⟩=e−βλk⟨Bψk,ψk⟩, so this basis sum is the asserted numerator. Each term is bounded in modulus by e−βλk∥B∥ by [F8] and [F9], giving the stated absolute bound. Division by Zβ>0 proves the expectation formula.

Depends on

Dependency tree · 2 levels

Sources