Alphabeta Math
TheoremStatement: 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.

Countable-mode product criterion

Statement

Assume the Axiom of Countable Choice and the Axiom of Choice (The Axiom of Countable Choice (ACω), The Axiom of Choice). Let H be a complex Hilbert space with a countable complete orthonormal family (ej)j≥1 (Orthonormal families, complete orthonormal systems and Hilbert bases), let (εj)j≥1⊆(0,∞), let β>0, and let F(H) be the Fock space of Hilbert direct-sum construction. Let M be the set of finite nondecreasing sequences I=(j1≤⋯≤jn) with n≥0 (the empty sequence included); for I=(j1≤⋯≤jn) put vI:=P+(n)(ej1⊗⋯⊗ejn)∈F(H)(n≥1),v∅:=Ω,λI:=εj1+⋯+εjn (empty sum 0), and uI:=vI/∥vI∥. Then:

(a) (uI)I∈M is a complete orthonormal family of F(H) (Hilbert space);

(b) the diagonal operator D(Dβ):={ψ∈F(H):∑I∈Me−2βλI∣⟨ψ,uI⟩∣2<∞},Dβψ:=∑Ie−βλI⟨ψ,uI⟩uI is bounded, self-adjoint and positive with ∥Dβ∥≤1; it is trace class exactly when ∑Ie−βλI<∞, and then tr⁡Dβ=∑Ie−βλI (Trace class operator, Trace of a trace class operator);

(c) for every N≥1, ∑I∈MI⊆{1,…,N}e−βλI=∏j=1N11−e−βεj, and ∑I∈Me−βλI=lim⁡N→∞∏j=1N11−e−βεj∈(0,∞];

(d) product criterion: ∑Ie−βλI<∞ if and only if ∑j≥1e−βεj<∞, and in that case ∑I∈Me−βλI=∏j=1∞11−e−βεj<∞;

(e) consequently Dβ is trace class if and only if ∑je−βεj<∞, with the trace given by the infinite product in (d).

The operator Dβ is a purely mathematical diagonal operator on F(H); no thermal, thermodynamic or measurement interpretation is asserted.

Facts & Assumptions

Given: a complex Hilbert space H with countable complete orthonormal family (ej)j≥1, positive numbers εj and β, the Fock space F(H) with tensor powers H⊗n and symmetric projections P+(n), the family (uI)I∈M and the numbers λI, and the diagonal operator Dβ.

[F1]

F(H) is a Hilbert space; ψn∈ran⁡P+(n); ∥ψ∥2=∑n∥ψn∥2; the sectors are orthogonal (Hilbert direct-sum construction, Fock sector projections).

[F2]

P+(n) is the orthogonal projection (1/n!)∑π∈SnUπ onto the vectors fixed by all permutation unitaries; for fixed m the tensor maps are isometric: ∥u1⊗⋯⊗um∥=∥u1∥⋯∥um∥; the elementary tensors ei1⊗⋯⊗ein over all n-tuples have dense linear span in H⊗n (Permutation sector projections on the n-fold tensor power, Hilbert tensor construction: inner product, completion and product bases).

[F3]

The diagonal lemma: for a complete orthonormal family (fn)n∈N, with N={0,1,2,…}, of a Hilbert space and real numbers μn, the operator with domain {ψ:∑nμn2∣⟨ψ,fn⟩∣2<∞} and ψ↦∑nμn⟨ψ,fn⟩fn is self-adjoint (Diagonal adjoint and graph-core lemma).

[F4]

Once step 2.1 establishes that (uI)I∈M is a complete orthonormal family, its Fourier coefficient map has squared coefficient sum ∑I∣⟨ψ,uI⟩∣2=∥ψ∥2 (A Hilbert space with a given orthonormal basis is ℓ2 of the index set). Bounded finite-rank operators are compact, norm limits of compact operators into a Hilbert space are compact, and a compact operator is trace class exactly when it has a nuclear representation with summable rank-one norms (Bounded finite rank operators are compact, Norm limit of compact operators is compact, Nuclear series characterizes trace norm).

[F5]

Geometric series and nonnegative double series: ∑k≥0qk=1/(1−q) for 0≤q<1; the order of summation of a nonnegative double series may be interchanged (For ∣r∣<1, ∑k≥0rk=1/(1−r), and for ∣r∣≥1 the series diverges, Tonelli's theorem for double series of nonnegative extended real numbers).

[F6]

For x≥1, log⁡x=∫1xdt/t and 0≤log⁡x≤x−1, log⁡x≥1−1/x (The natural logarithm has derivative 1/x and equals the integral from 1 to x of 1/t, If f≤g on [a,b] and both are integrable then ∫abf≤∫abg; and m(b−a)≤∫abf≤M(b−a), The natural logarithm as the inverse of the exponential function); consequently q≤−log⁡(1−q)≤q/(1−q) for 0<q<1 (substitute x=1/(1−q)≥1).

[F7]

The natural logarithm is continuous and strictly increasing on (0,∞), satisfies log⁡(xy)=log⁡x+log⁡y and log⁡(1/x)=−log⁡x, and is the inverse of the strictly increasing exponential (Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm, The natural logarithm as the inverse of the exponential function).

[F8]
[F9]

Once step 2.1 supplies the Hilbert basis (uI), the basis sum for any trace-class T is absolutely convergent and equals tr⁡T (Trace is absolutely convergent and basis independent).

Proof

1.1F1F2algebra

[Orthonormality] Let I=(j1≤⋯≤jn), I′=(j1′≤⋯≤jm′) and first suppose n=m≥1. Using P+(n)=P+(n)∗ and P+(n)χ=χ for χ∈ran⁡P+(n), [F2] gives ⟨vI,vI′⟩=1n!∑π∈Sn⟨ej1⊗⋯⊗ejn,Uπ(ej1′⊗⋯⊗ejn′)⟩. Each summand is 1 exactly when π maps the tuple (j1′,…,jn′) to (j1,…,jn) and 0 otherwise, by orthonormality of the ej; since both tuples are nondecreasing, such π exists only if I=I′, and then the number of such π is the product of the factorials of the multiplicities of I. Hence ⟨vI,vI′⟩=0 for I≠I′ and ∥vI∥2≥1/n!>0, so (uI) is an orthonormal family; tensors from different n are orthogonal by [F1].

1.2F5algebra

[Factoring the finite sums] Fix N≥1. The map I↦(n1,…,nN) assigning to a multiset I⊆{1,…,N} the number nj of occurrences of j is a bijection onto NN, and λI=∑jnjεj; by [F5] and the geometric series with q=e−βεj∈(0,1), ∑I⊆{1,…,N}e−βλI=∑(n1,…,nN)∈NN∏j=1Ne−βnjεj=∏j=1N∑n≥0e−βnεj=∏j=1N11−e−βεj, the interchange of the finite product with the sums following by induction from [F5] (Tonelli for nonnegative series).

2.1F1F2step 1.1algebra

[Completeness] The ordered elementary tensors ei1⊗⋯⊗ein have dense span in H⊗n ([F2]); applying the bounded projection P+(n) gives a dense subset of ran⁡P+(n), and the vectors P+(n)(ei1⊗⋯⊗ein) over ordered tuples coincide with those over nondecreasing tuples because P+(n)Uπ=P+(n) ([F2]). Hence the span of {uI:∣I∣=n} is dense in ran⁡P+(n); combining the sectors and using that every ψ∈F(H) is the limit of its truncations ([F1]) shows that the span of all uI is dense in F(H). With step 1.1 this proves (a).

2.2F5F6F7F8step 1.2algebra

[The infinite product and the criterion] The finite sums of step 1.2 increase with N because all terms are positive, and every finite multiset I lies in an initial segment, so ∑I∈Me−βλI=lim⁡N∑I⊆{1,…,N}e−βλI=lim⁡N∏j≤N(1−e−βεj)−1∈(0,∞]. Put qj=e−βεj∈(0,1). For every j, [F6] gives qj≤−log⁡(1−qj)≤qj/(1−qj). If infinitely many qj>1/2, both ∑jqj and ∑j−log⁡(1−qj) diverge, the latter already bounded below by the former termwise. Otherwise only finitely many such terms occur, all finite, and on the remaining tail qj≤−log⁡(1−qj)≤2qj; therefore the logarithmic sum is finite exactly when ∑jqj is finite. By the product and reciprocal laws in [F7], log⁡∏j≤N(1−qj)−1=∑j≤N−log⁡(1−qj). If these logarithmic partial sums are bounded, the increasing reciprocal products are bounded as well, since log⁡ is increasing and exp⁡ is its increasing inverse; hence [F8] gives a finite limit. Conversely, if the reciprocal products have a finite limit, they are bounded and [F7] makes their logarithmic partial sums bounded. In the finite case, if PN denotes the reciprocal partial product and PN→P, continuity of log⁡ gives log⁡P=∑j−log⁡(1−qj), so P=exp⁡(∑j−log⁡(1−qj)). This proves (c) and (d) in both large-factor branches without assuming summability in advance.

3.1F3F4F9step 1.1step 2.1algebra

[The diagonal operator and the M-indexed trace criterion] The set M is countably infinite: group its finite nondecreasing sequences by the integer n+∑r=1njr, list each finite group lexicographically (its sequences have length and entries bounded by the group integer), skip empty groups, and concatenate the groups (the singleton sequences ensure infinitely many entries). Fix the resulting enumeration I1,I2,… and put μm:=e−βλIm. Put μI:=e−βλI for every I. By step 2.1, (fn)n≥0:=(uIn+1)n≥0 is a complete orthonormal family, and [F3] applies with coefficients μIn+1. Reindexing its sums by this bijection shows that the diagonal operator Dβ is self-adjoint; Parseval from [F4] gives ∥Dβψ∥2=∑IμI2∣⟨ψ,uI⟩∣2≤∥ψ∥2, so its domain is all of F(H) and it is bounded with norm at most one. Its coefficients are positive, so ⟨Dβψ,ψ⟩=∑IμI∣⟨ψ,uI⟩∣2≥0; hence it is positive. If ∑IμI<∞, define RNψ:=∑m=1Nμm⟨ψ,uIm⟩uIm. Each RN is finite rank and compact by [F4], while Parseval gives ∥Dβ−RN∥≤sup⁡m>Nμm≤∑m>Nμm→0. Thus Dβ is compact by [F4]. Its coefficient expansion is the nuclear representation Dβψ=∑m≥1⟨ψ,uIm⟩(μmuIm), whose nuclear sum is ∑mμm<∞; [F4] therefore proves that Dβ is trace class. Conversely, if Dβ is trace class, [F9] applied to the supplied basis (uI) gives tr⁡Dβ=∑I⟨DβuI,uI⟩=∑IμI<∞. Hence Dβ is trace class exactly when the M-indexed sum is finite, and then its trace is that sum.

4.1step 3.1step 2.2algebra∎

[Conclusion] Combining step 3.1 with step 2.2 gives (e): Dβ is trace class if and only if ∑je−βεj<∞, and then tr⁡Dβ=∑Ie−βλI=∏j≥1(1−e−βεj)−1. Parts (a)-(e) are proved, and no thermal or measurement interpretation is claimed.

Depends on

Dependency tree · 2 levels

Sources