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.

Fixed-particle-number occupation bases and the countable-mode partition criterion

Statement

Slot convention. For ℓ≥1, Sℓ acts on {0,…,ℓ−1} as in Permutation sector projections on the n-fold tensor power. On one-based tuple positions use π^(k):=1+π(k−1) for 1≤k≤ℓ. Conjugation by k↦k−1 gives πσ^=π^∘σ^ and π−1^=π^−1; thus the supplier's tensor action becomes Uπ(v1⊗⋯⊗vℓ)=vπ^−1(1)⊗⋯⊗vπ^−1(ℓ). The parameters of Uπ and sgn⁡(π) remain canonical zero-based permutations.

Assume Countable Choice (The Axiom of Countable Choice (ACω)). Let H be a complex Hilbert space with a supplied countably infinite orthonormal basis (ej)j≥1, let N≥1 be an integer, and let εj∈R with εj≥b for a fixed b∈R. Use the completed tensor power and permutation-sector projections of Hilbert tensor construction: inner product, completion and product bases and Permutation sector projections on the n-fold tensor power, and write HNσ:=ran⁡Pσ(N) for σ∈{+,−}. Then:

(a) For every finitely supported sequence n=(nj)j≥1 of nonnegative integers with ∑jnj=N, put orb⁡(n):={(i1,…,iN):#{k:ik=j}=nj for every j} and bn+:=∣orb⁡(n)∣−1/2∑i∈orb⁡(n)ei1⊗⋯⊗eiN. For every N-element subset J={j1<⋯<jN} of the positive integers, put bJ−:=1N!∑π∈SNsgn⁡(π)ejπ^(1)⊗⋯⊗ejπ^(N). These are orthonormal bases of the symmetric and antisymmetric sectors respectively. Denote their countable index sets by CN+ and CN−, and write bcσ for the corresponding vector. Define En:=∑jnjεj and EJ:=∑j∈Jεj.

(b) The fixed-N free energy operator is the self-adjoint diagonal operator D(HNσ):={ψ=∑c∈CNσacbcσ:∑c∣Ec∣2∣ac∣2<∞},HNσψ:=∑cEcacbcσ. It is bounded below by Nb, and is the closure of its action on finite occupation sums. On elementary tensors of modes it agrees with the restriction of the labelled energy sum ∑k=1Nεik, with the same diagonal-domain closure. Its spectral PVM is ENσ(B)ψ=∑c1B(Ec)acbcσ.

(c) For β>0, let qj:=e−βεj>0, so qj≤e−βb. Define the extended positive trace of a bounded positive operator as its nonnegative diagonal sum in the supplied occupation basis; its independence of any other supplied orthonormal basis is proved below. With this trace (allowed to be +∞), ZN+(β):=Tr⁡e−βHN+=hN(q):=∑1≤i1≤⋯≤iNqi1⋯qiN, ZN−(β):=Tr⁡e−βHN−=eN(q):=∑1≤i1<⋯<iNqi1⋯qiN. All sums are nonnegative-series sums. For either sign, (∏k=1N−1qk)∑j=N∞qj≤ZNσ(β)≤(∑j=1∞qj)N. For N=1 the product is 1, the tail starts at 1, and both partition sums equal ∑jqj. Consequently, for every fixed N≥1 and either statistics, 0<ZNσ(β)<∞⟺∑je−βεj<∞. The bounded positive operator e−βHNσ is trace class exactly in this case, and its ordinary trace then equals the displayed occupation sum. This is a fixed-N criterion, not a trace over all particle numbers.

Facts & Assumptions

Given: Countable Choice, the supplied basis, N≥1, the lower bound b, real energies εj≥b, and β>0 in clause (c).

[F1]

Completed tensor products have dense algebraic tensor products and the elementary-tensor inner-product formula; the permutation projections are bounded orthogonal projections acting by finite permutation sums (Hilbert tensor construction: inner product, completion and product bases, Permutation sector projections on the n-fold tensor power).

[F2]

In each finite prefix Hm:=span⁡{e1,…,em} the Slater vectors indexed by N-element subsets form an orthonormal antisymmetric basis, and the orbit sums are a nonzero orthogonal symmetric basis (Slater and symmetric occupation-number bases of the finite-dimensional permutation sectors (a)-(c)).

[F3]

Cauchy-Schwarz controls square-summable coefficient pairings (Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs). A complete orthonormal family gives Parseval and norm-convergent coordinate expansion (Parseval equivalences for an orthonormal family). The adjoint of a densely defined operator is characterized by ⟨Tx,y⟩=⟨x,T∗y⟩, and equality with the adjoint means self-adjointness (Adjoint of a densely defined operator, Symmetric, self-adjoint and essentially self-adjoint operators).

[F4]

A PVM is strongly countably additive; integration of bounded Borel functions gives the corresponding bounded operator and its scalar spectral integrals (Projection valued measure, Bounded borel pvm integral). The unbounded identity integral has the scalar squared-moment domain and is obtained by bounded coordinate truncations (Integral of a measurable function against a projection-valued measure, The unbounded PVM integral is densely defined, closed and normal).

[F5]

Finite-rank operators are compact and their operator-norm limits are compact (Bounded finite rank operators are compact, Norm limit of compact operators is compact). An absolutely summable nuclear series defines a trace-class operator, with trace equal to the sum of its rank-one traces; a trace-class operator has an absolutely summable diagonal in every supplied orthonormal basis (Nuclear series characterizes trace norm, Trace is absolutely convergent and basis independent).

Proof

technique · direct; exhaust the supplied basis by finite prefixes, compute the unbounded diagonal adjoint on coordinates, and compare nonnegative fixed-N occupation sums

Given: The data of the statement and [F1]-[F5].

1.1F1F2F3algebraconstruct

[Product basis and finite-prefix exhaustion] The tensors ei1⊗⋯⊗eiN are orthonormal by [F1]. Their span is dense: approximate each factor of an elementary tensor by its finite basis truncation using [F3]; the tensor norm formula and the telescoping difference of two products show convergence of these approximations, and finite sums of elementary tensors are dense by [F1]. Every finite collection of words is contained in some Hm⊗N. Since each Pσ(N) is bounded, its images of this dense word span are dense in its range. In the finite prefix, these images span precisely the finite Slater or orbit-sum basis of [F2]. A word in orb⁡(n) uses only finitely many modes, and the orbit consists of distinct orthonormal product vectors, so its sum has norm squared ∣orb⁡(n)∣>0. Thus its displayed normalization agrees in every larger prefix. The finite-prefix Slater vectors likewise agree in every larger prefix. Any pair of proposed occupation vectors lies in a common prefix, where [F2] gives orthogonality; the normalized vectors have norm one. Their span is dense in the sector by the projection argument, proving (a). The index sets are countable because they are countable unions of finite prefix index sets.

2.1F3step 1.1algebra

[Diagonal domain and self-adjointness] Write either sector in the orthonormal coordinates of step 1.1. The specified domain contains every finite coordinate vector, hence is dense. For a vector in that domain, Parseval makes the defining energy series converge. If y belongs to the adjoint domain, with adjoint value z, testing against each bcσ gives zc=Ecyc because Ec is real. Since z is square summable, ∑c∣Ecyc∣2<∞, so y belongs to the specified domain. Conversely, if that sum is finite, Cauchy-Schwarz applied to the square-summable coefficient families gives ⟨HNσx,y⟩=⟨x,HNσy⟩ for every domain vector x, so y belongs to the adjoint domain with the stated value. The domains and values agree, proving self-adjointness by [F3]. Since every Ec≥Nb, the absolutely convergent energy quadratic sum is at least Nb∥x∥2. Finite coordinate truncations converge in both norm and graph norm since both square-sum tails vanish, so finite occupation sums are a core and the operator is their diagonal closure.

3.1F1F3F4step 1.1step 2.1algebra

[Labelled energy and spectral measure] The same coordinate-domain construction on the product-word basis defines a self-adjoint labelled operator with energies ∑kεik, agreeing with the free slot-energy sum on finite mode words. Every permutation of a word has the same energy, so its domain and action commute with each permutation unitary and the projections [F1]. Their sector restrictions have exactly the occupation energies and domain of step 2.1. For the displayed ENσ(B), the projection and intersection identities follow coordinatewise; for disjoint Bl, the tails of the square-summable coordinates give strong countable additivity and total mass I, so it is a PVM. The scalar measure of a vector ψ=∑cacbcσ is ∑c∣ac∣2δEc, so [F4] gives the identity-integral domain exactly ∑cEc2∣ac∣2<∞; bounded spectral truncations converge to the displayed coordinate action there. This PVM is also uniquely determined by that operator: if another PVM represents it, the zero norm of (HNσ−Ec)bcσ forces its scalar measure at bcσ to be supported at Ec. Its projections therefore act as 1B(Ec) on every bcσ, and density gives equality on the whole sector. For the exponential, use the bounded Borel function g(a)=e−βmax⁡{a,Nb} on R; it agrees with e−βa on the support of this PVM. [F4] therefore gives the bounded positive operator with eigenvalues e−βEc≤e−βNb, namely e−βHNσ. This proves (b) and identifies the exponential used in (c).

4.1F3F5step 1.1step 3.1algebra

[Extended trace and occupation sums] Put rc:=e−βEc, a bounded positive family. In the supplied occupation basis the extended positive trace is ∑crc. This value is basis independent even when infinite: if (vl) is any other orthonormal basis, then ∑l⟨e−βHNσvl,vl⟩=∑l∑crc∣⟨vl,bcσ⟩∣2=∑crc, since nonnegative-series sums can be interchanged as suprema over finite subsums, and Parseval gives ∑l∣⟨vl,bcσ⟩∣2=1. A Bose occupation sequence has a unique sorted word i1≤⋯≤iN, and a Fermi subset has a unique increasing word; e−βEc is the product of the corresponding qj. Thus the trace equals hN(q) or eN(q) as stated. If the sum is finite, the series of rank-one operators ∑crc⟨⋅,bcσ⟩bcσ is nuclear and converges in operator norm to the exponential: its norm tail is at most the summable scalar tail. Its finite-rank partial sums and [F5] first give compactness, and the nuclear criterion then gives trace class and the ordinary trace formula. Conversely trace class forces the diagonal sum to be finite by [F5].

5.1step 4.1givenalgebra∎

[Upper and lower bounds and finiteness] Let Q:=∑jqj∈(0,∞]. The sum over all ordered words of length N is QN: on the first m modes it is (∑j≤mqj)N, and every finite collection of words is contained in one such prefix. The nondecreasing and strictly increasing index sets are subsets of the ordered-word set, giving ZNσ≤QN. For N≥2, configurations selecting modes 1,…,N−1 once each and one additional mode j≥N are valid for both statistics, distinct as j varies, and have weight (∏k=1N−1qk)qj. Their sum gives the lower bound. For N=1, every configuration is the single mode j, so both traces equal Q; the empty product is 1 and the tail starts at 1. For any N, the lower-bound coefficient is strictly positive and finite, and the omitted initial segment of Q is finite. Hence Q=∞ forces ZNσ=∞, whereas Q<∞ gives ZNσ<∞ by the upper bound. The single configuration {1,…,N} has positive weight for either sign, so both traces are strictly positive. This proves all of (c). No sum over particle numbers or full-Fock product formula is used.

Depends on

Dependency tree · 2 levels

Sources