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.

Contact calibrators under explicit join coherence

Statement

Let Γ1,Γ2 be simple domains in a family of finite thermal joins satisfying A1–A7, S1–S3, T1–T5, and C1 of Forward-sector hypotheses for a simple state domain and Thermal joins and conditional contact hypotheses. Then there are x0≺≺x1 in Γ1 and y0≺≺y1 in Γ2 such that

(x0,y1)∼(x1,y0).

Moreover, for every fixed finite composition of scaled copies of Γ1 and Γ2, any two equal-mass states of that same composition are comparable (CH). The conclusion is conditional on the explicitly stated join-coherence and universal-range assumptions C1 and T5.

Facts & Assumptions

Given: The forward-sector and contact hypotheses for the whole join-closed family.

[A1]

Forward-sector hypotheses for a simple state domain: A1–A7 and S1–S3 hold on each member of the family, including finite joins.

[A2]

Thermal joins and conditional contact hypotheses: T1–T5 hold for every ordered pair in the family, and C1 makes an equilibrated joined state thermally equivalent to each equilibrium constituent.

[F1]

Reference-strip gluing proves comparison for scaled copies: CH holds on every finite scaled product of copies of any simple type in the family.

[F2]

Additive extensive representation of compound comparison: under that CH, each simple type and its scaled products have an additive extensive entropy representing accessibility.

[F3]

Thermal classes either fill the domain or split an adiabat: for each simple join, either every pair of its states is thermally equivalent or one of its adiabats contains two thermally inequivalent states.

[F4]

Nesting and comparison of simple-system states and Forward orientation and the Lipschitz boundary graph: a common adiabat has identical forward sectors; fixed-work accessibility is ordered by energy, and each component adiabat has one state at each work coordinate in its projection.

[F5]

Spectator cancellation without comparison completeness and Signed comparison for forward-sector relations: signed equivalence is preserved by finite addition and cancellation of common spectators.

[F8]

Thermal joins force a common mathematical energy orientation: T1–T2 and arbitrary-spectator cancellation force a common mathematical energy orientation; the common affine change preserves the join energy-sum rule.

Proof

Given: [A1]–[A2], [F1]–[F5], and [F8].

1.1A1F1F2F4F8

Work in [F8]'s common affine mathematical energy orientation, without redefining any physical energy or calibration. Apply [F1] and [F2] to each simple type, including every finite join, using the positive normalization by its fixed weight in [A1]. Throughout, entropy at a state means its represented-state value: wΓ times its unit-point-mass representation. This normalization preserves order and finite scalar amounts. The convex-combination access hypothesis in [A1] makes each resulting entropy concave, since the comparison of a scaled pair with its convex-combination state translates under the representation to the concavity inequality. By [F4], each entropy is strictly increasing with energy at fixed work coordinates.

1.2A2F4choose

Use T5 to choose xˉ∈Γ1 and yˉ∈Γ2 with xˉ∼Tyˉ. Let ϕ=J12(xˉ,yˉ) and consider its adiabat ∂Aϕ. T2 gives every Z on that adiabat at least one split Z=J12(xZ,yZ) with xZ∼TyZ.

2.1A2F4step 1.2choose

Suppose a join state Z on ∂Aϕ has two distinct equilibrium splits (x(1),y(1)) and (x(2),y(2)). By the definition of ∼T, both pairs are reversible with Z, hence mutually accessible compounds. Their work coordinates are fixed by Z and their total energies equal its energy. If the first-component energies agreed, both component states in the splits would agree, so distinctness forces unequal first-component energies. If ux(1)<ux(2), fixed-work comparison [F4] gives x(1)≺≺x(2); conservation of total energy gives uy(2)<uy(1), hence y(2)≺≺y(1). Taking (x0,x1,y0,y1)=(x(1),x(2),y(2),y(1)) gives (x0,y1)∼(x1,y0) because both split compounds are reversible with Z. If the first energies occur in the opposite order, swap the two splits and obtain the same calibrator form. Therefore, if no calibrator exists, every Z∈∂Aϕ has a unique equilibrium split.

3.1A1A2F1F4F5step 1.2step 2.1algebra

Assume no calibrator exists. For any equilibrium split (xZ,yZ) of Z∈∂Aϕ, reversibility with Z and the common adiabat give (xZ,yZ)∼(xˉ,yˉ) as compounds. By [F1], xZ and xˉ are comparable; [F4] says their sectors coincide exactly when they are equivalent. If xZ≺≺xˉ, pair reversibility gives (xˉ,yˉ)≺(xZ,yZ). Consistency adds yˉ to xZ≺xˉ, and cancellation [F5] gives yˉ≺yZ. If yZ≺yˉ, consistency and the pair comparison instead cancel to give xˉ≺xZ, a contradiction. Thus yˉ≺≺yZ, making a calibrator. The case xˉ≺≺xZ is symmetric: it gives yZ≺≺yˉ, again a calibrator. Since neither is allowed under the assumption, xZ∼xˉ. Adding spectators to the two directions and cancelling by [F5] then gives both yˉ≺yZ and yZ≺yˉ, so yZ∼yˉ. Thus every split on this adiabat has components in the corresponding component adiabats.

4.1A2F4step 3.1

