Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-07
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.

E overlap quotients terminate at a pure blockade

Statement

For nonempty overlap support, put n=L1. Every stage Ls partitions the same support into nonempty anticonnected blocks and coarsens L1. There is a least q1 for which Lq is pure, with qn. At most n1 strict transitions occur, and all stages from q onward are identical.

Facts & Assumptions

[F1]

The E overlap blockade and mixed quotient sequence supplies the following definition: Fix a comb block Bi with nonempty E overlap support Xi. By lem-e-overlap-classes-form-an-anticonnected-partition, its overlap classes are nonempty anticonnected sets partitioning Xi. Fix an enumeration of the finite set Bi, and order the classes by their least enumerated vertex to obtain L1. Define recursively Ls+1=Ls/M for s1, using def-quotient-blockade-by-mixed-block-reachability and its least-member ordering. Thus one replaces each mixed-reachability class of blocks by its union. This construction is used only when Xi.

[F2]

A quotient block of connected or anticonnected blocks is again connected or anticonnected supplies the following statement: Let L be a blockade and let D be a block of the quotient blockade L/M. 1. If every block of L contained in D induces a connected subgraph, then G[D] is connected. 2. If every block of L contained in D induces an anticonnected subgraph, then G[D] is anticonnected.

[F3]

The well-ordering principle supplies the following statement: Every nonempty subset SN has a least element: there is S with s for all sS.

Proof

Given: The graph, vertices, sets and hypotheses in the statement.

1.1

The initial classes have the asserted properties by the construction. Every quotient is a partition of the same union into unions of old blocks, so coarsening and nonemptiness persist at every stage. The anticonnected clause of the quotient preservation lemma, applied successively, preserves anticonnectedness.

F1F2
1.2

If a stage has a mixed pair, those two blocks belong to the same reachability class, so the next stage has strictly fewer blocks. If it has no mixed pair, every reachability class is a singleton, so the next ordered blockade is identical. Conversely an identical stage cannot have a mixed pair.

F1
2.1

The positive integer block count begins at n; after n1 strict decreases it is at most one, when no mixed pair exists. Thus a pure stage exists among 1,,n. The well-ordering principle gives a least such q, and the preceding fixed-stage argument makes all later stages equal. This also covers n=1,q=1 and zero strict transitions.

F3F1

Depends on

Used by

Cited to discharge well-definedness by The E overlap blockade and mixed quotient sequence.

Dependency tree · two levels

19 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources