Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-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.

Forward-sector hypotheses for a simple state domain

Definition

Let P be a set of primitive type labels. A formal type Γ records a finitely supported amount function νΓ:P→R≥0, not identically zero. Primitive generators have their unit amount function. Positive scaling, separated product, and thermal-join constructors retain distinct formal tags and obey

νsΓ=sνΓ,νΓ⊗Γ′=νΓ+νΓ′(s>0).

Separated and joined types are distinct constructors even when their amount functions agree. Permutation, reassociation, and scaled-splitting conventions preserve the amount function. Define the positive bookkeeping weight wΓ:=∑p∈PνΓ(p), a finite sum over support. Thus wsΓ=swΓ and every product or join has weight wΓ+wΓ′. The optional empty unit has zero amount function and weight zero; it is represented only by the empty compound, not as a simple chart. These are formal amounts, not masses in kilograms or an empirical conservation law. The functions and pointwise operations use The vector space FX of all functions X→F with pointwise operations, and Fn as the case X=n={0,1,…,n−1}; their finite-support convention and finite sums are those of Tagged scalable compounds and Compound mass is well-defined and additive.

For Euclidean vectors use a⋅b=∑jajbj and ∥a∥=(a⋅a)1/2. Write B(a,r)={b:∥b−a∥<r}. Open means each point has such a ball contained in the set; convex means (1−t)a+tb belongs to the set for all its a,b and 0≤t≤1. In a subspace or subset, use intersections of these balls for the relative topology. A map P:D→Rn is locally Lipschitz if each a∈D has a relative neighborhood V and finite L≥0 with ∥P(b)−P(c)∥≤L∥b−c∥ for all b,c∈V. A set D is arcwise connected here if each two distinct points are joined by a continuous injective map γ:[0,1]→D with those endpoints; singleton and empty sets satisfy this condition vacuously. Continuity uses the indicated Euclidean relative topology. Let I index the declared family of simple types Γi. For each simple type Γ in that family, let nΓ≥1 and let Γ⊂RnΓ+1 be nonempty, open and convex, with coordinates x=(u,v). The notation for a type and its chart is shared, but each state has a distinct raw tag (Γ,x). Scaled charts are distinct tagged copies sΓ={sx:x∈Γ} with coordinate transport x↦sx; transported raw tags remain distinct from the original raw tags. Let e(Γ,x) be the unit point mass from Tagged scalable compounds. The represented state is

JΓ(x):=wΓe(Γ,x),m(JΓ(x))=wΓ.

Write J(x):=JΓ(x) when x already carries its type tag. All state notation in this framework's compound comparisons, including a bare x, denotes JΓ(x); a raw unit point mass is always written e(Γ,x). A separated pair is addition of represented states, not a unit product tag. Nonnegative multiples are pointwise and zero terms are omitted. For an encoded compound c, its aggregate composition is the finite amount function

ν(c):=∑(Γ,x)∈supp⁡(c)c(Γ,x)wΓνΓ;m(c)=∑p∈Pν(c)(p).

Fix the formal interpretation Π(c) as the finite separated preparation whose factor at each nonzero raw tag (Γ,x) is the amount c(Γ,x)/wΓ of that typed state, using the declared coordinate scaling transport. Let P:={Π(c):c is a finite nonnegative encoded compound} be the set of these preparations, with an invariant bookkeeping mass M:P→R≥0 satisfying M(Π(c))=m(c). As additional model data choose a binary relation Q⊆{(p,q)∈P2:M(p)=M(q)}. Define its pullback on encoded compounds by A≺B if and only if (Π(A),Π(B))∈Q. The transport, reversibility and A1–A7 assumptions below constrain this chosen relation; they do not construct it from coordinates. Merging or splitting repeated copies of the same preparation is reversible; permutation and reassociation preserve the preparation. Thus Π(JsΓ(sx)) and Π(sJΓ(x)) are the same declared scaled preparation and yield

JsΓ(sx)∼sJΓ(x),

although their raw point masses have different tags and are not equal. This reversible transport commutes with finite composition, nested type constructors, and scaled splitting. It is part of the precise formal scaling interpretation, not a deduction about physical accessibility from coordinate multiplication. A physical use must adopt the stated preparation maps and accessibility assumptions; fixed-composition models compare only preparations with the same ν, while a declared channel model may additionally compare different compositions of equal m.

This Definition restricts comparisons A≺B to m(A)=m(B); the coefficient-map supplier defines the mass, not the comparison relation. Write A∼B when both directions hold, and A≺≺B when only the forward direction holds. On any fixed simple type, dividing every represented state by the same positive constant wΓ gives its unit-point-mass comparison. Positive scaling and its inverse preserve and reflect order. An additive entropy density for this fixed type means a function S:Γ→R such that, for every two finite nonnegative unit-point-mass compounds C=∑jaje(Γ,xj) and D=∑kbke(Γ,yk) with ∑jaj=∑kbk, one has

C≺D⟺∑jajS(xj)≤∑kbkS(yk).

Empty sums are zero. Given such an S, define HS(C):=∑jajS(xj) on compounds supported on this type. Its represented-state values are HS(JΓ(x))=wΓS(x) and HS(∑jtjJΓ(xj))=∑jtjwΓS(xj) for finite nonnegative tj. These identities follow by substituting the raw coefficients in the finite sum. Representing only the comparisons e(Γ,x)≺e(Γ,y) is insufficient for the displayed compound equivalence. Existence of an additive entropy density is not assumed here; a later representation theorem must establish it under its full compound-comparison hypotheses. No independent rescaling across different types is assumed without a calibrator.

The common relation satisfies A1–A6 on all equal-mass finite compounds: (A1) reflexivity; (A2) transitivity; (A3) if A≺B, then A+C≺B+C for every compound C; (A4) if A≺B, then tA≺tB for every t>0; (A5) tJΓ(x) is equivalent to sJΓ(x)+(t−s)JΓ(x) for t>0 and 0<s<t, with the reversible scaled-copy transport above; (A6) for equal-mass A,B, fixed positive equal-mass spectators Z0,Z1, and every sequence ϵn>0 decreasing to zero, A+ϵnZ0≺B+ϵnZ1 for all n implies A≺B. These are hypotheses, not conclusions. No comparison hypothesis is included here.

For each i and x∈Γi, define the forward sector Ax:={y∈Γi:JΓi(x)≺JΓi(y)}. The simple-domain assumptions are: (A7) for x,y∈Γi and 0<t<1, the encoded compound tJΓi(x)+(1−t)JΓi(y) compares to JΓi(tx+(1−t)y); both have bookkeeping mass wΓi, and convexity puts the recombined coordinate in the chart; (S1) each x has a strict successor; (S2) Ax has exactly one supporting hyperplane at x, expressible as u−ux+Pi(x)⋅(v−vx)=0 with a finite-valued slope map Pi:Γi→Rni, and Pi is locally Lipschitz; (S3) the boundary of Ax relative to Γi is arcwise connected. A supporting hyperplane means that Ax lies in one of its closed half-spaces and meets the plane at x. The affine hull is the smallest affine subspace containing a set; relative interior is interior in that affine hull. Closure and boundary are taken in the indicated affine hull or in Γi, as named; boundary is closure intersected with closure of the complement in that relative topology.

This definition imposes no physical interpretation, units, or empirical claim. A contact theorem that uses joins must separately assume that each join is a simple domain satisfying these same forward-sector hypotheses.

Depends on

Dependency tree · 2 levels

Sources