Under the no-calibrator assumption, fix a first-component work coordinate v1 in the projection of ∂Axˉ. The boundary-graph result [F4] gives exactly one state x∗ on that component adiabat at v1. Every split of a join state on ∂Aϕ with first work coordinate v1 therefore has first component x∗. Each split is thermal, so x∗∼TyZ for its second component. T3 makes all such yZ thermally equivalent, and C1 makes each joined state J(x∗,yZ)=Z thermally equivalent to x∗. Hence all join states on this adiabat over fixed v1 lie in one thermal class. Fixing a second-component work coordinate instead gives the corresponding conclusion for first components.

5.1A2F4step 4.1construct

Let Ω be the open connected work-coordinate projection of ∂Aϕ from [F4]. From any point of Ω, the set reachable by finitely many coordinate-axis segments contained in open boxes in Ω is relatively open, and its complement is also relatively open; connectedness makes the reachable set all of Ω. Along each such segment, step 4.1 gives equivalence of the corresponding join states; T3 composes these finitely many equivalences. Thus the whole adiabat ∂Aϕ is one thermal class. Since the argument works for every starting join state, every join adiabat is one thermal class.

6.1A2F3step 1.2step 2.1step 5.1choose

Still assuming no calibrator, apply [F3] to each join system. Its alternative with two thermally inequivalent states on one adiabat is excluded by step 5.1, so all states of each join system are thermally equivalent. For any x,x′∈Γ1, use T5 with one allowed second work coordinate to choose y,y′ with x∼Ty and x′∼Ty′. C1 relates each component to its joined state, and all join states are in one thermal class; T3 therefore gives x∼Tx′. The same argument gives one thermal class in Γ2. Now take Z=ϕ∈∂Aϕ and a split (x,y) supplied by T2. Choose nonzero sufficiently small δ so (ux+δ,v1)∈Γ1 and (uy−δ,v2)∈Γ2, possible because the domains are open. These states form a distinct split of the same Z. Since the original split has x∼Ty and each component type is one thermal class, T3 gives thermal equivalence of the changed pair as well. This contradicts uniqueness of the split from step 2.1. Therefore a calibrator exists.

7.1F2F5step 6.1algebra

Fix a calibrator x0≺≺x1, y0≺≺y1, whose existence is step 6.1. Choose same-type entropy representatives S1,S2 from [F2], with positive gaps h1=S1(x1)−S1(x0) and h2=S2(y1)−S2(y0). Normalize S~i=Si/hi, so both calibrator increments are one, and put s(x)=S~1(x)−S~1(x0) and t(y)=S~2(y)−S~2(y0). Write u=J(x0)+J(y1) and v=J(x1)+J(y0). The calibrator says u∼v, so v−u=(J(x1)−J(x0))−(J(y1)−J(y0)) is equivalent to zero; translation and cancellation [F5] give (J(x1)−J(x0))∼s(J(y1)−J(y0)). For any state x, the signed map dx=J(x)−(1−s(x))J(x0)−s(x)J(x1) has total mass and S~1-value zero. Its positive and negative parts have equal mass and entropy, so [F2] makes them equivalent. Hence J(x)∼s(1−s(x))J(x0)+s(x)J(x1); the same argument applies to states of the second type. These are formal signed maps when a coefficient lies outside [0,1].

8.1A1F2F5step 7.1algebra∎

For a state pair (x,y), put λ=(s(x)+t(y))/2 and δ=(s(x)−t(y))/2. Adding the signed reductions from step 7.1 makes the pair equivalent to (1−λ)(J(x0)+J(y0))+λ(J(x1)+J(y1)) plus δ[(J(x1)−J(x0))−(J(y1)−J(y0))]. The calibrator increment equivalence from step 7.1 makes the latter term equivalent to zero for either sign of δ. Thus each pair reduces to its reference map at parameter λ. For any finite compound A with amounts M1,M2 of the two types, add and scale these single-state reductions. Writing q1(A),q2(A) for the amount-weighted sums of s(x),t(y), respectively, gives A∼s(M1−q1(A))J(x0)+q1(A)J(x1)+(M2−q2(A))J(y0)+q2(A)J(y1). Using (J(x1)−J(x0))∼s(J(y1)−J(y0)), this is equivalent to M1J(x0)+M2J(y0)+Q(A)(J(x1)−J(x0)), where Q(A)=q1(A)+q2(A). If the total mass is zero, both compounds are empty and reflexivity compares them. Otherwise, for same-composition A,B, their base terms agree. If Q(A)<Q(B), the positive and negative parts of the reference-map difference are (Q(B)−Q(A))J(x1) and (Q(B)−Q(A))J(x0), so x0≺x1 and positive scaling compares the maps forward. If the Q values agree the maps coincide; if Q(A)>Q(B) the reverse comparison holds. Translation, addition, and ordinary-order compatibility [F5] transfer the result to A,B. This proves CH for every fixed finite composition of the two types and their scaled copies.

Remarks

The proof uses C1 in steps 4.1 and 6.1 and T5 in steps 1.2 and 6.1. It does not establish the calibrator from the bare set-valued join formula or from T1–T4 alone. All conclusions remain conditional mathematical consequences of the listed hypotheses.

Depends on

Dependency tree · 2 levels

Sources