Alphabeta Math
Pipeline-generated
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

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

DefinitionDefinition: Literature-sourcedProof: Not applicableverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

Tagged scalable compounds

Definition

Let X be a set of state labels. A tagged scalable compound over X is a function c:X→R≥0 whose support supp⁡(c):={x∈X:c(x)≠0} 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 c,d and t≥0, define composition and nonnegative scaling pointwise by (c+d)(x):=c(x)+d(x) and (tc)(x):=tc(x). The zero function is the empty compound; in particular 0c=0. Comparison axioms involving scaling still require a strictly positive scalar unless explicitly stated otherwise. The mass of c is the finite sum m(c):=∑x∈supp⁡(c)c(x). It is dimensionless bookkeeping mass, not thermodynamic mass or energy. The compound is positive when m(c)>0.

For every state label x∈X, the unit-state compound ex is the coefficient function with ex(y)=1 if y=x and ex(y)=0 otherwise. Its support is {x}, so it is a tagged compound. In compound comparisons, a state label x denotes ex. Every compound has the canonical finite decomposition c=∑x∈supp⁡(c)c(x)ex, with an empty sum when c=0; coefficients on this support are strictly positive. The mass-one property m(ex)=1 and the equivalence m(c)=0⟺c=0 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 m(c+d)=m(c)+m(d) and m(tc)=tm(c); 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.

LemmaStatement: Literature-sourcedProof: AI-adaptedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

Compound mass is well-defined and additive

Statement

For every tagged scalable compound c, the mass in Tagged scalable compounds is independent of the finite summation set used. For any compounds c,d and t≥0, m(c+d)=m(c)+m(d) and m(tc)=tm(c); m(0)=0. For every x∈X, the unit-state compound ex has m(ex)=1. A compound has zero mass if and only if it is the empty compound.

Facts & Assumptions

[F1]

Tagged scalable compounds: compounds are nonnegative finite-support functions, and mass is defined by a finite sum over support.

[F2]

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].

1.1F1F2

Let E be any finite subset of X containing supp⁡(c). On E∖supp⁡(c) the function is zero, so the finite sum over E equals the finite sum over supp⁡(c) by [F2]. If E and E′ both contain the support, compare each sum to the sum over the finite union E∪E′; hence the value is independent of the chosen finite summation set.

2.1F1F2step 1.1

The support of c+d is contained in the finite union of the supports of c and d. Sum over that union; distributivity in [F2] gives m(c+d)=m(c)+m(d), since zero terms outside each individual support contribute nothing by step 1.1. The support of tc equals that of c for t>0, and scalar linearity of the finite sum gives m(tc)=tm(c). For t=0, tc=0 and both m(tc) and tm(c) are zero. The empty sum is zero, so m(0)=0.

3.1F1F2step 2.1∎

The support of ex is the singleton {x}, whose one summand is 1, so the recursion in [F2] gives m(ex)=0+1=1. If m(c)=0, 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 c=0. Conversely c=0 has zero mass by step 2.1. Thus all the claimed mass identities hold, including the empty and unit-state cases.

DefinitionDefinition: Literature-sourcedProof: Not applicableverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

Comparison and stability for compounds

Definition

Fix a nonempty set X and the compounds of Tagged scalable compounds. A comparison relation ⪯ is defined only for pairs (A,B) with m(A)=m(B). Write A∼B when both A⪯B and B⪯A; this is equivalence, not equality of coefficient functions. The following are explicit hypotheses on ⪯:

  1. Preorder: A⪯A, and A⪯B⪯C implies A⪯C.
  2. Composition consistency: A⪯B implies A+C⪯B+C for every compound C.
  3. Positive scaling: A⪯B implies tA⪯tB for every real t>0.
  4. Splitting and recombination: for x∈X, t>0 and 0<s<t, the one-state compound tex is equivalent to sex+(t−s)ex.
  5. Stability: for equal-mass A,B, fixed positive compounds Z0,Z1 with m(Z0)=m(Z1), and a sequence ϵn>0 decreasing to 0, if A+ϵnZ0⪯B+ϵnZ1 for every n, then A⪯B.
  6. Comparison hypothesis (CH): for every equal-mass pair A,B, either A⪯B or B⪯A (or both).

These are mathematical assumptions, not conclusions about a physical system. No antisymmetry, continuity, convexity, or strict comparison is included. Strict comparison means A⪯B and not B⪯A.

Remarks

In the stability clause, a sequence ϵn is a function N→R; “decreasing to 0” means ϵm≤ϵn whenever n≤m and ϵn→0 in the sense of Limits and Cauchy sequences of reals. The separate requirement ϵn>0 is stated in the clause.

DefinitionDefinition: Literature-sourcedProof: Not applicableverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

Signed comparison of finite coefficient maps

Definition

Let u,v:X→R be finite-support real coefficient maps with equal total coefficient ∑xu(x)=∑xv(x). These signed maps are formal comparison notation, not compounds. Put d:=v−u and define d+(x):=max⁡{d(x),0} and d−(x):=max⁡{−d(x),0}. Then d+,d− are nonnegative finite-support compounds of equal mass, as verified in Spectator cancellation and signed-order algebra ↗. Define

u⪯sv⟺d−⪯d+,

using the compound comparison relation of Comparison and stability for compounds. Thus positive coefficients of v−u 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.

LemmaStatement: Literature-sourcedProof: AI-adaptedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

Reciprocals of the positive integers decrease to zero

Statement

In the complete ordered field R, the sequence ϵn:=1/(n+1), n∈N, is positive, strictly decreasing, and converges to zero.

Facts & Assumptions

[F1]

Complete ordered field (least-upper-bound property): every nonempty subset of an ordered field that is bounded above has a least upper bound.

[F2]

The natural numbers N (von Neumann), Addition of natural numbers, Addition is commutative, Left identity for addition, and Order on the natural numbers: N is the von Neumann set of naturals, its successor is σ(n)=n+1, and m≤n means m+k=n for some k∈N. Since 1+n=n+1=σ(n), every successor is at least 1. Natural indices remain in N; in field expressions the successor is carried into R by the canonical natural map of The canonical natural ι(n)=n⋅1F of a field.

