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.
Ordered Composition
1 · Prerequisites
- Binary Operations, Monoids, Groups and Subgroups
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Countability and Uncountability
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Order, Zorn's Lemma, and the Axiom of Choice
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Suprema and Infima
- The Analytic Hahn Banach Theorem
- The ZFC Axioms and the Basic Set Constructions
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
This page gives conditional mathematical results for finite-support composition. Compound coefficients are nonnegative formal amounts, and their mass is only a bookkeeping total. A comparison is a preorder with explicitly listed consistency, scaling, splitting, stability, and comparison hypotheses; the comparison hypothesis is not derived from thermodynamic state geometry.
Under a strict reference pair, the shrinking-spectator and least-upper-bound argument constructs a real-valued additive extensive representation. If no strict pair exists, all equal-mass compounds are equivalent and only the degenerate constant representation is asserted. Affine uniqueness assumes another exact additive representation. A finite common meter calibrates finitely many types only under a separately specified equal-mass comparison on the shared raw tags, satisfying the comparison axioms and exact state-to-meter substitutions. The reaction-offset alternative is exact for a finite family of supplied lower-bound inequalities; it does not infer necessity for actual transitions from loose bounds.
The final result constructs a type-offset quotient vector space and applies real dominated Hahn–Banach on the finite domain of an extended sublinear cost, then extends linearly by bases under the Axiom of Choice. Its transition consequence is conditional: this page does not prove that a catalyst-chain cost exists, is well-defined, sublinear, or has no sinks. The adopted prerequisites include the stated basis, Zorn, ZFC, and analytic Hahn–Banach pages; item-level dependencies also cite the exact complete-real, vector-space, finite-sum, and set-construction suppliers used in the proofs.
3 · Logical flowchart
4 · Definitions, postulates, theorems and proofs
Tagged scalable compounds
Definition
Let be a set of state labels. A tagged scalable compound over is a function whose support is finite. The coefficient is a dimensionless formal amount; state labels retain their tags, so equal coefficients on different labels do not identify those labels. Compounds are equal exactly when their coefficient functions are equal.
For compounds and , define composition and nonnegative scaling pointwise by and . The zero function is the empty compound; in particular . Comparison axioms involving scaling still require a strictly positive scalar unless explicitly stated otherwise. The mass of is the finite sum . It is dimensionless bookkeeping mass, not thermodynamic mass or energy. The compound is positive when .
For every state label , the unit-state compound is the coefficient function with if and otherwise. Its support is , so it is a tagged compound. In compound comparisons, a state label denotes . Every compound has the canonical finite decomposition , with an empty sum when ; coefficients on this support are strictly positive. The mass-one property and the equivalence are proved in Compound mass is well-defined and additive ↗.
The formula for mass is independent of the chosen finite set containing the support, and composition and scaling obey and ; Compound mass is well-defined and additive ↗ proves these assertions.
Remarks
No topology, continuity, or physical interpretation is part of this definition. The finite-support restriction is essential: no infinite series or convergence convention is implicit.
Compound mass is well-defined and additive
Statement
For every tagged scalable compound , the mass in Tagged scalable compounds is independent of the finite summation set used. For any compounds and , and ; . For every , the unit-state compound has . A compound has zero mass if and only if it is the empty compound.
Facts & Assumptions
Tagged scalable compounds: compounds are nonnegative finite-support functions, and mass is defined by a finite sum over support.
Finite commutative-monoid sums are invariant under bijective reindexing, split over disjoint unions, and satisfy the finite Fubini rule supplies bijective reindexing and splitting over disjoint finite sets. Enumerating a finite set expresses its real sum using Finite sums and finite products, by recursion; additivity and scalar linearity then follow from clauses 1 and 2 of Laws of finite sums and finite products. In particular, its sum of zero terms is zero, so disjoint splitting shows that adjoining zero terms leaves a sum unchanged. Clause 4 of Laws of finite sums and finite products gives nonnegativity of a sum of nonnegative terms and says that a zero sum forces each term to be zero.
Proof
Given: [F1] and [F2].
Let be any finite subset of containing . On the function is zero, so the finite sum over equals the finite sum over by [F2]. If and both contain the support, compare each sum to the sum over the finite union ; hence the value is independent of the chosen finite summation set.
The support of is contained in the finite union of the supports of and . Sum over that union; distributivity in [F2] gives , since zero terms outside each individual support contribute nothing by step 1.1. The support of equals that of for , and scalar linearity of the finite sum gives . For , and both and are zero. The empty sum is zero, so .
The support of is the singleton , whose one summand is , so the recursion in [F2] gives . If , sum its nonnegative coefficients over its finite support. Clause 4 in [F2] forces every summand to be zero; coefficients off the support are also zero, hence . Conversely has zero mass by step 2.1. Thus all the claimed mass identities hold, including the empty and unit-state cases.
Comparison and stability for compounds
Definition
Fix a nonempty set and the compounds of Tagged scalable compounds. A comparison relation is defined only for pairs with . Write when both and ; this is equivalence, not equality of coefficient functions. The following are explicit hypotheses on :
- Preorder: , and implies .
- Composition consistency: implies for every compound .
- Positive scaling: implies for every real .
- Splitting and recombination: for , and , the one-state compound is equivalent to .
- Stability: for equal-mass , fixed positive compounds with , and a sequence decreasing to , if for every , then .
- Comparison hypothesis (CH): for every equal-mass pair , either or (or both).
These are mathematical assumptions, not conclusions about a physical system. No antisymmetry, continuity, convexity, or strict comparison is included. Strict comparison means and not .
Remarks
In the stability clause, a sequence is a function ; “decreasing to ” means whenever and in the sense of Limits and Cauchy sequences of reals. The separate requirement is stated in the clause.
Signed comparison of finite coefficient maps
Definition
Let be finite-support real coefficient maps with equal total coefficient . These signed maps are formal comparison notation, not compounds. Put and define and . Then are nonnegative finite-support compounds of equal mass, as verified in Spectator cancellation and signed-order algebra ↗. Define
using the compound comparison relation of Comparison and stability for compounds. Thus positive coefficients of remain on the right and negative coefficients move to the left. Signed notation is never a claim that a negative amount of a physical system exists.
Reciprocals of the positive integers decrease to zero
Statement
In the complete ordered field , the sequence , , is positive, strictly decreasing, and converges to zero.
Facts & Assumptions
Complete ordered field (least-upper-bound property): every nonempty subset of an ordered field that is bounded above has a least upper bound.
The natural numbers (von Neumann), Addition of natural numbers, Addition is commutative, Left identity for addition, and Order on the natural numbers: is the von Neumann set of naturals, its successor is , and means for some . Since , every successor is at least . Natural indices remain in ; in field expressions the successor is carried into by the canonical natural map of The canonical natural of a field.
The canonical natural of a field and Canonical naturals are positive and strictly increasing: write for the canonical natural map, with and . It is positive on positive naturals and strictly increases there. Thus the displayed denominator means , not a von Neumann set used as a real number.
The unique embedding of ℚ into an ordered field: the rational embedding into preserves order, so every rational has positive real image . The multiplicative identity is positive, Inverses of positives are positive, and reciprocation reverses order, and Sign rules for products and monotonicity of multiplication supply , positivity of the inverse of a positive real, and reversal of order by reciprocation on positive reals.
Limits and Cauchy sequences of reals: a real sequence converges to when, for every rational , its absolute value is eventually less than .
Proof
Given: [F1]–[F5].
The set is nonempty. If it were bounded above, completeness [F1] would give . Since by [F4], , so is not an upper bound; choose with . By the successor rule in [F3], , while , contradicting that is an upper bound. Hence is unbounded above.
For every , by natural-addition commutativity and the successor rule, so by the definition of natural order; hence by [F3]. The successor recursion gives , since . Reciprocation reverses this strict inequality by [F4], hence and . Now fix rational and let be its real image. By step 1.1 choose with . If , then by [F2] and Order is compatible with addition, and the increasing-map clause of [F3] gives . Therefore . This is convergence to zero by [F5].
Spectator cancellation and signed-order algebra
Statement
Under Comparison and stability for compounds, for compounds with and any compound , if and only if . The signed relation of Signed comparison of finite coefficient maps is well-defined; on nonnegative equal-mass maps it agrees with , is invariant under adding the same finite-support signed map to both sides, and is transitive and closed under adding two comparisons.
Facts & Assumptions
Tagged scalable compounds and Compound mass is well-defined and additive: compounds are finite-support nonnegative maps; their masses are finite sums, additive under composition and homogeneous under positive scaling.
Comparison and stability for compounds: is a preorder, composition-consistent, positively scale-invariant, admits splitting/recombination, satisfies the stated positive-spectator stability axiom, and has CH.
Signed comparison of finite coefficient maps: for equal-total finite signed maps , the signed comparison is defined by comparing with .
The canonical natural of a field and Canonical naturals are positive and strictly increasing give the canonical embedding , whose successor values are positive and are finite sums of . Reciprocals of the positive integers decrease to zero gives the real sequence , , with .
Proof
Given: [F1], [A1], [F2], and [F3].
For equal-total , has finite support and total sum zero. Pointwise , so finite-sum linearity gives ; both maps are finite-support and nonnegative. Thus the definition in [F2] compares equal-mass compounds. If are nonnegative, set ; then and .
Suppose and . For each , set and , and write . The embedding's successor rule and finite induction show that the sum of copies of is , and likewise for . Scaling the given comparison by gives . By composition consistency, replace the copies of one at a time by , keeping the already replaced copies, the remaining copies, and as spectators; after these finitely many replacements, . This holds for every natural index . By [F3], and , so stability with gives . If , nonnegativity implies and the conclusion is the premise itself. Conversely, gives by consistency.
For nonnegative , step 1.1 gives and . Cancellation from step 1.2 shows exactly when , which is . For general signed maps, adding a common map leaves unchanged, so it leaves signed comparison unchanged.
If and , consistency gives , where and . Pointwise . Set . If then and ; if the same identities follow with the two sides exchanged. Thus and , with all four maps finite-support and nonnegative. Cancellation from step 1.2 gives , hence . For two independent signed comparisons, the same pointwise decomposition of the sums of their positive and negative parts proves closure under adding comparisons. Reflexivity follows because .
Ordering the two-state reference mixtures
Statement
Let satisfy and not . For every real , define the signed unit-mass reference map . For all ,
The parameters need not lie in ; outside that interval is signed notation, not a compound.
Facts & Assumptions
Comparison and stability for compounds: the relation is reflexive, positively scale-invariant, and the reference states have the stated one-way comparison.
Signed comparison of finite coefficient maps: signed comparison is determined by the positive and negative parts of the coefficient difference.
Spectator cancellation and signed-order algebra: on positive maps the signed relation agrees with the compound relation, and its definition is well-defined for equal-total signed maps.
Proof
Given: [A1], [F1], and [F2].
Put . The coefficient difference is and has total zero. If , its negative and positive parts are and ; if , they are and ; if , both are zero.
If , reflexivity gives . If , [F1] reduces this comparison to , which follows by positive scaling of by . Hence implies .
If and , [F1] gives for . In the ordered real field, : , and if then closure of the positive cone under multiplication gives . But : since , trichotomy gives either or ; the latter would, by positive-product closure, also give , contradicting trichotomy. Thus is impossible, and so . Positive scaling by therefore implies , contrary to [A1]. Thus this comparison fails when . The three cases prove the equivalence.
Reference entropy supremum is finite and attained
Statement
Assume Comparison and stability for compounds on compounds over a nonempty state set , a strict reference pair with not , and the complete ordered field . For define
Then is nonempty, bounded above, and downward closed. Its supremum is a real number and satisfies . Stability is used to prove attainment; no continuity of states or order is assumed.
Facts & Assumptions
Comparison and stability for compounds: equal-mass compounds form a preorder with consistency, positive scaling, stability for fixed positive spectators, and CH.
Tagged scalable compounds and Compound mass is well-defined and additive: has mass one, compound masses are finite sums, and composition/scaling preserve the stated masses.
Signed comparison of finite coefficient maps and Spectator cancellation and signed-order algebra: signed comparisons are well-defined, translation-invariant, and agree with ordinary comparison on nonnegative compounds. For a finite-support signed map , write and pointwise; these are finite-support nonnegative maps with , and this notation extends the positive and negative parts used in Signed comparison of finite coefficient maps to each signed reference map itself.
Ordering the two-state reference mixtures: exactly when .
Reciprocals of the positive integers decrease to zero: for , with is positive, strictly decreasing, and converges to zero. Its canonical-natural convention gives and ; natural indices and their real images are distinguished.
Complete ordered field (least-upper-bound property): every nonempty bounded-above subset of has a supremum.
Proof
Given: [A1]–[F5], with fixed.
Write , so by [F4]. Suppose no satisfies . Both sides have mass , so CH gives . Scale by to obtain . Apply stability to the sequence , with bases and positive unit-mass spectators . It yields , contradicting strictness. Thus some has , which by signed translation and cancellation in [F2] is ; hence .
Suppose is unbounded above. For each , unboundedness supplies with ; [F3] gives , and transitivity gives . Since by [F4], adding the common compound to and makes them and . Thus [F2] identifies with the compound comparison between those maps. Scaling by gives . Stability with bases and positive unit-mass spectators now yields , again a contradiction. Therefore is bounded above.
If and , [F3] gives ; signed transitivity and imply . Thus is downward closed. By steps 1.1 and 1.2 it is nonempty and bounded above, so [F5] supplies the real number .
For each , is not an upper bound of , so some has . Downward closure gives . Consistency then gives , because . Let . Adding the fixed nonnegative map to both sides converts this signed comparison into the compound comparison . Their bases have equal mass because . Stability with positive unit-mass spectators yields , that is, .
Since is an upper bound, for every . To derive the reverse signed comparison from CH, set . The translated maps and are nonnegative compounds. Since has total coefficient one, finite-sum linearity gives ; with , the translated compounds have equal mass . CH applies to this pair. If it gave , signed translation invariance in [F2] would imply , contrary to . Therefore it gives , which by [F2] is . Add to both signed maps and use . Then add to both; the resulting equal-mass compound comparison is . Stability with bases and positive unit-mass spectators gives , or . Together with step 3.1 this proves and the claimed attainment.
Additive extensive representation of compound comparison
Statement
Let be nonempty and suppose its finite-support compounds carry the comparison structure of Comparison and stability for compounds over the complete ordered field . If there are with and not , define using Reference entropy supremum is finite and attained. Then is normalized by , , and for all equal-mass compounds and ,
Thus is an additive extensive representation on finite compounds. If no strict pair exists, CH instead makes every equal-mass pair of compounds equivalent, and any constant state function gives a (degenerate) additive representation. No concavity, continuity, or physical law follows without additional hypotheses.
Facts & Assumptions
Comparison and stability for compounds: equal-mass compounds satisfy the preorder, consistency, scaling, stability and comparison hypotheses; the state set is nonempty.
Signed comparison of finite coefficient maps and Spectator cancellation and signed-order algebra: signed comparisons are translation-invariant and additive, and agree with ordinary comparison for nonnegative compounds.
Reference entropy supremum is finite and attained: in the strict-reference case, each is finite and .
Ordering the two-state reference mixtures: iff for the chosen strict reference pair.
Tagged scalable compounds and Compound mass is well-defined and additive: each state denotes its unit-mass point compound ; every compound is the finite sum of its strictly positive support coefficients, or the empty sum. Nonnegative scaling is pointwise, , and a nonnegative compound has zero mass exactly when it is empty.
Proof
Given: [A1] and [F1]–[F4].
In the strict-reference case, [F3] gives exactly for , and exactly for . Their suprema are therefore and .
Let have mass and set . Discard any zero terms in this presentation using [F4]. If the support is empty, , and , so signed reflexivity gives the claimed equivalence. Otherwise each remaining coefficient is strictly positive. For each remaining constituent, [F2] gives ; positive scaling and finite repeated use of composition combine these into , where . This calculation is valid for signed coefficients because the signed relation is additive and translation-invariant by [F1].
Apply step 1.2 to both and , and write for the resulting scalar sums. Since and , transitivity gives exactly when . Their masses agree, and ; [F3] therefore gives exactly when . This proves the representation formula.
In the no-strict-pair case, take any . By [F4] their unit compounds have equal mass one, so CH gives one of or ; if exactly one held it would be a strict pair, so both hold. Fix . Let have mass . If , [F4] gives , and reflexivity handles this empty compound without applying the positive-scaling axiom at zero. If , use the canonical finite decomposition over the support from [F4]; every coefficient there is positive. Scale each constituent equivalence by its positive coefficient and compose the finitely many comparisons to obtain . Thus equal-mass are both empty when their common mass is zero, and otherwise each is equivalent to the same ; hence they are equivalent in both cases. For a constant , both compound values equal , including zero for empty compounds, so the representation equivalence holds.
Uniqueness up to a positive affine transformation
Statement
Assume the strict-reference hypotheses and let be the normalized representation from Additive extensive representation of compound comparison. Let be another additive extensive representation of the same comparisons: for every finite compound define , and require iff whenever . Then there are unique and such that for every . Conversely every such positive affine change represents the same comparisons.
Facts & Assumptions
Additive extensive representation of compound comparison: for every , with and .
Signed comparison of finite coefficient maps and Spectator cancellation and signed-order algebra: signed equivalence is obtained by cancelling common finite coefficients; additive order comparisons extend consistently to finite signed maps.
Comparison and stability for compounds: the chosen pair satisfies and not .
Proof
Given: [F1], [F2], and [A1].
Fix and put . The equivalence in [F1] says that the positive and negative parts of their coefficient difference compare in both directions. Since represents the same order, their finite -sums are equal. By its definition on finite compounds and linearity of finite sums, the signed value of is , including when . Thus .
Because but not conversely, the exact representation property of gives . Hence and give the asserted form. Conversely, multiplying both sides of any represented-value inequality by and adding the same times the common compound mass preserves and reflects its order; therefore represents the same comparisons. The parameters are unique by evaluating at and , where equals and .
Finite-family calibration by a common meter
Statement
Let be a finite nonempty set of system types, a nonempty state set with chosen reference for each , and a common meter state set with distinct . For each , let be a comparison relation on equal-mass compounds over the Cartesian product (The Cartesian product ), defined as in Comparison and stability for compounds and satisfying its six hypotheses: preorder, composition consistency, positive scaling, splitting and recombination, stability, and CH. Write for the signed comparison supplied by Signed comparison of finite coefficient maps, and for mutual signed comparison. Assume and not . Let be the normalized representation supplied by Additive extensive representation of compound comparison for this product comparison, and put . In the product comparison, the unit product-state point mass satisfies
by Reference entropy supremum is finite and attained. These product-state point masses and product comparisons are separate from the shared state-and-meter compounds and comparison defined next.
Assume a common-meter compatibility interface as follows. Let be a set of raw tags containing three pairwise disjoint families , , and , with . Compounds over are finite-support nonnegative coefficient maps as in Tagged scalable compounds. Let be a relation on equal-mass compounds over satisfying all six hypotheses of Comparison and stability for compounds; write for its signed comparison from Signed comparison of finite coefficient maps and for mutual signed comparison. The common relation is a separate relation from each product comparison .
Let and be the unit point-mass compounds on their indicated raw tags, and define . Thus is an explicit mass-two state-and-fixed-meter compound, not a unit tag. Require the exact signed substitution
and require the common meter point masses to satisfy and not . Both sides of each substitution have total coefficient two, even when lies outside . Finite substitutions compose and common terms cancel by Spectator cancellation and signed-order algebra under the stated common comparison hypotheses; neither property is inferred from the separate product comparisons or from numerical meter values.
For positive coefficients on a finite collection of type- states , define and . Put and . Thus is the state compound of mass and is its fixed-meter encoding of mass . Empty collections give and . Define
For two such compounds with the same type-total vector , the common comparison satisfies exactly when . Equivalently, the same order criterion holds for the state compounds after canceling their common . The index family is finite; no arbitrary-index choice or infinite decomposition is asserted.
Facts & Assumptions
The common-meter compatibility assumptions in the Statement: the relation is defined on equal-mass compounds over , satisfies all six comparison hypotheses, each exact signed substitution holds, and the common meter pair is strict.
Additive extensive representation of compound comparison supplies the real normalized product representation for each , and Reference entropy supremum is finite and attained supplies in that product comparison. The separate mass-two substitution on is exactly [A1], not an identification of product and shared tags.
Spectator cancellation and signed-order algebra: on the common relation , finite signed substitutions are additive, invariant under common signed translation, and common terms can be canceled. Signed comparison of finite coefficient maps and Comparison and stability for compounds also preserve signed comparison under positive scaling: multiplying the difference by a positive scalar multiplies both its positive and negative parts by that scalar, so the compound scaling axiom applies.
Ordering the two-state reference mixtures: applied to the common relation and its strict meter pair, comparison of equal-mass reference expressions is exactly comparison of their coefficients.
Proof
Given: [A1] and [F1]–[F3].
For each constituent of , its mass-two shared compound is equivalent under by [A1] to . Each side has total coefficient two, so the signed substitution is defined. Scale by and combine the finitely many comparisons using the comparison axioms and [F2]. The resulting reference-system part is , independent of the chosen states. The meter part has coefficients on and on , where . Hence is equivalent under to that fixed reference-system compound plus , whose total coefficient is . If the collection is empty, both expressions are zero and the equivalence is reflexivity, requiring no order scaling at zero.
The same substitution for gives the same reference-system compound because its type totals agree, and the same total meter mass . Cancel the common reference-system terms by signed translation and cancellation in [F2]. If , the remaining meter maps have total coefficient . The reciprocal is positive: , and if then positivity of and closure of the positive cone under multiplication give . But : since , trichotomy gives either or ; the latter would, by positive-product closure, also give , contradicting trichotomy. Thus is impossible, and so . Scaling by turns the remaining maps into the unit reference maps and on . By [F3] these compare exactly when ; multiplying both sides by preserves order, so this is equivalent to . Scaling back by proves the comparison equivalence, so no unit-mass reference theorem is applied directly at mass . Reversing the equivalences proves the converse implication as well. Since and , [F2] also gives exactly when ; for all these compounds are empty and the criterion is .
Remarks
The compatibility interface records the compositional assumption needed to move from separate product systems to one shared meter scale. Without it, independent representations need not share a multiplicative calibration. This theorem makes no statement for infinitely many types.
Finite inequality alternative by Fourier–Motzkin elimination
Statement
Let be finite, let and for , where is the function space on with coordinatewise operations as in The vector space of all functions with pointwise operations, and as the case . For , define the dot product by . A finite vector sum is coordinatewise: for each . All sums use Finite sums and finite products, by recursion.
The finite system
has a solution if and only if every with and satisfies . Dot products and sums are finite. This includes empty rows, empty variables, and an empty inequality family.
Facts & Assumptions
The finite row data in the Statement: are nonnegative integers, and each row is with real coefficients.
Complete ordered field (least-upper-bound property) supplies the complete ordered real field; The vector space of all functions with pointwise operations, and as the case defines as functions on with pointwise coordinate operations, forming a vector space as in Vector space over a field, including the one-element zero space when . The dot product and finite vector sums are exactly those defined in the Statement.
Finite sums and finite products, by recursion and clauses 1 and 2 of Laws of finite sums and finite products supply finite-sum additivity and scalar linearity. Finite commutative-monoid sums are invariant under bijective reindexing, split over disjoint unions, and satisfy the finite Fubini rule supplies finite-set enumeration, bijective reindexing and interchange of finite iterated sums; applied to and its pointwise function spaces, these laws justify collecting coordinates and coefficients in finite row combinations.
Sign rules for products and monotonicity of multiplication: a product of positive reals is positive, multiplying an inequality by a positive real preserves its direction, and multiplication by zero yields equality.
The principle of mathematical induction: a property of the natural-number length that holds at zero and passes from each length to its successor holds at every finite length.
Every nonzero natural number is a successor: each nonzero natural number has a predecessor with .
Proof
Given: [A1]–[F5].
If solves the system and with , multiply row by and add the finitely many inequalities. By [F3] each row inequality is preserved under its nonnegative multiplier. By the coordinatewise definitions in the Statement and finite-sum distributivity with Fubini from [F2], . Hence . This proves necessity.
For sufficiency, prove by induction on the alternative: if the finite system has no solution, there is a nonnegative combination of its rows whose coefficient vector is zero and whose right side is positive. If , every row has zero left side; infeasibility means some , and that single row is the certificate. If , the system is feasible, so this case cannot occur under the induction claim's antecedent.
Let and assume the alternative for variables, where by [F5] and The natural numbers (von Neumann). For define by for , and put ; this separates its first coordinates and its last coordinate. Conversely, each and determine the unique with for and . For every row , define for and . Partition the row indices into , , and . Retain each row for . For every and , add the reduced row . Every multiplier used is positive, so these row combinations preserve the inequality directions by [F3].
The reduced system in is feasible exactly when the original is, using the coordinate reconstruction in step 1.3. Indeed, a solution implies every retained inequality; adding row multiplied by to row multiplied by cancels and gives each pair row. Conversely, if satisfies the reduced system, rows in impose finitely many lower bounds , and rows in impose finitely many upper bounds . Each pair row is exactly . To justify the finite extrema, enumerate any nonempty finite list of lower bounds and define ; for , recursively set if , and otherwise. Totality of the real order makes the larger of and ; induction [F4] shows that is a member of the list and dominates every entry. Thus a finite nonempty list has a maximum. For an upper-bound list , define and, for , set if , and otherwise. The same totality and induction argument shows is a member no greater than any entry, so every finite nonempty list has a minimum. If both are nonempty, these extrema and all pair inequalities give , so choose . If only lower bounds occur choose their finite maximum; if only upper bounds occur choose their finite minimum; if neither occurs choose . Thus the original system has a solution.
If the original system is infeasible, step 2.1 makes the reduced system infeasible. By induction there are nonnegative multipliers on reduced rows with zero combined first coordinates and positive combined right side. Lift each retained zero-row multiplier to its original row; lift each pair-row multiplier to coefficients on row and on row . All lifted coefficients are nonnegative by [F3]. Every pair lift has last coordinate ; the total first coordinates vanish by the reduced certificate, and its right side remains positive. This is the required certificate for the original system and completes the induction.
If the stated multiplier condition holds, the certificate from step 3.1 cannot exist, because it would have zero combined left coefficient and positive combined right side. Therefore the system is feasible. Together with step 1.1 this proves both directions, including the empty-variable base case in step 1.2, the zero/positive/negative sign partition and bound reconstruction in steps 1.3–2.1, and the lifted certificate in step 3.1.
Feasibility of finite reaction offsets
Statement
Let be a finite set of channel labels and . For each , take and as independently specified real input data; this theorem does not define channel input/output compounds, a calibration map, or a map producing . In an application, separate model data may specify vectors and set , while a separately supplied real number may be designated as a channel's calibrated entropy change and as its lower bound. These are additional application premises, not conclusions or inputs derived here. Use the dot product and coordinatewise finite vector sums defined in Finite inequality alternative by Fourier–Motzkin elimination: for , , and . A multiplier is a function . There exists an offset vector satisfying
if and only if every with and satisfies . If a separate model supplies for each a real number , designated as its transition entropy change, and assumes , such a vector guarantees for those channels. The criterion is exact for the finite lower-bound inequalities; it does not claim necessity for actual transitions when is only a loose bound.
Facts & Assumptions
The finite vectors and reals are independent input data. No relation between channel input/output compounds, common-meter values, calibrated changes, and is assumed or constructed here; the transition conclusion is conditional on separate real values satisfying .
Finite inequality alternative by Fourier–Motzkin elimination: the stated dot product is a finite coordinate sum and vector sums are coordinatewise; the finite row system is feasible exactly when every nonnegative zero-left-side multiplier has nonpositive combined right side.
Finite commutative-monoid sums are invariant under bijective reindexing, split over disjoint unions, and satisfy the finite Fubini rule: every finite row-label set admits an enumeration by a natural-number index set; reindexing by a bijection preserves the finite vector and scalar sums.
Proof
Given: [A1], [F1], and [F2].
By [F2], choose a natural number and a bijection ; when , take and the empty bijection. Reindex the data as and for . The row system is exactly the required offset system. By [F1], it is feasible exactly when every nonnegative multiplier family with has . The bijection transports such a family to on , preserving nonnegativity and both finite sums by [F2]. Hence this condition is precisely . For , is feasible and the multiplier condition is vacuous. If and is nonempty, every ; testing the coordinate multiplier for each channel makes the criterion equivalent to for every , and then the unique empty vector satisfies all rows.
For any channel with actual change , add to both sides of that bound and use the solved row inequality . Then . This is a sufficient monotonicity conclusion for the stated channels.
Remarks
For and nonempty , the criterion reduces to for every channel. Strict increase, infinitely many channels, and lower bounds equal to actual changes are separate conditions and are not inferred here.
Type-offset quotient vector space
Definition
Let be a set of formal type labels closed under the formal operations and for every real . Let be the vector space of finite-support real functions on , and let be the function equal to at and elsewhere.
Form the set of relation vectors
Following Linear combination of a finite list, and the span as the smallest linear subspace containing , let consist of exactly the vectors for , scalar lists and vector lists . The sum is computed in the additive group of , starting with and recursively setting for ; its value is . In particular, the empty list contributes . Define the type-offset vector space
The class of is . The defining relations are and . The set existence, subspace properties, quotient operations and vector-space laws are proved in Type-offset quotient is a real vector space ↗. These are formal algebraic type labels; no actual catalyst-chain cost or physical existence claim is built into .
Type-offset quotient is a real vector space
Statement
For the construction in Type-offset quotient vector space, and are sets, is a real vector space, is a linear subspace of , and has representative-independent vector operations making it a real vector space. Its displayed product and positive-scaling relations hold in the quotient.
Facts & Assumptions
Type-offset quotient vector space: is a set closed under product and positive scaling; consists of finite-support functions; is the set of finite linear combinations of the stated relation vectors.
The vector space of all functions with pointwise operations, and as the case and Vector space over a field: all functions form a real vector space under pointwise operations.
Linear subspace of a vector space: a nonempty subset closed under addition and scalar multiplication is a linear subspace with inherited operations.
The Axiom of Pairing: , The Axiom of Union: , The Axiom of Infinity: there is a set containing a set with no elements and closed under , The Axiom Schema of Separation: for each formula , , The Axiom of Power Set: , The Axiom Schema of Replacement: for each formula , if defines a class function on then its image on is a set, and The Cartesian product : pairs, unions, natural numbers, subsets, power sets, images of sets, and Cartesian products of sets exist.
Proof
Given: [F1]–[F4].
The set of all functions exists and is a vector space by [F2]. Separation [F4] selects the functions whose support is finite, so is a set. It contains zero; if , then , a finite union, and for every scalar . Thus is a linear subspace of the function space by [F3], hence a real vector space.
The index sets and exist by [F4]. Replacement applied to the two displayed relation maps in [F1] gives the set ; each relation vector has support of size at most three and lies in . The family of finite subsets of is a subset of its power set, and the coefficient functions on each such finite subset form sets by [F2] and [F4]. Replacement under finite summation therefore gives the set of all finite linear combinations.
The zero vector is in as the empty sum. If , write each as a finite combination of relation vectors; their sum is the finite combination on the union of those two finite index sets, adding coefficients where an index repeats. For , is obtained by multiplying every coefficient by . Hence is closed under addition and scalar multiplication and is a linear subspace of by [F3].
Define on exactly when . Since , is closed under negatives (take scalar ), and under addition, this relation is reflexive, symmetric and transitive. Each class is a subset of by separation; replacement on the set gives the quotient set of these classes.
If and , then ; and for any scalar , . Therefore and do not depend on representatives. The quotient map preserves zero, addition and scalar multiplication; applying it to each vector-space identity in proves all vector-space axioms in . Every generator in lies in , so its class is zero and the two displayed relations hold.
Infinite-valued no-sinks Hahn–Banach sandwich and conditional offsets
Statement
Assume the Axiom of Choice. Let be a real vector space and satisfy , for every , and in extended-real arithmetic. Assume no sinks: if and only if . Put . Then is a linear subspace and there exists a real-linear such that
with interpreted in the usual extended order. The result is valid in arbitrary dimension and allows outside .
For the conditional offset application, let from Type-offset quotient vector space, let satisfy , and define . Then , for , and
For each , let be a state set and a baseline state function. If every admitted transition , with and , satisfies , then is nondecreasing across those transitions. The existence or properties of such a cost , including no-sinks, are hypotheses and are not proved by this theorem.
Facts & Assumptions
The Axiom of Choice: adopt the Axiom of Choice for the Hahn–Banach and basis-extension steps.
Vector space over a field and Linear subspace of a vector space: is a real vector space, and a subset closed under addition and all scalar multiples is a linear subspace.
A sublinear functional on a real vector space: a real-valued sublinear functional is positively homogeneous and subadditive.
Hahn-Banach dominated extension theorem for real vector spaces: for real vector spaces, a subspace, a real-valued sublinear functional and a linear functional dominated on that subspace, there is a dominated linear extension to the whole space.
Complete ordered field (least-upper-bound property): the real field used in the one-step dominated-extension argument has the least-upper-bound property.
Every vector space has a basis and Zorn's lemma gives a basis between any linearly independent set and any spanning set containing it: if with independent and , there is a basis of with : under the adopted choice strength, a vector space has a basis and an independent subset extends to a basis of the ambient space.
Linear independence: a finite list is independent when forces every , and a subset is independent when every injective finite list into is independent and Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis: a basis is an independent spanning set; spanning gives a finite expression for each vector, and independence makes its finite coefficient map unique.
Type-offset quotient vector space and Type-offset quotient is a real vector space: the quotient is a real vector space with the declared product and positive-scaling relations.
The extended real line , its order, and the arithmetic that is left undefined: the order and negation on are extended as defined there; for values in , addition is the real sum when both are real and is when either is , while multiplication by sends to . These cases avoid the undefined extended-real operations listed in that definition.
Linear functionals and the algebraic dual : a real-linear functional is a linear map, so and for and .
The Axiom Schema of Separation: for each formula , : since is a function on the set and is in the extended-real codomain, Separation forms the subset as a set.
Proof
Given: [A1]–[F10] and the hypotheses on .
By [F10], is a set. It contains because . If , subadditivity gives , so by the extended-real conventions in [F8]. For , homogeneity gives . If , put ; no-sinks gives , and positive homogeneity applied to puts in . Also . Thus is a linear subspace. The restriction is finite-valued, positively homogeneous and subadditive, so it is a real-valued sublinear functional.
Let and let . This is linear and satisfies . The real ordered field is complete by [F4], as used in the one-step interval argument of the published theorem. Apply [F3] to and ; it gives a linear with for every . Applying this at yields , so on .
By [F5], choose a basis of and extend its independent set to a basis of . Assign value to and to . For any , [F6] gives a finite basis expression; define as the same finite linear combination of assigned real values. If two expressions represented , subtracting and collecting equal basis vectors would give a finite zero combination; independence in [F6] forces every collected coefficient to be zero. Thus is well-defined. Concatenating finite expressions proves additivity and scalar homogeneity, so is linear in the sense of [F9]; the basis expression of any uses only , so .
For , step 3.1 and step 2.1 give . If , then by the definition of ; no-sinks implies as well, so by [F8] the extended bounds reduce to . This proves the global sandwich.
In the type-offset application, linearity of in the sense of [F9] and the quotient relations in [F7] give and . Apply the sandwich to and its negative, using the assumed values of , to obtain the two displayed bounds for . For an admitted transition, its real baseline change is at least , so that cost value must be finite. The corrected change equals . The assumed lower bound on the baseline change and the upper sandwich bound make this at least . This proves only the stated conditional monotonicity.
Remarks
The real-valued Hahn–Banach theorem is applied only on the finite domain ; the arbitrary-dimensional extension to uses a basis and its extension under Choice. When , both sandwich endpoints are infinite by no-sinks. Neither the finite-dimensional strict-extension variant nor a catalyst-chain cost construction is asserted.
5 · Examples, experiments and counterexamples
None yet.
Sources
- Lieb and Yngvason, The Physics and Mathematics of the Second Law of Thermodynamics, §§II.A.1–II.A.2
- Lieb and Yngvason, The Physics and Mathematics of the Second Law of Thermodynamics, §§II.C–II.D
- Campión et al., A Survey on the Mathematical Foundations of Axiomatic Entropy, §§2–5
- Lieb and Yngvason, The Physics and Mathematics of the Second Law of Thermodynamics, §II.D
- Math 521 – Spring 2010 course notes, Chapter 20
- Lieb and Yngvason, The Physics and Mathematics of the Second Law of Thermodynamics, Theorem 2.1 and §II.D
- Lieb and Yngvason, The Physics and Mathematics of the Second Law of Thermodynamics, Lemma 2.2
- Lieb and Yngvason, The Physics and Mathematics of the Second Law of Thermodynamics, Lemmas 2.1 and 2.3
- Lieb and Yngvason, The Physics and Mathematics of the Second Law of Thermodynamics, Theorem 2.2
- Lieb and Yngvason, The Physics and Mathematics of the Second Law of Thermodynamics, Theorem 2.3
- Lieb and Yngvason, The Physics and Mathematics of the Second Law of Thermodynamics, §II.E
- Stanford EE464, Fourier–Motzkin Elimination lecture notes
- Lieb and Yngvason, The Physics and Mathematics of the Second Law of Thermodynamics, §VI.B
- MIT 18.102, Introduction to Functional Analysis, complete lecture notes
- D. Daners, Introduction to Functional Analysis (2017), Theorem 26.1 and proof
- G. Teschl, Topics in Real and Functional Analysis, §4.2, Theorem 4.11 and proof