Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passverified 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.

Catalyst-chain cost characterizes cross-type transitions

Statement

Assume the calibrated entropy family of Calibration of an arbitrary family of simple-system entropies, the cross-type accessibility axioms A1–A6 of Forward-sector hypotheses for a simple state domain, and the decorated cost F of Decorated finite-chain costs with catalysts. For every pair of types Γ,Γ′ with m(Γ)=m(Γ′), and states x∈XΓ, y∈XΓ′,

x≺y⟺σΓ(x)+F(Γ,Γ′)≤σΓ′(y).

The infimum defining F need not be attained. If F=+∞, the right side is false; if F=−∞, the right side is true.

Facts & Assumptions

Given: The complete additive extensive entropy on every finite type, the finite-chain cost, and A1–A6 including stability.

[A1]

Forward-sector hypotheses for a simple state domain: consistency permits running accessible edges with common spectators; stability removes fixed positive spectators whose common scale tends to zero.

[F1]

Calibration of an arbitrary family of simple-system entropies: every type and finite separated product has a finite real additive extensive entropy representing same-composition comparisons; its Statement fixes a strict meter pair z0≺≺z1.

[F2]

Decorated finite-chain costs with catalysts: F is the infimum of the real costs of finite chains with an arbitrary common catalyst.

[F3]

Algebraic properties of decorated-chain costs: every actual decorated-chain witness has a finite real additive cost, and costs have no negative closed cycles.

[F4]

Spectator cancellation without comparison completeness: common finite compound spectators can be cancelled under A1–A6.

[F5]

Reciprocals of the positive integers decrease to zero: with natural index k, the real sequence ϵk=1/ιN(σ(k)) is positive, strictly decreasing and converges to zero; its Facts F2–F3 explicitly interpret the Statement's denominator k+1 as ιN(σ(k)).

Proof

1.1F1F2

If x≺y, the one-edge witness with an identity catalyst has cost σΓ′(y)−σΓ(x). Hence F(Γ,Γ′)≤σΓ′(y)−σΓ(x), which is the forward inequality, including the case F=+∞ where no such transition can exist.

1.2F1F2F3F5choose

Conversely assume the displayed entropy inequality. It is impossible when F=+∞. Fix an arbitrary natural index n∈N, use ϵn from [F5] and choose a decorated witness of real cost cn≤Δσ+hϵn, where Δσ=σΓ′(y)−σΓ(x) and h=σ(z1)−σ(z0)>0 is the entropy gap of a fixed strict meter pair from [F1]. Such witnesses exist from the definition of infimum, also if F=−∞. Write their types as T0=Γ×C,T1,…,TN=Γ′×C, their edges as ak≺bk+1, and their endpoints as a0=(x~,c0), bN=(y~,d0).

2.1A1F1F3F5step 1.2algebra

Put δn=ϵn. In one finite compound type form Ln=(x,bN,b1,…,bN−1,δnz0),Rn=(a0,y,a1,…,aN−1,δnz1). These have the same composition: both contain Γ, Γ′, the catalyst C, every intermediate type T1,…,TN−1, and one scaled meter state, up to reassociation and permutation. Additivity of σ and the definition of chain cost give σ(Rn)−σ(Ln)=Δσ−cn+δnh≥0. Thus the same-composition entropy representation [F1] gives Ln≺Rn.

3.1A1F4step 2.1

Starting from Rn, use consistency on a0≺b1 with y,δnz1,a1,…,aN−1 as spectators. The result contains b1 in place of a0. Next use a1≺b2 with y,δnz1,b1,a2,…,aN−1 as spectators, and continue in order. At stage k, the current compound contains ak, the earlier outputs b1,…,bk, all later inputs ak+1,…,aN−1, and the unchanged y,δnz1. After the last edge, transitivity gives Rn≺Rn′, where Rn′=(b1,…,bN,y,δnz1). Compose this with Ln≺Rn from step 2.1. The compounds Ln and Rn′ share the finite spectator b1+⋯+bN; cancel it by [F4]. The result is x+δnz0≺y+δnz1 for this n. Since n was arbitrary, this comparison holds for every natural index; the chain witnesses need not be chosen simultaneously.

4.1A1F5step 3.1∎

By [F5], δn↓0, stability in [A1] with bases x,y and fixed positive spectators z0,z1 yields x≺y. This proves the reverse implication without assuming that any infimum is attained.

Depends on

Dependency tree · 2 levels

Sources