Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck 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,3 after deleting one vertex

Example

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

Facts & Assumptions

Given: Label a Petersen vertex by a two-element subset of {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 K5 nor a subdivision of K3,3 (Kuratowski–Wagner theorem: a finite graph is planar exactly when it has neither a K5 nor a K3,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 12. Take the branch classes A={13,14,15} and B={23,24,25}. The six direct branch connections are 13 to 24,25, 14 to 23,25, and 15 to 23,24. The remaining three are the paths 13−45−23, 14−35−24, and 15−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,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,3 with branch classes A and B. 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 · 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