Alphabeta Math
Physics theoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck pass
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.

Controlled dilute Bose/Fermi occupation limit

Physical scope

Conditional mode-by-mode approximation for a trace-class ideal Bose or Fermi grand state with dimensionless fugacities 0<q_j≤r<1 and summable squared fugacities. The occupation and log-partition errors are bounded explicitly. This is a controlled dilute or low-fugacity limit, not a high-temperature criterion, universality statement, interacting-gas result, or empirical observation.

Statement

Assume the Axiom of Countable Choice ACω (The Axiom of Countable Choice (ACω)), the preparation postulate Quantum statistics and model equilibrium preparation, and the diagonal grand-trace hypotheses of Explicit diagonal Fock domains and occupation trace. Let the mode set be finite or countable, with 0<qj≤r<1 and ∑jqj2<∞. Write nˉjB=qj/(1−qj) and nˉjF=qj/(1+qj). Then ∣nˉjB−qj∣≤qj21−r,∣nˉjF−qj∣≤qj2. The total mean occupations satisfy ∣∑jnˉjB−∑jqj∣≤11−r∑jqj2,∣∑jnˉjF−∑jqj∣≤∑jqj2. The grand log partition factors, with ΞB,ΞF as defined in Explicit diagonal Fock domains and occupation trace, obey 0≤−log⁡(1−qj)−qj≤qj22(1−r),0≤qj−log⁡(1+qj)≤qj22. Consequently, ∣log⁡ΞB−∑jqj∣≤12(1−r)∑jqj2,∣log⁡ΞF−∑jqj∣≤12∑jqj2. Thus the displayed linear fugacity terms approximate both total mean occupation and log partition with a controlled aggregate error under the stated squared-summability hypothesis.

Facts & Assumptions

Given: ACω; adopted preparation and trace-normalized diagonal occupation law; dimensionless qj∈(0,r].

[A1]

Quantum statistics and model equilibrium preparation: the species sector and normalized grand preparation are adopted assumptions, not mathematical consequences.

[F1]

Explicit diagonal Fock domains and occupation trace, Statement: under its stated summability conditions, bosonic and fermionic marginals have means q/(1−q) and q/(1+q), and log⁡Ξ is the sum of −log⁡(1−q) or log⁡(1+q).

Proof

1.1givenF1algebra

For bosons, direct subtraction gives nˉB−q=q2/(1−q); because q≤r, this is nonnegative and at most q2/(1−r). For fermions, q−nˉF=q2/(1+q), which lies between zero and q2.

1.2givenalgebra

The identity −log⁡(1−q)−q=∫0qx/(1−x) dx follows by integrating the derivative of −log⁡(1−x)−x from zero. Since 1/(1−x)≤1/(1−r) on [0,q], the integral is between zero and q2/[2(1−r)]. Also q−log⁡(1+q)=∫0qx/(1+x) dx, whose integrand lies between zero and x, giving the Fermi bound q2/2.

2.1step 1.1A1algebra

Summing the nonnegative mode errors over any finite subset preserves these bounds. Taking the increasing limit over finite subsets gives the same inequalities for the total error because ∑jqj2<∞.

3.1step 1.2F1algebra∎

By [F1], the log partition function is the sum of the corresponding mode log factors. Sum the nonnegative factor remainders from step 1.2 over finite subsets and pass to the countable limit; squared summability makes each aggregate error finite and proves the claimed controlled first-order approximation.

Depends on

Dependency tree · 2 levels

Sources