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.
Entropy representation for finite separated products
An order representation for a possibly infinite primitive family and its finite products and joins under the adopted contact assumptions; the entropy is dimensionless until an independent physical calibration fixes its unit.
Statement
Let be a nonempty, possibly infinite set of primitive system labels. Assume the declared family includes every finite separated product and every finite thermal join of positive scaled copies. For every nonempty finite subset , assume its closure under positive scaling and finite thermal joining satisfies the full hypotheses A1–A7, S1–S3, T1–T5 and C1 of Contact calibrators under explicit join coherence, with the exact represented-state and preparation conventions of Forward-sector hypotheses for a simple state domain and Thermal joins and conditional contact hypotheses. The closure may be infinite; “finite” refers to the generators and to each individual product or join expression. These hypotheses concern one common declared physical endpoint relation, with its chart and join interpretations, not independently chosen orders on overlapping families. Also assume the explicit finite-factor representation and fully scalable preparation transport of Tagged scaled systems and separated products and the Axiom of Choice. Then there is a single dimensionless function on all states of the declared finite-factor family that is additive under separation, extensive under every admitted positive scaling, and characterizes every equal-composition comparison:
For each simple chart, A7 also makes concave on every convex region where the stated recombination operation is admitted. The result does not set the entropy unit to , determine additive constants across different reaction compositions, or establish empirical validity of the contact assumptions.
Facts & Assumptions
Given: The full contact branch on each finite set of generators and its join closure, A1–A6, A7, explicit finite-factor composition, and Choice.
The Axiom of Choice: every family of nonempty sets admits a choice function; the arbitrary-family calibration supplier uses it to select reference states and calibrators.
Contact calibrators under explicit join coherence: on a family of finite thermal joins satisfying the exact full contact hypotheses, every pair of simple types has a strict calibrator and comparison on every fixed finite composition of their scaled copies. No finiteness of the complete join-closed family is required.
Calibration of an arbitrary family of simple-system entropies: for a nonempty finite-factor family containing a distinguished meter type with a fixed strict meter pair, a join-closed contact family satisfying the calibrator hypotheses, A1–A6 and Choice yield one calibrated additive extensive entropy representing every same-composition comparison on every finite compound.
Simple-system geometric axioms: A7 admits the scaled recombination comparison for .
Tagged scaled systems and separated products: a separated compound has finitely many explicit tagged factors, and its scale coefficients and product identifications are declared.
Thermal-contact axioms T1–T4: T2 supplies a reversible separated split of every joined state. Accessibility axioms A1–A6 supplies spectator consistency, transitivity, positive scaling and reversible splitting of preparations.
Forward-sector hypotheses for a simple state domain and Thermal joins and conditional contact hypotheses: a type with finite primitive amount function has weight , represented state , and interpretation of a raw coefficient as the amount of that typed preparation. Joined weights and compositions add; scaled weights multiply. Reversible transport preserves the chosen endpoint relation and tags remain distinct.
Proof
Given: [A1]–[A7].
Construct the represented-state interpretation of [A7] directly: give each primitive label its unit amount function and each scaled or joined type its aggregate amount function; a raw coefficient at denotes the preparation . Finite sums denote separated preparations, and their mass and composition are the sums of these factor amounts. Pull back the common endpoint relation through this interpretation. The full-domain scaling and coherent transport in [A5], with A1–A6 and reversible splitting, supply the exact scaling and product conventions in [A7]; this construction is not an additional conclusion attributed to a pairwise comparison theorem. Every finite list of simple types has finitely many primitive generators, so the Statement's assumption supplies the complete contact branch on their join closure. Consequently [A2] applies to every pair, including a repeated primitive type, and [A3]'s whole-family hypotheses hold: each chart, pair, or finite comparison lies in one such closure with the same relation.
Since is nonempty, choose a primitive meter label . Apply [A2] on the closure generated by to obtain a strict meter pair . For each , use the closure generated by to obtain and with , the calibrator orientation required by [A3]. Choice [A1] supplies the simultaneous reference, entropy-representative and calibrator choices. Apply [A3] to the interpretation from step 1.1. It yields one entropy on separated primitive products, , representing both directions of every equal-composition comparison. Finite sums are invariant under permutation and reassociation, additive on concatenation and homogeneous under positive scaling. The empty unit has the empty sum zero; no infinite sum is introduced even when is infinite.
For a joined state, repeatedly choose the reversible split in [A6] until its finite join expression has only scaled primitive factors. Spectator consistency and transitivity make the original state equivalent to this separated primitive product, of the same aggregate composition. Define its entropy as that product's entropy from step 2.1. Two such splits are equivalent to each other, so the representation in step 2.1 makes their entropies equal; the definition is independent of all split choices. For any finite compound, concatenate these expansions. Scaling an expansion gives a reversible expansion of the scaled state by the accessibility scaling axiom in [A6] and the coherent transport in [A5], so this extension is extensive as well as additive. If have the same composition, their expansions do also; reversibility and transitivity give exactly when , hence exactly when . This extends the same representation to every finite joined or separated state without identifying distinct raw tags.
Let lie in one simple chart and . By [A4], the scaled pair compares to the recombined state . Step 3.1's representation, additivity and extensivity give This is concavity on the admitted convex chart; at the inequality is equality.
Remarks
The mathematical calibration carrier is a current authored draft with a supplied proof; independent review is still required. The transfer here is conditional on its stated mathematical hypotheses and on the adopted physical accessibility/contact axioms, and is not evidence that those axioms hold in Nature. The calibrated meter in the mathematical construction fixes a common dimensionless unit. Conversion to the physical entropy unit requires an additional scale calibration. Additive type offsets for cross-composition transitions are handled separately in Conditional weak entropy principle across mixing channels.
Depends on
The Axiom of Choice
Tagged scaled systems and separated products
Forward-sector hypotheses for a simple state domain
Thermal joins and conditional contact hypotheses
Accessibility axioms A1–A6
Simple-system geometric axioms
Thermal-contact axioms T1–T4
Contact calibrators under explicit join coherence
Calibration of an arbitrary family of simple-system entropies
Dependency tree · 2 levels
Sources
- Lieb and Yngvason, The Physics and Mathematics of the Second Law of Thermodynamics, Theorems 2.2 and 4.8 and §IV.B
- André Thess, The Lieb–Yngvason Machine: A didactical tool for the definition of entropy in classical thermodynamics, §§2–4
- Goddard, The second law of thermodynamics as variation on a theme of Carathéodory, §§2–3