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

Relative to a complete nonedge pair in a co-E-free graph, every one-sided vertex is pure to an induced H5

Statement

Let G be co-E-free. If nonadjacent x,y are complete to an induced copy of H5 and uN(x)N(y), then u is complete or anticomplete to that copy of H5.

Facts & Assumptions

Given: x,y,u and a labeled induced H5 as in the Statement.

[F1]

The labeled H5 has rim v1v2v3v4v5v1, hub w complete to the rim, and leaves vi adjacent only to vi (The graphs H0,H1,,H5).

[F2]

On any induced path to which u is mixed and whose exterior vertices are x,y, the preceding path-run lemma forbids two consecutive nonneighbours and three consecutive neighbours (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).

Proof

technique · contradiction
1.1

Suppose u is mixed on the H5. If u is complete to the rim and some uvj is a nonedge, then u is mixed on the induced path vjvjvj+1vj+2 and has three consecutive neighbours there, contrary to [F2]. Thus u is adjacent to every vj. If uw failed, {v1,u,v1,v2,v3,w} induces co-E; hence uw holds and u is complete to H5, a contradiction.

F1F2assume-contra
1.2

If u is anticomplete to the rim and some uvj is an edge, then u is mixed on vjvjvj+1 with two consecutive nonneighbours, contrary to [F2]. Thus every uvj is a nonedge. If uw were an edge, then u would be mixed on v1v1w with two consecutive nonneighbours, again contrary to [F2]. Hence uw is a nonedge, so u is anticomplete to H5, also a contradiction.

F1F2contradiction
1.3

It remains that u is mixed on the rim. Any cyclic run of two rim nonneighbours or three rim neighbours, together with a vertex of the opposite adjacency supplied by mixedness, lies in an induced rim subpath to which [F2] applies. Thus the two run restrictions force, up to cyclic relabeling, N(u)V(C)={v1,v3,v4}. If uw were a nonedge, then u would be mixed on v4wv2 with two consecutive nonneighbours; if uv1 were a nonedge, then u would be mixed on v1v1wv3 with three consecutive neighbours. Hence [F2] gives uw,uv1E(G); then {u,w,v1,v1,v2,v3} induces co-E, impossible.

F1F2contradiction
2.1

Every possible rim relation contradicts mixedness, so u is pure to the induced H5.

step 1.1step 1.2step 1.3discharge-contradiction

Depends on

Used by

Dependency tree · two levels

8 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