[F3]

The canonical natural ι(n)=n⋅1F of a field and Canonical naturals are positive and strictly increasing: write ιN:N→R for the canonical natural map, with ιN(0)=0 and ιN(σ(n))=ιN(n)+1. It is positive on positive naturals and strictly increases there. Thus the displayed denominator n+1 means ιN(σ(n)), not a von Neumann set used as a real number.

[F4]

The unique embedding of ℚ into an ordered field: the rational embedding into R preserves order, so every rational q>0 has positive real image q^. The multiplicative identity is positive, Inverses of positives are positive, and reciprocation reverses order, and Sign rules for products and monotonicity of multiplication supply 1>0, positivity of the inverse of a positive real, and reversal of order by reciprocation on positive reals.

[F5]

Limits and Cauchy sequences of reals: a real sequence converges to 0 when, for every rational q>0, its absolute value is eventually less than q^.

Proof

Given: [F1]–[F5].

1.1F1F2F3F4algebra

The set NR:={ιN(n):n∈N} is nonempty. If it were bounded above, completeness [F1] would give s=sup⁡NR. Since 1>0 by [F4], s−1<s, so s−1 is not an upper bound; choose n∈N with ιN(n)>s−1. By the successor rule in [F3], ιN(σ(n))=ιN(n)+1>s, while σ(n)∈N, contradicting that s is an upper bound. Hence NR is unbounded above.

2.1F2F3F4F5step 1.1algebra∎

For every n∈N, σ(n)=1+n by natural-addition commutativity and the successor rule, so 1≤σ(n) by the definition of natural order; hence ιN(σ(n))>0 by [F3]. The successor recursion gives ιN(σ(σ(n)))=ιN(σ(n))+1>ιN(σ(n)), since 1>0. Reciprocation reverses this strict inequality by [F4], hence 0<ϵn and ϵn+1<ϵn. Now fix rational q>0 and let q^>0 be its real image. By step 1.1 choose N∈N with ιN(σ(N))>1/q^. If n≥N, then σ(N)≤σ(n) by [F2] and Order is compatible with addition, and the increasing-map clause of [F3] gives ιN(σ(n))≥ιN(σ(N)). Therefore 0<ϵn≤1/ιN(σ(N))<q^. This is convergence to zero by [F5].

LemmaStatement: AI-adaptedProof: AI-adaptedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

Spectator cancellation and signed-order algebra

Statement

Under Comparison and stability for compounds, for compounds A,B with m(A)=m(B) and any compound C, A+C⪯B+C if and only if A⪯B. 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

[F1]

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.

[A1]

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.

[F2]

Signed comparison of finite coefficient maps: for equal-total finite signed maps u,v, the signed comparison is defined by comparing (v−u)− with (v−u)+.

[F3]

The canonical natural ι(n)=n⋅1F of a field and Canonical naturals are positive and strictly increasing give the canonical embedding ιN:N→R, whose successor values are positive and are finite sums of 1. Reciprocals of the positive integers decrease to zero gives the real sequence ϵk=1/ιN(σ(k))>0, k∈N, with ϵk→0.

Proof

Given: [F1], [A1], [F2], and [F3].

1.1F1F2

For equal-total u,v, d=v−u has finite support and total sum zero. Pointwise d=d+−d−, so finite-sum linearity gives m(d+)−m(d−)=0; both maps are finite-support and nonnegative. Thus the definition in [F2] compares equal-mass compounds. If u,v are nonnegative, set k(x)=min⁡{u(x),v(x)}; then u=k+(v−u)− and v=k+(v−u)+.

1.2A1F1F3algebrainduction

Suppose A+C⪯B+C and m(C)>0. For each k∈N, set n=σ(k) and r=ιN(n)>0, and write A/r=(1/r)A. The embedding's successor rule and finite induction show that the sum of n copies of A/r is r(A/r)=A, and likewise for B. Scaling the given comparison by 1/r gives A/r+C/r⪯B/r+C/r. By composition consistency, replace the n copies of A/r one at a time by B/r, keeping the already replaced copies, the remaining copies, and C/r as spectators; after these finitely many replacements, A+ϵkC⪯B+ϵkC. This holds for every natural index k. By [F3], ϵk>0 and ϵk→0, so stability with Z0=Z1=C gives A⪯B. If m(C)=0, nonnegativity implies C=0 and the conclusion is the premise itself. Conversely, A⪯B gives A+C⪯B+C by consistency.

2.1F2step 1.1step 1.2

For nonnegative u,v, step 1.1 gives u=k+(v−u)− and v=k+(v−u)+. Cancellation from step 1.2 shows u⪯v exactly when (v−u)−⪯(v−u)+, which is u⪯sv. For general signed maps, adding a common map leaves v−u unchanged, so it leaves signed comparison unchanged.

3.1A1F2step 1.2∎

If u⪯sv and v⪯sw, consistency gives N⪯P, where N:=(v−u)−+(w−v)− and P:=(v−u)++(w−v)+. Pointwise P−N=w−u. Set K(x):=min⁡{P(x),N(x)}. If P(x)≥N(x) then P(x)−K(x)=(w−u)+(x) and N(x)−K(x)=(w−u)−(x); if P(x)<N(x) the same identities follow with the two sides exchanged. Thus P=K+(w−u)+ and N=K+(w−u)−, with all four maps finite-support and nonnegative. Cancellation from step 1.2 gives (w−u)−⪯(w−u)+, hence u⪯sw. 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 0⪯0.

LemmaStatement: Literature-sourcedProof: AI-adaptedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

Ordering the two-state reference mixtures

Statement

Let x0,x1∈X satisfy x0⪯x1 and not x1⪯x0. For every real λ, define the signed unit-mass reference map Rλ:=(1−λ)ex0+λex1. For all λ,μ∈R,

Rλ⪯sRμ⟺λ≤μ.

The parameters need not lie in [0,1]; outside that interval Rλ is signed notation, not a compound.

Facts & Assumptions

[A1]

Comparison and stability for compounds: the relation is reflexive, positively scale-invariant, and the reference states have the stated one-way comparison.

[F1]

