Alphabeta Math
Session-authored (Fable 5 assisted)
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.

5 results · all verified · 3 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 2 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Quotient Blockades and Mixing Relations

1 · Prerequisites

2 · Summary

This page isolates the quotient construction used at the start of Section 6 of the six-vertex extension paper. It defines the mixed-block reachability relation, passes to its quotient blockade, records the three local consequences collected as Lemma 6.1, and ends at the exact descent statement of Lemma 6.2.

Nothing from the later co-E or co-Bird structure theory is pulled forward here. The point of the page is the quotient mechanism itself, not the later graph-specific applications.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-08-28Open item page →

The mixed-block reachability relation on a blockade

Definition

Let L=(L1,,Ln) be a blockade in a finite graph G. Define a relation M on the set of blocks of L by declaring LiMLj if either i=j or there is a sequence of blocks

Li=Lr1,Lr2,,Lrm=Lj

such that every consecutive pair Lrt,Lrt+1 is mixed in the sense of Edges between disjoint vertex sets; complete, anticomplete, pure and mixed pairs.

Thus two blocks are M-related exactly when one can move from one to the other through a chain of mixed block pairs.

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-28Open item page →

Mixed-block reachability is an equivalence relation

Statement

For every blockade, the mixed-block reachability relation M is an equivalence relation on its set of blocks.

Facts & Assumptions

Given: A blockade L with mixed-block reachability relation M.

[L2]

By definition, AMB means that A=B or that there is a finite chain from A to B through consecutive mixed block pairs (The mixed-block reachability relation on a blockade).

Proof

technique · direct
1.1

Reflexivity is immediate from [L2], because every block is related to itself.

L2
1.2

If AMB by a mixed chain A=A1,A2,,Am=B, then [L1] makes the reversed chain B=Am,Am1,,A1=A again a mixed chain, so BMA. Thus M is symmetric.

L1L2algebra
1.3

If AMB and BMC, then [L2] gives a mixed chain from A to B and another from B to C. Concatenating them at B yields a mixed chain from A to C, so AMC. Thus M is transitive.

L2algebra
2.1

Therefore M is reflexive, symmetric, and transitive, hence an equivalence relation.

step 1.1step 1.2step 1.3
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-08-28Open item page →

The quotient blockade obtained from mixed-block reachability

Definition

Let L=(L1,,Ln) be a blockade, and let M be its mixed-block reachability relation. The quotient blockade L/M is obtained by replacing each M-equivalence class of original blocks by its union.

Concretely, if C1,,Ct are the M-classes, ordered by the least original index of a block they contain, then

L/M=(D1,,Dt),Di:=LCiL.

Each Di is called a quotient block. Because the original blocks are pairwise disjoint and each equivalence class is nonempty, the quotient blocks are again pairwise disjoint and nonempty.

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-28Open item page →

A quotient block of connected or anticonnected blocks is again connected or anticonnected

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.

Facts & Assumptions

Given: A blockade L in a graph G, its quotient blockade L/M, and a quotient block D.

[L1]

The block D is the union of one M-equivalence class. Therefore, after fixing any member block A0D, every other member block BD can be joined to A0 by a finite mixed chain A0=B0,B1,,Bm=B of original blocks contained in D (The quotient blockade obtained from mixed-block reachability, The mixed-block reachability relation on a blockade).

[L2]

A mixed pair has at least one cross-edge and at least one cross-nonedge (Edges between disjoint vertex sets; complete, anticomplete, pure and mixed pairs).

[L3]

Connectedness is connectivity in G, while anticonnectedness is connectivity in G (Connected graphs and connected components defined by the existence of vertex paths, Anticonnected graphs and anticonnected components).

[L4]

For every vertex set W, one has G[W]=G[W] (G[W]=G[W] for every vertex set W).

Proof

technique · direct
1.1

Assume first that every original block contained in D is connected. Fix one such block A0D. Let BD be any other member block. By [L1], choose a mixed chain A0=B0,B1,,Bm=B inside D. We prove by induction on m that G[B0Bm] is connected. The case m=0 is immediate because B0=A0 is connected. If m>0, then the induction hypothesis gives connectedness of G[B0Bm1], the block Bm is connected by assumption, and [L2] gives a cross-edge between Bm1 and Bm because that pair is mixed. Hence the union up to Bm is connected. Since B was arbitrary, every member block of D lies in the same connected component of G[D], and therefore G[D] is connected.

givenL1L2algebra
2.1

Now assume every original block contained in D is anticonnected. By [L3] and [L4], each member block induces a connected subgraph of G. If two member blocks are consecutive on a mixed chain in D, then [L2] gives a cross-nonedge between them in G, hence a cross-edge in G. Repeating the argument of step 1.1 inside G shows that G[D] is connected. By [L3], this means that G[D] is anticonnected.

step 1.1L2L3L4algebra
3.1

Steps 1.1 and 2.1 prove the connected and anticonnected conclusions.

step 1.1step 2.1
LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-28Open item page →

Blocks from distinct mixed-block classes are pure to each other

Statement

Let A and B be blocks of a blockade L. If A and B lie in different blocks of the quotient blockade L/M, then (A,B) is a pure pair.

Facts & Assumptions

