Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)
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.

No-sinks cost offsets give a weak global entropy

Statement

Assume the Axiom of Choice. Let F be the decorated cost of Decorated finite-chain costs with catalysts, and assume the no-sinks condition

F(Γ,Γ′)<+∞⟺F(Γ′,Γ)<+∞

for every type pair. Let VF be the real difference space of Cost-zero type offsets and their difference space. Then there is an additive extensive offset B:G→R such that

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

If every admitted cross-type transition x≺y from Γ to Γ′ satisfies the calibrated cost inequality of Catalyst-chain cost characterizes cross-type transitions, then σΓ(x)+B(Γ) is nondecreasing across every such transition. Only this weak inequality is asserted; no-gap equalities and strict extensions are not concluded.

Facts & Assumptions

Given: The no-sinks condition, A1–A6 for cross-type transitions, the finite-chain costs, and the Axiom of Choice.

[A1]

The Axiom of Choice: adopt AC for the Hahn–Banach dominated-extension and basis-extension steps in the vector-space supplier.

[F1]

Cost-zero type offsets and their difference space and The cost-zero offset construction is a real vector space: VF is a real vector space of formal type differences, with composition additive and positive scaling homogeneous.

[F2]

Algebraic properties of decorated-chain costs: F(Γ,Γ)=0, F is translation-invariant, positively homogeneous and subadditive, finite reverse witnesses bound forward costs, and costs have no negative cycles.

[F3]

Infinite-valued no-sinks Hahn–Banach sandwich and conditional offsets: under AC, a sublinear p:V→R∪{+∞} with p(0)=0 and symmetric finite domain admits a linear L with −p(−v)≤L(v)≤p(v).

[F4]

Catalyst-chain cost characterizes cross-type transitions: every admitted transition x≺y satisfies σΓ′(y)−σΓ(x)≥F(Γ,Γ′).

Proof

Given: [A1], [F1]–[F4], and the no-sinks condition.

1.1A1F2given

If F(Γ,Γ′)<+∞, no-sinks gives a finite reverse witness of some real cost c. Concatenating it with any forward witness makes a closed chain, so [F2] gives forward cost at least −c. Thus F(Γ,Γ′)>−∞ whenever it is finite; all cost values are in R∪{+∞}.

2.1F1F2step 1.1algebra

For a pair class v=[Γ,Γ′]∈VF, define p(v):=F(Γ,Γ′). Suppose (Γ,Γ′)≡(Λ,Λ′) via C, so P=Γ×Λ′×C≈0Q=Λ×Γ′×C. Put D=Γ′×Λ′×C. Since P≈0Q, the triangle inequality gives F(P,D)≤F(Q,D) and F(Q,D)≤F(P,D); the costs have no −∞ by step 1.1, so these inequalities imply equality. Catalyst invariance from [F2] gives F(P,D)=F(Γ,Γ′) and F(Q,D)=F(Λ,Λ′). Therefore p is independent of the pair representative.

2.2F1F2givenstep 1.1

The identity F(Γ,Γ)=0 gives p(0)=0. Homogeneity of F gives p(tv)=tp(v) for t>0, and its product subadditivity gives p(v+w)≤p(v)+p(w). The no-sinks condition says p(v)<+∞ exactly when p(−v)<+∞. By step 1.1, p has no −∞ value.

3.1A1F1F3step 2.2algebra

Apply [F3] to VF and p. It gives a real-linear L:VF→R with −p(−v)≤L(v)≤p(v) for all v. Put B(Γ)=L([Γ,1]), where 1 is the empty unit type. Since [Γ×Γ′,1]=[Γ,1]+[Γ′,1], B is additive. Since [tΓ,1]=t[Γ,1] (the unit type satisfies t1=1), B(tΓ)=tB(Γ) for t>0. Also [Γ,Γ′]=[Γ,1]−[Γ′,1], so applying the sandwich to this pair gives the displayed two-sided cost bound.

4.1F4step 3.1algebra∎

For an admitted transition, [F4] gives σΓ′(y)−σΓ(x)≥F(Γ,Γ′), while step 3.1 gives B(Γ)−B(Γ′)≤F(Γ,Γ′). Subtracting the latter from the former yields [σΓ′(y)+B(Γ′)]−[σΓ(x)+B(Γ)]≥0. Thus the offset entropy is nondecreasing across every admitted transition.

Remarks

The no-sinks condition is an explicit hypothesis about cross-type reachability. AC is used by Infinite-valued no-sinks Hahn–Banach sandwich and conditional offsets and is carried here. The result does not assert a no-gap condition, a unique offset, or an exact entropy principle for all transitions.

Depends on

Dependency tree · 2 levels

Sources