Signed comparison of finite coefficient maps: signed comparison is determined by the positive and negative parts of the coefficient difference.

[F2]

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].

1.1F1F2algebra

Put δ:=μ−λ. The coefficient difference is Rμ−Rλ=δ(ex1−ex0) and has total zero. If δ>0, its negative and positive parts are δex0 and δex1; if δ<0, they are (−δ)ex1 and (−δ)ex0; if δ=0, both are zero.

1.2A1F1algebra

If δ=0, reflexivity gives Rλ⪯sRμ. If δ>0, [F1] reduces this comparison to δex0⪯δex1, which follows by positive scaling of x0⪯x1 by δ. Hence λ<μ implies Rλ⪯sRμ.

2.1A1F1step 1.1step 1.2algebra∎

If δ<0 and Rλ⪯sRμ, [F1] gives cex1⪯cex0 for c:=−δ>0. In the ordered real field, c−1>0: c−1≠0, and if −c−1>0 then closure of the positive cone under multiplication gives c(−c−1)=−1>0. But 1>0: since 1≠0, trichotomy gives either 1>0 or −1>0; the latter would, by positive-product closure, also give (−1)2=1>0, contradicting trichotomy. Thus −1>0 is impossible, and so c−1>0. Positive scaling by c−1 therefore implies x1⪯x0, contrary to [A1]. Thus this comparison fails when λ>μ. The three cases prove the equivalence.

LemmaStatement: Literature-sourcedProof: AI-adaptedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

Reference entropy supremum is finite and attained

Statement

Assume Comparison and stability for compounds on compounds over a nonempty state set X, a strict reference pair x0⪯x1 with not x1⪯x0, and the complete ordered field R. For x∈X define

Lx:={λ∈R:Rλ⪯sex}.

Then Lx is nonempty, bounded above, and downward closed. Its supremum S(x):=sup⁡Lx is a real number and satisfies RS(x)∼sex. Stability is used to prove attainment; no continuity of states or order is assumed.

Facts & Assumptions

[A1]

Comparison and stability for compounds: equal-mass compounds form a preorder with consistency, positive scaling, stability for fixed positive spectators, and CH.

[F1]

Tagged scalable compounds and Compound mass is well-defined and additive: ex has mass one, compound masses are finite sums, and composition/scaling preserve the stated masses.

[F2]

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 u, write u+(y):=max⁡{u(y),0} and u−(y):=max⁡{−u(y),0} pointwise; these are finite-support nonnegative maps with u+u−=u+, and this notation extends the positive and negative parts used in Signed comparison of finite coefficient maps to each signed reference map Rλ itself.

[F3]

Ordering the two-state reference mixtures: Rλ⪯sRμ exactly when λ≤μ.

[F4]

Reciprocals of the positive integers decrease to zero: for n∈N, ϵn:=1/qn with qn:=ιN(σ(n)) is positive, strictly decreasing, and converges to zero. Its canonical-natural convention gives ιN(n)≥0 and qn=ιN(n)+1≥1; natural indices and their real images are distinguished.

[F5]

Complete ordered field (least-upper-bound property): every nonempty bounded-above subset of R has a supremum.

Proof

Given: [A1]–[F5], with x∈X fixed.

1.1A1F1F2F4

Write qn:=ιN(σ(n))>0, so ϵn=1/qn by [F4]. Suppose no n∈N satisfies (qn+1)ex0⪯qnex1+ex. Both sides have mass qn+1, so CH gives qnex1+ex⪯(qn+1)ex0. Scale by 1/qn=ϵn to obtain ex1+ϵnex⪯ex0+ϵnex0. Apply stability to the sequence ϵn, with bases ex1,ex0 and positive unit-mass spectators ex,ex0. It yields x1⪯x0, contradicting strictness. Thus some n has (qn+1)ex0⪯qnex1+ex, which by signed translation and cancellation in [F2] is R−qn⪯sex; hence −qn∈Lx.

1.2A1F1F2F3F4

Suppose Lx is unbounded above. For each n∈N, unboundedness supplies λ∈Lx with λ>qn; [F3] gives Rqn⪯sRλ, and transitivity gives qn∈Lx. Since qn≥1 by [F4], adding the common compound qnex0 to Rqn and ex makes them ex0+qnex1 and ex+qnex0. Thus [F2] identifies Rqn⪯sex with the compound comparison between those maps. Scaling by ϵn=1/qn gives ex1+ϵnex0⪯ex0+ϵnex. Stability with bases ex1,ex0 and positive unit-mass spectators ex0,ex now yields x1⪯x0, again a contradiction. Therefore Lx is bounded above.

2.1A1F2F3F5step 1.1step 1.2

If λ∈Lx and μ≤λ, [F3] gives Rμ⪯sRλ; signed transitivity and Rλ⪯sex imply μ∈Lx. Thus Lx is downward closed. By steps 1.1 and 1.2 it is nonempty and bounded above, so [F5] supplies the real number s:=sup⁡Lx.

3.1A1F1F2F4step 2.1

For each n∈N, s−ϵn is not an upper bound of Lx, so some λ∈Lx has λ>s−ϵn. Downward closure gives s−ϵn∈Lx. Consistency then gives Rs+ϵnex0⪯sex+ϵnex1, because Rs−ϵn+ϵnex1=Rs+ϵnex0. Let K:=Rs−. Adding the fixed nonnegative map K to both sides converts this signed comparison into the compound comparison Rs++ϵnex0⪯ex+K+ϵnex1. Their bases have equal mass because m(Rs+)−m(K)=1=m(ex). Stability with positive unit-mass spectators ex0,ex1 yields Rs+⪯ex+K, that is, Rs⪯sex.

4.1A1F1F2F4step 2.1step 3.1∎

