Alphabeta Math
CounterexampleConstruction: AI-generatedVerification: AI-generatedprecheck 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.

An injective nonpolygonal arc drawing is excluded by the page's finite polygonal plane-graph convention

Statement refuted

Every injective continuous drawing of an abstract edge is a plane graph under this page's definition.

Facts & Assumptions

Given: Let γ:[0,1]→R2 be defined by γ(0)=(0,0) and γ(t)=(t,tsin⁡(1/t)) for t>0.

[F1]

A path is a continuous map from the unit interval (Paths, path-connected spaces and path components).

[L1]

Counterexample

technique · direct
1.1

The first coordinate of γ(t) is t, so γ is injective. For t>0 it is continuous, and ∣tsin⁡(1/t)∣≤t shows continuity at 0. Thus [F1] makes it a continuous arc with distinct endpoints. It is not polygonal: the second coordinate vanishes at infinitely many points t=1/(kπ) accumulating at 0 and changes sign between them, whereas a finite union of line segments either has only finitely many such crossings of the horizontal axis or contains a nontrivial segment of that axis. The latter is impossible here because tsin⁡(1/t) is not identically zero on any interval.

F1construct
2.1

Use the image of γ as the drawing of the sole edge of a two-vertex abstract graph. The drawing is injective but its edge is not a polygonal arc in the sense of Polygonal arcs and polygons as non-self-intersecting finite unions of line segments in R2, so [L1] excludes this particular drawing from the page's class of plane graphs. This does not make the abstract one-edge graph nonplanar: drawing its edge as a straight segment gives a plane embedding.

L1step 1.1construct∎

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

20 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