Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (gpt-5.6-terra)audited 2026-08-28‡ rests on unproved material (inherited)
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.

‡ Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are ‡ Strong Perfect Graph Theorem, ‡ Substituting perfect graphs preserves perfection and ‡ Weak Perfect Graph Theorem. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

FALSE: every 2-narrow graph is 1-narrow

Statement

False claim. Every two-narrow graph is one-narrow.

Facts & Assumptions

Given: The cycle graph C5.

[L1]

The graph C5 is two-narrow but not one-narrow (The five-cycle is 2-narrow but not 1-narrow).

Refutation

technique · direct
1.1

The example [L1] furnishes a graph C5 that satisfies the hypothesis of the false claim but not its conclusion.

L1
2.1

Therefore the implication is false.

step 1.1∎

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.

Sources