Since s is an upper bound, s+ϵn∉Lx for every n∈N. To derive the reverse signed comparison from CH, set Hn:=Rs+ϵn−. The translated maps ex+Hn and Rs+ϵn+Hn=Rs+ϵn+ are nonnegative compounds. Since Rs+ϵn=Rs+ϵn+−Hn has total coefficient one, finite-sum linearity gives m(Rs+ϵn+)−m(Hn)=1; with m(ex)=1, the translated compounds have equal mass 1+m(Hn). CH applies to this pair. If it gave Rs+ϵn+⪯ex+Hn, signed translation invariance in [F2] would imply Rs+ϵn⪯sex, contrary to s+ϵn∉Lx. Therefore it gives ex+Hn⪯Rs+ϵn+, which by [F2] is ex⪯sRs+ϵn. Add ϵnex0 to both signed maps and use Rs+ϵn+ϵnex0=Rs+ϵnex1. Then add K=Rs− to both; the resulting equal-mass compound comparison is ex+K+ϵnex0⪯Rs++ϵnex1. Stability with bases ex+K,Rs+ and positive unit-mass spectators ex0,ex1 gives ex+K⪯Rs+, or ex⪯sRs. Together with step 3.1 this proves Rs∼sex and the claimed attainment.

TheoremStatement: Literature-sourcedProof: AI-adaptedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

Additive extensive representation of compound comparison

Statement

Let X be nonempty and suppose its finite-support compounds carry the comparison structure of Comparison and stability for compounds over the complete ordered field R. If there are x0,x1∈X with x0⪯x1 and not x1⪯x0, define S(x):=sup⁡Lx using Reference entropy supremum is finite and attained. Then S:X→R is normalized by S(x0)=0, S(x1)=1, and for all equal-mass compounds A=∑iaiexi and B=∑jbjeyj,

A⪯B⟺∑iaiS(xi)≤∑jbjS(yj).

Thus S 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

[A1]

Comparison and stability for compounds: equal-mass compounds satisfy the preorder, consistency, scaling, stability and comparison hypotheses; the state set is nonempty.

[F1]

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.

[F2]

Reference entropy supremum is finite and attained: in the strict-reference case, each S(x)=sup⁡Lx is finite and x∼sRS(x).

[F3]

Ordering the two-state reference mixtures: Rλ⪯sRμ iff λ≤μ for the chosen strict reference pair.

[F4]

Tagged scalable compounds and Compound mass is well-defined and additive: each state denotes its unit-mass point compound ex; every compound is the finite sum of its strictly positive support coefficients, or the empty sum. Nonnegative scaling is pointwise, 0C=0, and a nonnegative compound has zero mass exactly when it is empty.

Proof

Given: [A1] and [F1]–[F4].

1.1F2F3

In the strict-reference case, [F3] gives Rλ⪯sex0 exactly for λ≤0, and Rλ⪯sex1 exactly for λ≤1. Their suprema are therefore S(x0)=0 and S(x1)=1.

1.2A1F1F2F4algebra

Let C=∑iaiexi have mass M and set qC:=∑iaiS(xi). Discard any zero terms in this presentation using [F4]. If the support is empty, C=0, M=qC=0 and CR=0, so signed reflexivity gives the claimed equivalence. Otherwise each remaining coefficient is strictly positive. For each remaining constituent, [F2] gives exi∼sRS(xi); positive scaling and finite repeated use of composition combine these into C∼sCR, where CR:=∑iaiRS(xi)=(M−qC)ex0+qCex1. This calculation is valid for signed coefficients because the signed relation is additive and translation-invariant by [F1].

2.1A1F1F3step 1.2

Apply step 1.2 to both A and B, and write qA,qB for the resulting scalar sums. Since A∼sAR and B∼sBR, transitivity gives A⪯B exactly when AR⪯sBR. Their masses agree, and BR−AR=(qB−qA)(ex1−ex0); [F3] therefore gives AR⪯sBR exactly when qA≤qB. This proves the representation formula.

3.1A1F1F4algebra∎

In the no-strict-pair case, take any x,y∈X. By [F4] their unit compounds have equal mass one, so CH gives one of x⪯y or y⪯x; if exactly one held it would be a strict pair, so both hold. Fix r∈X. Let C have mass M. If M=0, [F4] gives C=0, and reflexivity handles this empty compound without applying the positive-scaling axiom at zero. If M>0, use the canonical finite decomposition over the support from [F4]; every coefficient there is positive. Scale each constituent equivalence ex∼er by its positive coefficient and compose the finitely many comparisons to obtain C∼Mer. Thus equal-mass A,B are both empty when their common mass is zero, and otherwise each is equivalent to the same Mer; hence they are equivalent in both cases. For a constant S(x)=c, both compound values equal cM, including zero for empty compounds, so the representation equivalence holds.

TheoremStatement: Literature-sourcedProof: AI-adaptedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

Uniqueness up to a positive affine transformation

Statement

Assume the strict-reference hypotheses and let S be the normalized representation from Additive extensive representation of compound comparison. Let T:X→R be another additive extensive representation of the same comparisons: for every finite compound C=∑iciexi define T(C):=∑iciT(xi), and require C⪯D iff T(C)≤T(D) whenever m(C)=m(D). Then there are unique a>0 and b∈R such that T(x)=aS(x)+b for every x∈X. Conversely every such positive affine change represents the same comparisons.

Facts & Assumptions

[F1]

Additive extensive representation of compound comparison: x∼sRS(x) for every x, with S(x0)=0 and S(x1)=1.

[F2]

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.

[A1]

Comparison and stability for compounds: the chosen pair satisfies x0⪯x1 and not x1⪯x0.

Proof

Given: [F1], [F2], and [A1].

1.1F1F2algebra

Fix x∈X and put s=S(x). The equivalence x∼sRs in [F1] says that the positive and negative parts of their coefficient difference compare in both directions. Since T represents the same order, their finite T-sums are equal. By its definition on finite compounds and linearity of finite sums, the signed value of Rs is (1−s)T(x0)+sT(x1), including when s∉[0,1]. Thus T(x)=T(x0)+[T(x1)−T(x0)]S(x).

2.1A1F1step 1.1algebra∎

Because x0⪯x1 but not conversely, the exact representation property of T gives T(x0)<T(x1). Hence a:=T(x1)−T(x0)>0 and b:=T(x0) give the asserted form. Conversely, multiplying both sides of any represented-value inequality by a>0 and adding the same b times the common compound mass preserves and reflects its order; therefore aS+b represents the same comparisons. The parameters are unique by evaluating at x0 and x1, where S equals 0 and 1.

