Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-11
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.

The Petersen graph is nonplanar by an explicit subdivision of K3,3K_{3,3} after deleting one vertex

Example

Deleting one vertex from the Petersen graph exposes a subdivision of K3,3K_{3,3}.

Facts & Assumptions

Given: Label a Petersen vertex by a two-element subset of {1,2,3,4,5}\{1,2,3,4,5\}, with adjacency exactly when labels are disjoint, as in The Petersen graph on the two-element subsets of a five-element set, adjacent when disjoint.

[L1]

A finite graph is planar exactly when it contains neither a subdivision of K5K_5 nor a subdivision of K3,3K_{3,3} (Kuratowski–Wagner theorem: a finite graph is planar exactly when it has neither a K5K_5 nor a K3,3K_{3,3} minor, equivalently neither subdivision).

[F1]

Two Petersen vertices are adjacent exactly when their two-element labels are disjoint (The Petersen graph on the two-element subsets of a five-element set, adjacent when disjoint).

Verification

technique · constructive
1.1

Delete the vertex 1212. Take the branch classes A={13,14,15}A=\{13,14,15\} and B={23,24,25}B=\{23,24,25\}. The six direct branch connections are 1313 to 24,2524,25, 1414 to 23,2523,25, and 1515 to 23,2423,24. The remaining three are the paths 13452313-45-23, 14352414-35-24, and 15342515-34-25.

F1construct
2.1

Every consecutive pair in the displayed list has disjoint labels, so it is an edge by [F1]. The internal vertices 45,35,3445,35,34 are distinct and are not branch vertices; all other listed connections are single edges. Thus the nine paths are internally disjoint and form a subdivision, in the sense of Vertex and edge deletion, edge contraction, graph minors, subdivisions and topological minors, of K3,3K_{3,3} with branch classes AA and BB. This subdivision lies in a subgraph of the Petersen graph, so [L1] proves that the Petersen graph is nonplanar.

L1F1step 1.1discharge-construct

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 35 results over 11 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources