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 be defined by and for .
A path is a continuous map from the unit interval (Paths, path-connected spaces and path components).
A plane graph uses finitely polygonal edge arcs that meet only at common endpoints (Plane embeddings of finite simple graphs, their faces, facial boundary walks and lengths (counting a bridge twice), and planar graphs).
Counterexample
The first coordinate of is , so is injective. For it is continuous, and shows continuity at . Thus [F1] makes it a continuous arc with distinct endpoints. It is not polygonal: the second coordinate vanishes at infinitely many points accumulating at 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 is not identically zero on any interval.
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 , 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.
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: 74 results over 16 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
- Jeff Erickson, Planar Graphs (standard reference, not scraped)