TheoremStatement: Literature-sourcedProof: AI-adaptedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

Finite-family calibration by a common meter

Statement

Let I be a finite nonempty set of system types, Xi a nonempty state set with chosen reference ri∈Xi for each i∈I, and M a common meter state set with distinct z0,z1∈M. For each i, let ⪯i be a comparison relation on equal-mass compounds over the Cartesian product Xi×M (The Cartesian product A×B:={ z∈P(P(A∪B)):∃a∈A ∃b∈B z=(a,b) }), 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 ⪯s,i for the signed comparison supplied by Signed comparison of finite coefficient maps, and ∼s,i for mutual signed comparison. Assume (ri,z0)⪯i(ri,z1) and not (ri,z1)⪯i(ri,z0). Let Si be the normalized representation supplied by Additive extensive representation of compound comparison for this product comparison, and put σi(x):=Si(x,z0). In the product comparison, the unit product-state point mass satisfies

e(x,z0)∼s,i(1−σi(x))e(ri,z0)+σi(x)e(ri,z1),

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 Y be a set of raw tags containing three pairwise disjoint families {ai,x:i∈I, x∈Xi}, {ρi:i∈I}, and {ζ0,ζ1}, with ζ0≠ζ1. Compounds over Y are finite-support nonnegative coefficient maps as in Tagged scalable compounds. Let ⪯Y be a relation on equal-mass compounds over Y satisfying all six hypotheses of Comparison and stability for compounds; write ⪯s,Y for its signed comparison from Signed comparison of finite coefficient maps and ∼s,Y for mutual signed comparison. The common relation is a separate relation from each product comparison ⪯i.

Let eρi and eζj be the unit point-mass compounds on their indicated raw tags, and define ui,x:=eai,x+eζ0. Thus ui,x is an explicit mass-two state-and-fixed-meter compound, not a unit tag. Require the exact signed substitution

ui,x∼s,Yeρi+(1−σi(x))eζ0+σi(x)eζ1(i∈I, x∈Xi),

and require the common meter point masses to satisfy eζ0⪯Yeζ1 and not eζ1⪯Yeζ0. Both sides of each substitution have total coefficient two, even when σi(x) lies outside [0,1]. 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 tik on a finite collection of type-i states xik, define Ti:=∑ktik and T:=∑iTi. Put C0:=∑i,ktikeai,xik and C:=∑i,ktikui,xik=C0+Teζ0. Thus C0 is the state compound of mass T and C is its fixed-meter encoding of mass 2T. Empty collections give T=0 and C0=C=0. Define

Σ(C):=∑i∈I∑ktikσi(xik).

For two such compounds C,D with the same type-total vector (Ti)i∈I, the common comparison satisfies C⪯YD exactly when Σ(C)≤Σ(D). Equivalently, the same order criterion holds for the state compounds C0,D0 after canceling their common Teζ0. The index family is finite; no arbitrary-index choice or infinite decomposition is asserted.

Facts & Assumptions

[A1]

The common-meter compatibility assumptions in the Statement: the relation ⪯Y is defined on equal-mass compounds over Y, satisfies all six comparison hypotheses, each exact signed substitution holds, and the common meter pair is strict.

[F1]

Additive extensive representation of compound comparison supplies the real normalized product representation for each ⪯i, and Reference entropy supremum is finite and attained supplies e(x,z0)∼s,i(1−σi(x))e(ri,z0)+σi(x)e(ri,z1) in that product comparison. The separate mass-two substitution on Y is exactly [A1], not an identification of product and shared tags.

[F2]

Spectator cancellation and signed-order algebra: on the common relation ⪯Y, 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.

[F3]

Ordering the two-state reference mixtures: applied to the common relation ⪯Y and its strict meter pair, comparison of equal-mass reference expressions is exactly comparison of their ζ1 coefficients.

Proof

Given: [A1] and [F1]–[F3].

1.1A1F1F2algebra

For each constituent (i,xik,z0) of C, its mass-two shared compound ui,xik is equivalent under ∼s,Y by [A1] to eρi+(1−σi(xik))eζ0+σi(xik)eζ1. Each side has total coefficient two, so the signed substitution is defined. Scale by tik>0 and combine the finitely many comparisons using the comparison axioms and [F2]. The resulting reference-system part is ∑iTieρi, independent of the chosen states. The meter part has coefficients T−Σ(C) on eζ0 and Σ(C) on eζ1, where T:=∑iTi. Hence C is equivalent under ∼s,Y to that fixed reference-system compound plus (T−Σ(C))eζ0+Σ(C)eζ1, whose total coefficient is T+T=2T. If the collection is empty, both expressions are zero and the equivalence is reflexivity, requiring no order scaling at zero.

2.1A1F2F3step 1.1algebra∎

The same substitution for D gives the same reference-system compound because its type totals agree, and the same total meter mass T. Cancel the common reference-system terms by signed translation and cancellation in [F2]. If T>0, the remaining meter maps have total coefficient T. The reciprocal T−1 is positive: T−1≠0, and if −T−1>0 then positivity of T and closure of the positive cone under multiplication give T(−T−1)=−1>0. But 1>0: since 1≠0, trichotomy gives either 1>0 or −1>0; the latter would, by positive-product closure, also give (−1)2=1>0, contradicting trichotomy. Thus −1>0 is impossible, and so T−1>0. Scaling by T−1 turns the remaining maps into the unit reference maps RΣ(C)/T and RΣ(D)/T on {ζ0,ζ1}. By [F3] these compare exactly when Σ(C)/T≤Σ(D)/T; multiplying both sides by T>0 preserves order, so this is equivalent to Σ(C)≤Σ(D). Scaling back by T proves the comparison equivalence, so no unit-mass reference theorem is applied directly at mass T. Reversing the equivalences proves the converse implication as well. Since C=C0+Teζ0 and D=D0+Teζ0, [F2] also gives C⪯YD exactly when C0⪯YD0; for T=0 all these compounds are empty and the criterion is 0≤0.

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.

TheoremStatement: Literature-sourcedProof: AI-adaptedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

