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 static fermion-mode trace and occupation identity
Statement
Let be an integer, let , , and . Define the finite index set and the finite-dimensional Hilbert space with orthonormal basis . Define diagonal operators and on this basis by For a matrix on , trace means the finite sum of its diagonal entries in this basis. Then The normalized diagonal state with weights has, for each , occupation mean For , the empty product and trace are , and there are no occupation marginals. This is a finite-dimensional algebraic identity and uses no choice principle, curved-space spectrum, or gravitational field equation.
Facts & Assumptions
Given: A finite set of modes indexed by , their real energies , and finite parameters and .
The occupation basis is indexed by bit strings ; and are the diagonal operators defined in the Statement. The trace is the finite diagonal sum in that basis.
Proof
Put . Each is a finite positive real number. Expanding the finite trace over bit strings and factoring a finite sum gives Every factor lies in , so the product is finite and positive; for both sides equal .
Dividing each diagonal weight by the positive finite gives a normalized probability distribution on the finite basis. For , summing over the other bits factors their terms and yields The same calculation establishes the marginal directly and does not invoke a countable product or any axiom of choice.
Dependency tree · 0 levels
Nothing. This result depends on no other item in the library.