Given: A blockade L with quotient blockade L/M, and original blocks A,B of L lying in different quotient blocks.

[L1]

Two original blocks lie in the same quotient block exactly when they are related by the mixed-block reachability relation M (The quotient blockade obtained from mixed-block reachability).

[L2]

By definition, if two blocks are mixed, then they are joined by a length-one mixed chain and hence are M-related (The mixed-block reachability relation on a blockade, Edges between disjoint vertex sets; complete, anticomplete, pure and mixed pairs).

Proof

technique · direct
1.1

Suppose for contradiction that (A,B) is mixed. Then [L2] gives a mixed chain of length one from A to B, so AMB.

L2assume-contra
2.1

By [L1], M-related blocks lie in the same quotient block of L/M. This contradicts the hypothesis that A and B lie in different quotient blocks.

step 1.1L1discharge-contradiction
3.1

Therefore (A,B) is not mixed, hence it is pure.

step 2.1
LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-28Open item page →

A vertex mixed on a quotient block but pure on each member block yields two mixed member blocks with opposite adjacency

Statement

Let D be a block of the quotient blockade L/M, and let uD be a vertex. Suppose that u is mixed on D but is pure to every original block of L contained in D. Then there are two original blocks A1,A2 of L, both contained in D, such that

  1. A1 and A2 are mixed; and
  2. u is complete to A1 and anticomplete to A2.

Facts & Assumptions

Given: A blockade L, a quotient block D of L/M, and a vertex uD that is mixed on D but pure to every original block of L contained in D.

[L1]

Because u is mixed on D but pure to each member block, there are original blocks B1,B2D such that u is complete to B1 and anticomplete to B2 (Edges between disjoint vertex sets; complete, anticomplete, pure and mixed pairs).

[L2]

Since D is one quotient block, any two original blocks it contains are related by the mixed-block reachability relation, so there is a chain B1=Ar1,Ar2,,Arm=B2 with each consecutive pair mixed (The quotient blockade obtained from mixed-block reachability, The mixed-block reachability relation on a blockade).

Proof

technique · direct
1.1

By [L1], choose original blocks B1,B2D such that u is complete to B1 and anticomplete to B2.

L1choose
2.1

By [L2], choose a mixed block chain B1=Ar1,Ar2,,Arm=B2 inside D. Since u is complete to the first block and anticomplete to the last, there is a first index j<m at which the relation changes. Then u is complete to Arj and anticomplete to Arj+1, and the two blocks are mixed because they are consecutive on the chain.

step 1.1L2choose
3.1

Taking A1:=Arj and A2:=Arj+1 gives the required pair of mixed original blocks in D.

step 2.1
LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-28Open item page →

A quotient-level mixed-block witness descends to two mixed member blocks

Statement

Let L be a blockade in a graph G, and suppose that every block of L is connected or every block is anticonnected. Let D1,D2 be distinct mixed blocks of the quotient blockade L/M. Assume there are vertices x,y,uD1D2 such that:

  1. x and y are nonadjacent and both are complete to D1D2;
  2. uN(x)N(y), with u complete to D1 and anticomplete to D2; and
  3. no vertex of D1 is mixed on D2.

Then there are mixed original blocks A1,A2 of L, both contained in D1, and vertices x,y,uA1A2 such that:

  1. x and y are nonadjacent and both are complete to A1A2; and
  2. uN(x)N(y), with u complete to A1 and anticomplete to A2.

Facts & Assumptions

Given: The hypotheses of the Statement.

[L1]

Distinct original blocks lying in different quotient blocks are pure to each other (Blocks from distinct mixed-block classes are pure to each other).

[L2]

If a vertex outside a quotient block is mixed on that quotient block but pure to each original block inside it, then two mixed original member blocks witness opposite adjacency to that vertex (A vertex mixed on a quotient block but pure on each member block yields two mixed member blocks with opposite adjacency).

Proof

technique · direct
1.1

Since D1 and D2 are mixed as quotient blocks, there is a vertex in one of them that is mixed on the other. Hypothesis 3 excludes the possibility that a vertex of D1 is mixed on D2, so choose a vertex b2D2 that is mixed on D1.

givenchoose
2.1

The quotient blocks D1 and D2 are distinct. Therefore [L1] implies that every original block of L contained in D2 is pure to every original block of L contained in D1. In particular, if B is the original block of L containing b2, then b2 is pure to every original block contained in D1.

step 1.1L1
3.1

Now b2 is outside D1, is mixed on D1 by step 1.1, and is pure to every original block inside D1 by step 2.1. Applying [L2], choose mixed original blocks A1,A2D1 such that b2 is complete to A1 and anticomplete to A2.

step 2.1L2choose
4.1

Set x:=y, y:=u, and u:=b2. Because y is complete to D1D2, it is complete to A1A2 and adjacent to b2. Because u is complete to D1 and anticomplete to D2, it is complete to A1A2 and nonadjacent to b2. Hypothesis 2 gives uN(x)N(y), so y and u are nonadjacent. Therefore u=b2N(x)N(y), while u is complete to A1 and anticomplete to A2 by step 3.1. This is exactly the required witness.

step 3.1givenalgebra

5 · Examples, counterexamples and false statements

None yet.

Sources