Finite inequality alternative by Fourier–Motzkin elimination

Statement

Let m,n∈N be finite, let cj∈Rn and hj∈R for 0≤j<m, where Rn is the function space on {0,…,n−1} with coordinatewise operations as in The vector space FX of all functions X→F with pointwise operations, and Fn as the case X=n={0,1,…,n−1}. For c,b∈Rn, define the dot product by c⋅b:=∑k<nc(k)b(k). A finite vector sum is coordinatewise: (∑j<mλjcj)(k):=∑j<mλjcj(k) for each k<n. All sums use Finite sums and finite products, by recursion.

The finite system

cj⋅b≥hj(0≤j<m)

has a solution b∈Rn if and only if every λ∈Rm with λj≥0 and ∑j<mλjcj=0 satisfies ∑j<mλjhj≤0. Dot products and sums are finite. This includes empty rows, empty variables, and an empty inequality family.

Facts & Assumptions

[A1]

The finite row data in the Statement: m,n are nonnegative integers, and each row is (cj,hj) with real coefficients.

[F1]

Complete ordered field (least-upper-bound property) supplies the complete ordered real field; The vector space FX of all functions X→F with pointwise operations, and Fn as the case X=n={0,1,…,n−1} defines Rn as functions on n={0,…,n−1} with pointwise coordinate operations, forming a vector space as in Vector space over a field, including the one-element zero space when n=0. The dot product and finite vector sums are exactly those defined in the Statement.

[F2]

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 R and its pointwise function spaces, these laws justify collecting coordinates and coefficients in finite row combinations.

[F3]

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.

[F4]

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.

[F5]

Every nonzero natural number is a successor: each nonzero natural number n has a predecessor n′ with n=σ(n′).

Proof

Given: [A1]–[F5].

1.1A1F1F2F3algebra

If b solves the system and λj≥0 with ∑jλjcj=0, multiply row j by λj 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], ∑j<mλj(cj⋅b)=(∑j<mλjcj)⋅b=0. Hence 0≥∑j<mλjhj. This proves necessity.

1.2A1F1F4

For sufficiency, prove by induction on n 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 n=0, every row has zero left side; infeasibility means some hj>0, and that single row is the certificate. If m=0, the system is feasible, so this case cannot occur under the induction claim's antecedent.

1.3A1F1F3F5algebra

Let n>0 and assume the alternative for n′ variables, where n=σ(n′)=n′∪{n′} by [F5] and The natural numbers N (von Neumann). For c∈Rn define a∈Rn′ by a(k):=c(k) for k<n′, and put α:=c(n′)∈R; this separates its first n′ coordinates and its last coordinate. Conversely, each u∈Rn′ and t∈R determine the unique b∈Rn with b(k)=u(k) for k<n′ and b(n′)=t. For every row cj, define aj(k):=cj(k) for k<n′ and αj:=cj(n′). Partition the row indices into P={j:αj>0}, N={j:αj<0}, and Z={j:αj=0}. Retain each row (aj,hj) for j∈Z. For every p∈P and q∈N, add the reduced row ((−αq)ap+αpaq,  (−αq)hp+αphq). Every multiplier used is positive, so these row combinations preserve the inequality directions by [F3].

2.1A1F1F2F3F4F5algebra

The reduced system in u∈Rn′ is feasible exactly when the original is, using the coordinate reconstruction in step 1.3. Indeed, a solution (u,t) implies every retained inequality; adding row p multiplied by −αq>0 to row q multiplied by αp>0 cancels t and gives each pair row. Conversely, if u satisfies the reduced system, rows in P impose finitely many lower bounds t≥Lp:=(hp−ap⋅u)/αp, and rows in N impose finitely many upper bounds t≤Uq:=(hq−aq⋅u)/αq. Each pair row is exactly Lp≤Uq. To justify the finite extrema, enumerate any nonempty finite list ℓ0,…,ℓk−1 of lower bounds and define M1=ℓ0; for 1≤j<k, recursively set Mj+1=Mj if Mj≥ℓj, and Mj+1=ℓj otherwise. Totality of the real order makes Mj+1 the larger of Mj and ℓj; induction [F4] shows that Mk is a member of the list and dominates every entry. Thus a finite nonempty list has a maximum. For an upper-bound list v0,…,vℓ−1, define m1=v0 and, for 1≤j<ℓ, set mj+1=mj if mj≤vj, and mj+1=vj otherwise. The same totality and induction argument shows mℓ is a member no greater than any entry, so every finite nonempty list has a minimum. If both P,N are nonempty, these extrema and all pair inequalities give max⁡p∈PLp≤min⁡q∈NUq, so choose t=max⁡p∈PLp. If only lower bounds occur choose their finite maximum; if only upper bounds occur choose their finite minimum; if neither occurs choose t=0. Thus the original system has a solution.

3.1A1F3step 1.2step 1.3step 2.1algebra

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 n′ coordinates and positive combined right side. Lift each retained zero-row multiplier to its original row; lift each pair-row multiplier μpq to coefficients −αqμpq on row p and αpμpq on row q. All lifted coefficients are nonnegative by [F3]. Every pair lift has last coordinate (−αq)αp+αpαq=0; 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.

4.1A1step 1.1step 1.2step 1.3step 2.1step 3.1∎

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.

TheoremStatement: Literature-sourcedProof: AI-adaptedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

Feasibility of finite reaction offsets

Statement

Let A be a finite set of channel labels and r∈N. For each a∈A, take νa∈Rr and da∈R as independently specified real input data; this theorem does not define channel input/output compounds, a calibration map, or a map producing da. In an application, separate model data may specify vectors νain,νaout∈Rr and set νa:=νaout−νain, while a separately supplied real number Δσa may be designated as a channel's calibrated entropy change and da≤Δσa 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 u,v∈Rr, u⋅v:=∑k<ru(k)v(k), and (∑a∈Aλaνa)(k):=∑a∈Aλaνa(k). A multiplier λ∈RA is a function A→R. There exists an offset vector b∈Rr satisfying

b⋅νa+da≥0(a∈A)

