Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 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.

In a special-vertex comb of a co-E-free graph, vertices in other comb blocks remain pure to every H5-overlap quotient block

Statement

Let G be co-E-free and let ((ak,Bk):k[]) be a comb with an outside vertex v complete to all Bk and anticomplete to all ak. Fix i, form the nonempty H5-overlap blockade in Bi, and form its iterated mixed quotients. Every vertex of kiBk is pure to every block of every iterate.

Facts & Assumptions

Given: The special-vertex comb, an index i, and its iterated overlap quotients.

[F1]

Relative to any nonadjacent pair complete to an induced H5 in a co-E-free graph, every one-sided vertex is pure to that H5; in particular, with (x,y)=(v,ai), every external comb-block vertex is pure to every induced H5 in Bi (Relative to a complete nonedge pair in a co-E-free graph, every one-sided vertex is pure to an induced H5).

[F2]

Purity on every H5 propagates to its overlap class (Purity on every induced H5 propagates along an H5-overlap class).

[F3]

For a blockade of connected blocks, suppose distinct mixed quotient blocks D1,D2 have outside vertices x,y,z with xy a nonedge, x,y complete to D1D2, and zN(x)N(y) complete to D1 and anticomplete to D2. If no vertex of D1 is mixed on D2, there are mixed member blocks inside D1 with an outside triple satisfying the same adjacency conditions (A quotient-level mixed-block witness descends to two mixed member blocks).

[F4]

If an outside vertex is mixed on a connected set, it has opposite adjacency to the endpoints of some edge of that set (A vertex mixed on a connected set has opposite adjacency on some edge of that set).

[F5]

In a co-E-free graph, if nonadjacent outside vertices x,y are complete to an induced path P, a vertex zN(x)N(y) mixed on P cannot have two consecutive nonneighbours on P (Relative to a complete nonedge pair in a co-E-free graph, a one-sided vertex mixed on an induced path avoids two consecutive nonneighbours and three consecutive neighbours).

[F6]

Initial overlap classes are connected, and taking a mixed quotient preserves connectedness of blocks (Every H5-overlap class is connected, A quotient block of connected or anticonnected blocks is again connected or anticonnected).

[F7]

Each next iterate replaces mixed-reachability classes of blocks by their unions (The H5-overlap blockade and its iterated mixed quotients).

Proof

technique · induction
1.1

Write Lr for iterate r1. For any external comb-block vertex u, the comb and special-vertex hypotheses give uN(v)N(ai), with v,ai nonadjacent and complete to Bi. Thus [F1] makes u pure to every induced H5 in Bi, and [F2] makes it pure to each block of L1.

givenF1F2base
1.2

All blocks of every Lr are connected: start with the initial classes and repeatedly apply connectedness preservation in [F6].

F6
1.3

Fix s2 and assume the assertion for s1. Suppose an external vertex u is mixed on a block L of Ls. By the induction hypothesis, each member block of Ls1 inside L is complete or anticomplete to u, and both labels occur. By [F7], a mixed chain inside L joins blocks of opposite labels; at a change of label, consecutive mixed blocks D1,D2 have u complete to D1 and anticomplete to D2.

F7ih
2.1

Consider any mixed blocks D1,D2 at level r1 with an outside triple x,y,z satisfying: xy is a nonedge, x,y are complete to D1D2, and zN(x)N(y) is complete to D1 and anticomplete to D2. No vertex bD1 is mixed on D2. Indeed, if one were, connectedness and [F4] give an edge cc in D2 with bc an edge and bc a nonedge. Then bcc is induced, x,y are outside and complete to it, and z is mixed on it with consecutive nonneighbours c,c, contrary to [F5].

step 1.2F4F5
3.1

The pair in step 1.3 has the required triple (x,y,z)=(v,ai,u) at level s1. Whenever its current level r exceeds one, apply [F3] to Lr1: step 1.2 supplies connected member blocks and step 2.1 supplies the directional no-mixed-vertex hypothesis. The resulting mixed blocks at level r1 have an outside triple with all the same adjacency conditions. Repeating this finite descent reaches mixed initial classes A1,A2 and an outside triple x,y,u with xy a nonedge, x,y complete to A1A2, and uN(x)N(y) complete to A1 and anticomplete to A2. If s=2, the initial pair already has these properties.

givenstep 1.3step 2.1step 1.2F3
4.1

Apply step 2.1 to A1,A2,x,y,u. Every vertex of A1 is pure to A2. Since the pair (A1,A2) is mixed, some vertex pA1 is complete to A2 and some vertex qA1 is anticomplete to A2; otherwise all vertices have the same label and the pair is pure. Therefore any u2A2 is adjacent to p and nonadjacent to q, and is mixed on A1. Such a vertex exists because a blockade block is nonempty.

step 2.1step 3.1
5.1

The vertices y,u are outside A1, nonadjacent, and both complete to A1. Also u2N(y)N(u). Apply [F1] with (x,y,u)=(y,u,u2) to every induced H5 contained in A1, then [F2] to the overlap class A1. It follows that u2 is pure to A1, contradicting step 4.1. Thus no external vertex is mixed on any block at level s. Together with the base case this proves the assertion for every iterate.

step 3.1step 4.1F1F2discharge-induction

Depends on

Used by

Dependency tree · two levels

29 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