Alphabeta Math
LemmaStatement: 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.

Convexity and relative closedness of forward sectors

Statement

Under Forward-sector hypotheses for a simple state domain, for every simple state x, the forward sector Ax={y∈Γi:x≺y} is convex and closed relative to Γi. For collinear y=tx+(1−t)z, 0<t<1, y≺z implies x≺y, and x≺z implies x≺y.

Facts & Assumptions

Given: A1–A7 and S1–S3 on a nonempty open convex domain Γi.

[A1]

Forward-sector hypotheses for a simple state domain: A1–A7 include consistency, scaling, splitting, convex-combination access, and stability for positive spectators.

[F1]

Relative interiors of finite-dimensional convex sets: a nonempty convex set has nonempty relative interior, and segments from a relative-interior point to a closure point, excluding the closure endpoint, remain in the relative interior.

[F2]

Spectator cancellation without comparison completeness: any finite common spectator cancels when the two bases have equal mass, under A1–A6 without CH.

Proof

1.1A1algebra

If x≺y and x≺z, splitting gives x∼(tx,(1−t)x). Consistency, positive scaling, and transitivity then give (tx,(1−t)x)≺(ty,(1−t)z). The convex-combination access hypothesis in [A1] gives (ty,(1−t)z)≺ty+(1−t)z, so the convex combination belongs to Ax.

1.2A1F2algebra

Let y=tx+(1−t)z with 0<t<1. The convex-combination access hypothesis in [A1] gives (tx,(1−t)z)≺y. Splitting gives y∼(ty,(1−t)y). If y≺z, scaling by 1−t and adding ty gives (ty,(1−t)y)≺(ty,(1−t)z). Compose and cancel the common (1−t)z by [F2], then scale by 1/t, to get x≺y. If instead x≺z, scaling by 1−t and adding tx gives (tx,(1−t)x)≺(tx,(1−t)z)≺y; recombination gives x≺y.

2.1A1F1step 1.1algebra

Take y∈Ax‾ Γi. If y∈Ax, the claim is immediate. Otherwise choose w∈ri⁡Ax by [F1]. Because Γi is open, choose z=w+(1+η)(y−w)∈Γi for some η>0. For every integer n>1+η, yn=(1+1/n)y−z/n=w+(1−η/n)(y−w) lies in ri⁡Ax by [F1], so x≺yn. Also y=nn+1yn+1n+1z. The convex-combination access hypothesis in [A1] gives (nn+1yn,1n+1z)≺y; scaling by (n+1)/n and using the reversible split of y gives (yn,z/n)≺(y,y/n).

3.1A1step 2.1algebra∎

Consistency adds the same spectator z/n to x≺yn, and transitivity with step 2.1 gives (x,z/n)≺(y,y/n) for every n>1+η. Apply the stability hypothesis in [A1] to bases x,y, fixed positive equal-mass represented spectators z,y, and the tail sequence ϵm=1/(m+n0) with n0>1+η. It follows that x≺y. Thus every relative closure point belongs to Ax.

Depends on

Dependency tree · 2 levels

Sources