if and only if every λ∈RA with λa≥0 and ∑a∈Aλaνa=0 satisfies ∑a∈Aλada≥0. If a separate model supplies for each a a real number Δσa, designated as its transition entropy change, and assumes Δσa≥da, such a vector guarantees Δσa+b⋅νa≥0 for those channels. The criterion is exact for the finite lower-bound inequalities; it does not claim necessity for actual transitions when da is only a loose bound.

Facts & Assumptions

[A1]

The finite vectors νa and reals da are independent input data. No relation between channel input/output compounds, common-meter values, calibrated changes, and da is assumed or constructed here; the transition conclusion is conditional on separate real values Δσa satisfying Δσa≥da.

[F1]

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 cj⋅b≥hj is feasible exactly when every nonnegative zero-left-side multiplier has nonpositive combined right side.

[F2]

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].

1.1A1F1F2algebra

By [F2], choose a natural number m and a bijection ϕ:m→A; when A=∅, take m=0 and the empty bijection. Reindex the data as cj:=νϕ(j) and hj:=−dϕ(j) for j<m. The row system cj⋅b≥hj is exactly the required offset system. By [F1], it is feasible exactly when every nonnegative multiplier family μ∈Rm with ∑j<mμjcj=0 has ∑j<mμjhj≤0. The bijection transports such a family to λa:=μϕ−1(a) on A, preserving nonnegativity and both finite sums by [F2]. Hence this condition is precisely ∑a∈Aλaνa=0⇒∑a∈Aλada≥0. For A=∅, b=0 is feasible and the multiplier condition is vacuous. If r=0 and A is nonempty, every νa=0; testing the coordinate multiplier for each channel makes the criterion equivalent to da≥0 for every a, and then the unique empty vector b satisfies all rows.

2.1A1step 1.1algebra∎

For any channel with actual change Δσa≥da, add b⋅νa to both sides of that bound and use the solved row inequality b⋅νa≥−da. Then Δσa+b⋅νa≥da+b⋅νa≥0. This is a sufficient monotonicity conclusion for the stated channels.

Remarks

For r=0 and nonempty A, the criterion reduces to da≥0 for every channel. Strict increase, infinitely many channels, and lower bounds equal to actual changes are separate conditions and are not inferred here.

DefinitionDefinition: Literature-sourcedProof: Not applicableverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

Type-offset quotient vector space

Definition

Let G be a set of formal type labels closed under the formal operations (Γ,Γ′)↦Γ×Γ′ and (t,Γ)↦tΓ for every real t>0. Let F:=R(G) be the vector space of finite-support real functions on G, and let eΓ be the function equal to 1 at Γ and 0 elsewhere.

Form the set of relation vectors

R:={eΓ×Γ′−eΓ−eΓ′:Γ,Γ′∈G}∪{etΓ−teΓ:t>0,Γ∈G}.

Following Linear combination of a finite list, and the span span⁡(S) as the smallest linear subspace containing S, let N consist of exactly the vectors ∑i<nairi for n∈N, scalar lists a:n→R and vector lists r:n→R. The sum is computed in the additive group of F, starting with s0=0 and recursively setting si+1=si+airi for i<n; its value is sn. In particular, the empty list contributes 0∈N. Define the type-offset vector space

VG:=F/N.

The class of c∈F is [c]. The defining relations are [eΓ×Γ′]=[eΓ]+[eΓ′] and [etΓ]=t[eΓ]. 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 VG.

LemmaStatement: Literature-sourcedProof: AI-adaptedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

Type-offset quotient is a real vector space

Statement

For the construction in Type-offset quotient vector space, F and N are sets, F is a real vector space, N is a linear subspace of F, and F/N has representative-independent vector operations making it a real vector space. Its displayed product and positive-scaling relations hold in the quotient.

Facts & Assumptions

[F1]

Type-offset quotient vector space: G is a set closed under product and positive scaling; F consists of finite-support functions; N is the set of finite linear combinations of the stated relation vectors.

[F3]

Linear subspace of a vector space: a nonempty subset closed under addition and scalar multiplication is a linear subspace with inherited operations.

Proof

Given: [F1]–[F4].

1.1F1F2F3F4

The set of all functions G→R exists and is a vector space by [F2]. Separation [F4] selects the functions whose support is finite, so F is a set. It contains zero; if c,d∈F, then supp⁡(c+d)⊆supp⁡(c)∪supp⁡(d), a finite union, and supp⁡(tc)⊆supp⁡(c) for every scalar t. Thus F is a linear subspace of the function space by [F3], hence a real vector space.

1.2F1F2F4

The index sets G×G and R>0×G exist by [F4]. Replacement applied to the two displayed relation maps in [F1] gives the set R; each relation vector has support of size at most three and lies in F. The family of finite subsets of R 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 N⊆F of all finite linear combinations.

2.1F1F3step 1.2

The zero vector is in N as the empty sum. If u,v∈N, 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 t∈R, tu is obtained by multiplying every coefficient by t. Hence N is closed under addition and scalar multiplication and is a linear subspace of F by [F3].

3.1F1F4step 2.1

Define c∼d on F exactly when c−d∈N. Since 0∈N, N is closed under negatives (take scalar −1), and under addition, this relation is reflexive, symmetric and transitive. Each class [c]={d∈F:d−c∈N} is a subset of F by separation; replacement on the set F gives the quotient set of these classes.

4.1F1F2step 2.1step 3.1∎

If c∼c′ and d∼d′, then (c+d)−(c′+d′)=(c−c′)+(d−d′)∈N; and for any scalar t, tc−tc′=t(c−c′)∈N. Therefore [c]+[d]:=[c+d] and t[c]:=[tc] do not depend on representatives. The quotient map c↦[c] preserves zero, addition and scalar multiplication; applying it to each vector-space identity in F proves all vector-space axioms in F/N. Every generator in R lies in N, so its class is zero and the two displayed relations hold.

TheoremStatement: Literature-sourcedProof: AI-adaptedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

Infinite-valued no-sinks Hahn–Banach sandwich and conditional offsets

Statement

