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.
Quotient Blockades and Mixing Relations
1 · Prerequisites
- Blockades, Combs and Pattern Graphs
- Construction of the Natural Numbers
- Countability and Uncountability
- Finite Counting, Factorials and Binomial Coefficients
- Graphs, Walks and Connectivity
- Induced Subgraphs and Hereditary Graph Classes
- Relations, Functions, and Quotients
- The ZFC Axioms and the Basic Set Constructions
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- 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
The mixed-block reachability relation on a blockade
Definition
Let be a blockade in a finite graph . Define a relation on the set of blocks of by declaring if either or there is a sequence of blocks
such that every consecutive pair is mixed in the sense of Edges between disjoint vertex sets; complete, anticomplete, pure and mixed pairs.
Thus two blocks are -related exactly when one can move from one to the other through a chain of mixed block pairs.
Mixed-block reachability is an equivalence relation
Statement
For every blockade, the mixed-block reachability relation is an equivalence relation on its set of blocks.
Facts & Assumptions
Given: A blockade with mixed-block reachability relation .
Mixedness of disjoint vertex sets is symmetric (Purity is symmetric; complementation swaps complete and anticomplete pairs and preserves mixed pairs).
By definition, means that or that there is a finite chain from to through consecutive mixed block pairs (The mixed-block reachability relation on a blockade).
Proof
Reflexivity is immediate from [L2], because every block is related to itself.
If by a mixed chain then [L1] makes the reversed chain again a mixed chain, so . Thus is symmetric.
If and , then [L2] gives a mixed chain from to and another from to . Concatenating them at yields a mixed chain from to , so . Thus is transitive.
Therefore is reflexive, symmetric, and transitive, hence an equivalence relation.
The quotient blockade obtained from mixed-block reachability
Definition
Let be a blockade, and let be its mixed-block reachability relation. The quotient blockade is obtained by replacing each -equivalence class of original blocks by its union.
Concretely, if are the -classes, ordered by the least original index of a block they contain, then
Each 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.
A quotient block of connected or anticonnected blocks is again connected or anticonnected
Statement
Let be a blockade and let be a block of the quotient blockade .
- If every block of contained in induces a connected subgraph, then is connected.
- If every block of contained in induces an anticonnected subgraph, then is anticonnected.
Facts & Assumptions
Given: A blockade in a graph , its quotient blockade , and a quotient block .
The block is the union of one -equivalence class. Therefore, after fixing any member block , every other member block can be joined to by a finite mixed chain of original blocks contained in (The quotient blockade obtained from mixed-block reachability, The mixed-block reachability relation on a blockade).
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).
Connectedness is connectivity in , while anticonnectedness is connectivity in (Connected graphs and connected components defined by the existence of vertex paths, Anticonnected graphs and anticonnected components).
For every vertex set , one has ( for every vertex set ).
Proof
Assume first that every original block contained in is connected. Fix one such block . Let be any other member block. By [L1], choose a mixed chain inside . We prove by induction on that is connected. The case is immediate because is connected. If , then the induction hypothesis gives connectedness of , the block is connected by assumption, and [L2] gives a cross-edge between and because that pair is mixed. Hence the union up to is connected. Since was arbitrary, every member block of lies in the same connected component of , and therefore is connected.
Now assume every original block contained in is anticonnected. By [L3] and [L4], each member block induces a connected subgraph of . If two member blocks are consecutive on a mixed chain in , then [L2] gives a cross-nonedge between them in , hence a cross-edge in . Repeating the argument of step 1.1 inside shows that is connected. By [L3], this means that is anticonnected.
Steps 1.1 and 2.1 prove the connected and anticonnected conclusions.
Blocks from distinct mixed-block classes are pure to each other
Statement
Let and be blocks of a blockade . If and lie in different blocks of the quotient blockade , then is a pure pair.
Facts & Assumptions
Given: A blockade with quotient blockade , and original blocks of lying in different quotient blocks.
Two original blocks lie in the same quotient block exactly when they are related by the mixed-block reachability relation (The quotient blockade obtained from mixed-block reachability).
By definition, if two blocks are mixed, then they are joined by a length-one mixed chain and hence are -related (The mixed-block reachability relation on a blockade, Edges between disjoint vertex sets; complete, anticomplete, pure and mixed pairs).
Proof
Suppose for contradiction that is mixed. Then [L2] gives a mixed chain of length one from to , so .
By [L1], -related blocks lie in the same quotient block of . This contradicts the hypothesis that and lie in different quotient blocks.
Therefore is not mixed, hence it is pure.
A vertex mixed on a quotient block but pure on each member block yields two mixed member blocks with opposite adjacency
Statement
Let be a block of the quotient blockade , and let be a vertex. Suppose that is mixed on but is pure to every original block of contained in . Then there are two original blocks of , both contained in , such that
- and are mixed; and
- is complete to and anticomplete to .
Facts & Assumptions
Given: A blockade , a quotient block of , and a vertex that is mixed on but pure to every original block of contained in .
Because is mixed on but pure to each member block, there are original blocks such that is complete to and anticomplete to (Edges between disjoint vertex sets; complete, anticomplete, pure and mixed pairs).
Since is one quotient block, any two original blocks it contains are related by the mixed-block reachability relation, so there is a chain with each consecutive pair mixed (The quotient blockade obtained from mixed-block reachability, The mixed-block reachability relation on a blockade).
Proof
By [L1], choose original blocks such that is complete to and anticomplete to .
By [L2], choose a mixed block chain inside . Since is complete to the first block and anticomplete to the last, there is a first index at which the relation changes. Then is complete to and anticomplete to , and the two blocks are mixed because they are consecutive on the chain.
Taking and gives the required pair of mixed original blocks in .
A quotient-level mixed-block witness descends to two mixed member blocks
Statement
Let be a blockade in a graph , and suppose that every block of is connected or every block is anticonnected. Let be distinct mixed blocks of the quotient blockade . Assume there are vertices such that:
- and are nonadjacent and both are complete to ;
- , with complete to and anticomplete to ; and
- no vertex of is mixed on .
Then there are mixed original blocks of , both contained in , and vertices such that:
- and are nonadjacent and both are complete to ; and
- , with complete to and anticomplete to .
Facts & Assumptions
Given: The hypotheses of the Statement.
Distinct original blocks lying in different quotient blocks are pure to each other (Blocks from distinct mixed-block classes are pure to each other).
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
Since and 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 is mixed on , so choose a vertex that is mixed on .
The quotient blocks and are distinct. Therefore [L1] implies that every original block of contained in is pure to every original block of contained in . In particular, if is the original block of containing , then is pure to every original block contained in .
Now is outside , is mixed on by step 1.1, and is pure to every original block inside by step 2.1. Applying [L2], choose mixed original blocks such that is complete to and anticomplete to .
Set , , and . Because is complete to , it is complete to and adjacent to . Because is complete to and anticomplete to , it is complete to and nonadjacent to . Hypothesis 2 gives , so and are nonadjacent. Therefore , while is complete to and anticomplete to by step 3.1. This is exactly the required witness.
5 · Examples, counterexamples and false statements
None yet.
Sources
- Shenwei Huang, Yiao Ju, and Yidong Zhou, Erdős-Hajnal beyond the five-vertex path, Section 6
- Shenwei Huang, Yiao Ju, and Yidong Zhou, Erdős-Hajnal beyond the five-vertex path, Lemma 6.1(1)
- Shenwei Huang, Yiao Ju, and Yidong Zhou, Erdős-Hajnal beyond the five-vertex path, Lemma 6.1(2)
- Shenwei Huang, Yiao Ju, and Yidong Zhou, Erdős-Hajnal beyond the five-vertex path, Lemma 6.1(3)
- Shenwei Huang, Yiao Ju, and Yidong Zhou, Erdős-Hajnal beyond the five-vertex path, Lemma 6.2