Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (gpt-5.6-terra)audited 2026-08-28
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.

Every composite bull-free graph has a nontrivial module

Statement

Every composite bull-free graph has a nontrivial module.

Facts & Assumptions

Given: A composite bull-free graph G.

[F1]

In a composite bull-free graph there is an odd hole or odd antihole A with one outside vertex complete to V(A) and another outside vertex anticomplete to V(A) (Basic and composite bull-free graphs).

[F2]

A set is split when every mixed outside vertex has one of the two witnesses from the definition: either a three-vertex path, or a three-vertex configuration with exactly one edge among the three vertices (A split set in a bull-free graph).

[L1]

A split set with both a complete and an anticomplete outside witness yields a nontrivial module (A split set with both a complete and an anticomplete outside vertex yields a nontrivial module).

[L2]

Proof

technique · direct
1.1

By [F1] and [L2], after passing to the complement if needed we may assume that A is an odd hole with vertices h1,,hk in cyclic order, together with a vertex c complete to V(A) and a vertex a anticomplete to V(A). To apply [L1], it is enough to show that V(A) is split.

F1L1L2choose
1.2

Let xV(G)V(A) be neither complete nor anticomplete to V(A). By cyclic symmetry, assume x is adjacent to h1 and nonadjacent to h2. If x is adjacent to hk, then the path hk-h1-h2 gives the first split alternative from [F2]. So assume x is nonadjacent to hk. If x is also nonadjacent to hk1, then h1h2E(G) while h1hk1,hk1h2E(G), so the triple (h1,hk1,h2) gives the second split alternative. Otherwise x is adjacent to hk1, and then hk1hkE(G) while hk1h2,h2hkE(G), so the triple (hk1,h2,hk) gives the second split alternative. Hence every mixed outside vertex satisfies [F2], so V(A) is split.

F2algebra
2.1

Step 1.2 shows that the odd hole A is a split set, and step 1.1 supplies a complete and an anticomplete outside vertex for it. Therefore [L1] gives a nontrivial module in G.

step 1.1step 1.2L1

Depends on

Used by

Dependency tree · two levels

10 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