Assume the Axiom of Choice. Let V be a real vector space and p:V→R∪{+∞} satisfy p(0)=0, p(tx)=tp(x) for every t>0, and p(x+y)≤p(x)+p(y) in extended-real arithmetic. Assume no sinks: p(x)<+∞ if and only if p(−x)<+∞. Put W:={x∈V:p(x)<+∞}. Then W is a linear subspace and there exists a real-linear L:V→R such that

−p(−x)≤L(x)≤p(x)(x∈V),

with −∞≤r≤+∞ interpreted in the usual extended order. The result is valid in arbitrary dimension and allows p=+∞ outside W.

For the conditional offset application, let V=VG from Type-offset quotient vector space, let F:G×G→R∪{+∞} satisfy p([eΓ]−[eΓ′])=F(Γ,Γ′), and define B(Γ):=L([eΓ]). Then B(Γ×Γ′)=B(Γ)+B(Γ′), B(tΓ)=tB(Γ) for t>0, and

−F(Γ′,Γ)≤B(Γ)−B(Γ′)≤F(Γ,Γ′).

For each Γ∈G, let XΓ be a state set and σΓ:XΓ→R a baseline state function. If every admitted transition (Γ,x)→(Γ′,y), with x∈XΓ and y∈XΓ′, satisfies σΓ′(y)−σΓ(x)≥F(Γ,Γ′), then σΓ(x)+B(Γ) is nondecreasing across those transitions. The existence or properties of such a cost p, including no-sinks, are hypotheses and are not proved by this theorem.

Facts & Assumptions

[A1]

The Axiom of Choice: adopt the Axiom of Choice for the Hahn–Banach and basis-extension steps.

[F1]

Vector space over a field and Linear subspace of a vector space: V is a real vector space, and a subset closed under addition and all scalar multiples is a linear subspace.

[F2]

A sublinear functional on a real vector space: a real-valued sublinear functional is positively homogeneous and subadditive.

[F3]

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.

[F4]

Complete ordered field (least-upper-bound property): the real field used in the one-step dominated-extension argument has the least-upper-bound property.

[F7]

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.

[F8]

The extended real line R‾=R∪{−∞,+∞}, its order, and the arithmetic that is left undefined: the order and negation on R∪{±∞} are extended as defined there; for values in R∪{+∞}, addition is the real sum when both are real and is +∞ when either is +∞, while multiplication by t>0 sends +∞ to +∞. These cases avoid the undefined extended-real operations listed in that definition.

[F9]

Linear functionals and the algebraic dual V∗=L(V,F): a real-linear functional L:V→R is a linear map, so L(x+y)=L(x)+L(y) and L(tx)=tL(x) for x,y∈V and t∈R.

[F10]

The Axiom Schema of Separation: for each formula φ, ∀pˉ ∀x ∃y ∀z (z∈y↔(z∈x∧φ(z,pˉ))): since p is a function on the set V and +∞ is in the extended-real codomain, Separation forms the subset W={x∈V:p(x)<+∞} as a set.

Proof

Given: [A1]–[F10] and the hypotheses on p.

1.1F1F2F8F10algebra

By [F10], W is a set. It contains 0 because p(0)=0. If x,y∈W, subadditivity gives p(x+y)≤p(x)+p(y)<+∞, so x+y∈W by the extended-real conventions in [F8]. For t>0, homogeneity gives p(tx)=tp(x)<+∞. If t<0, put s:=−t>0; no-sinks gives −x∈W, and positive homogeneity applied to s(−x)=tx puts tx in W. Also 0x=0∈W. Thus W is a linear subspace. The restriction p∣W is finite-valued, positively homogeneous and subadditive, so it is a real-valued sublinear functional.

2.1A1F3F4F8F9step 1.1

Let M={0}⊆W and let f0(0)=0. This is linear and satisfies f0(0)=0=p(0). The real ordered field is complete by [F4], as used in the one-step interval argument of the published theorem. Apply [F3] to p∣W and f0; it gives a linear ℓ:W→R with ℓ(x)≤p(x) for every x∈W. Applying this at −x∈W yields −ℓ(x)=ℓ(−x)≤p(−x), so −p(−x)≤ℓ(x)≤p(x) on W.

3.1A1F5F6F9step 2.1

By [F5], choose a basis BW of W and extend its independent set to a basis BV of V. Assign value ℓ(b) to b∈BW and 0 to b∈BV∖BW. For any v∈V, [F6] gives a finite basis expression; define L(v) as the same finite linear combination of assigned real values. If two expressions represented v, subtracting and collecting equal basis vectors would give a finite zero combination; independence in [F6] forces every collected coefficient to be zero. Thus L(v) is well-defined. Concatenating finite expressions proves additivity and scalar homogeneity, so L is linear in the sense of [F9]; the basis expression of any w∈W uses only BW, so L∣W=ℓ.

4.1F8step 1.1step 2.1step 3.1

For x∈W, step 3.1 and step 2.1 give −p(−x)≤L(x)≤p(x). If x∉W, then p(x)=+∞ by the definition of W; no-sinks implies p(−x)=+∞ as well, so by [F8] the extended bounds reduce to −∞≤L(x)≤+∞. This proves the global sandwich.

5.1F7F9step 4.1algebra∎

In the type-offset application, linearity of L in the sense of [F9] and the quotient relations in [F7] give B(Γ×Γ′)=B(Γ)+B(Γ′) and B(tΓ)=tB(Γ). Apply the sandwich to eΓ−eΓ′ and its negative, using the assumed values of p, to obtain the two displayed bounds for B(Γ)−B(Γ′). For an admitted transition, its real baseline change is at least F(Γ,Γ′), so that cost value must be finite. The corrected change equals [σΓ′(y)−σΓ(x)]+B(Γ′)−B(Γ)=[σΓ′(y)−σΓ(x)]−L(eΓ−eΓ′). The assumed lower bound on the baseline change and the upper sandwich bound L(eΓ−eΓ′)≤F(Γ,Γ′) make this at least F(Γ,Γ′)−F(Γ,Γ′)=0. This proves only the stated conditional monotonicity.

Remarks

The real-valued Hahn–Banach theorem is applied only on the finite domain W; the arbitrary-dimensional extension to V uses a basis and its extension under Choice. When x∉W, 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