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.
Every face of a plane subgraph contains each face of the original graph that it meets
Statement
Let be a plane subgraph of a plane graph in the inherited drawing (Plane embeddings of finite simple graphs, their faces, facial boundary walks and lengths (counting a bridge twice), and planar graphs, Subgraphs, induced subgraphs and spanning subgraphs). If a face of meets a face of , then .
Facts & Assumptions
Given: Such with .
A connected component is the largest connected subset of the ambient space containing any one of its points (Connected components, quasicomponents, and totally disconnected spaces).
Proof
Since the drawing of is contained in the drawing of , its complement contains the complement of . The face is connected and lies wholly in the complement of .
Choose a point of . Both sets contain it, and [L1] says is the largest connected subset of the complement of containing it. Step 1.1 therefore gives .
Depends on
Used by
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 31 results over 13 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
- R. Diestel, Graph Theory, 6th ed., Lemma 4.2.1 (standard reference, not scraped)