Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedjudge pass (gpt-6-luna)
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 finite-temperature density-matrix free energy

Definition

Let n≥2, r∈{1,…,n−1}, and β>0. The fixed-particle density-matrix domain is Dr:={D∈Hn:0⪯D⪯I, tr⁡D=r}, where 0⪯D⪯I means that both D and I−D are positive semidefinite in the operator order (Non-negative and positive operators). Define the continuous scalar entropy integrand on [0,1] by ϕ(x):=xlog⁡x+(1−x)log⁡(1−x),0log⁡0:=0. For D∈Dr, ϕ(D) is defined by the spectral functional calculus (The spectral functional calculus f(T) for a normal endomorphism, For normal endomorphisms, the spectral functional calculus respects sums, products, adjoints, and composition of scalar functions). The logarithm is the natural logarithm on (0,∞) (The natural logarithm has derivative 1/x and equals the integral from 1 to x of 1/t). Supply a real C1 energy E on an open neighborhood of Dr and its Hermitian Frobenius gradient FE(D), defined by DE(D)[H]=⟨FE(D),H⟩F for every Hermitian direction H. Define Fβ(D):=E(D)+β−1tr⁡ϕ(D). The fixed-Hermitian-field case is E(D)=tr⁡(FD) for a fixed Hermitian F. For nonlinear self-consistent models, E and its gradient may depend on D; the definition alone asserts no uniqueness of a minimizing density.

Depends on

Used by

Dependency tree · two levels

22 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources