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.
A vertex may be mixed on a quotient block while pure on each member block
Example
Let be a two-block blockade in which and are mixed. Then its quotient blockade has the single block . If a vertex is complete to and anticomplete to , then is mixed on although it is pure to each member block separately.
Facts & Assumptions
Given: A two-block blockade whose blocks are mixed, and a vertex that is complete to and anticomplete to .
Mixed blocks are joined by a one-link mixed chain, and quotient blocks are the unions of mixed-reachability classes (The mixed-block reachability relation on a blockade, The quotient blockade obtained from mixed-block reachability).
The preceding lemma characterizes exactly this situation (A vertex mixed on a quotient block but pure on each member block yields two mixed member blocks with opposite adjacency).
Verification
Since and are mixed, [L1] places them in the same mixed-reachability class. They are the only blocks of , so their class has union , the unique quotient block.
The vertex is adjacent to every vertex of and to no vertex of . Therefore is neither complete nor anticomplete to , so is mixed on . At the same time it is pure to and pure to individually.
This is exactly the phenomenon isolated by [L2]: the mixing appears only after passing to the quotient union.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
6 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.