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 connected component of an open subset of is open and polygonally connected
Statement
Every connected component of an open subset is open in and polygonally connected.
Facts & Assumptions
Given: An open subset and a connected component of .
A Euclidean ball is path-connected, hence connected: the norm triangle inequality keeps every straight segment in the ball, the segment is continuous, and every path-connected space is connected (Open ball, closed ball and sphere in a metric space, A norm on a real vector space, the induced metric, and the dictionary with the metric axioms, A finite concatenation of straight segments in is a continuous path, Every path-connected space is connected, and every path component lies inside a component).
A component is the largest connected subset containing each of its points (Connected components, quasicomponents, and totally disconnected spaces).
An open connected Euclidean subset is polygonally connected (For an open subset of , connectedness, path-connectedness and polygonal connectedness are equivalent).
Proof
Let . Since is open, choose with . The ball is connected by [L1], meets at , and so lies in by maximality of the component.
Therefore every point of has a Euclidean ball contained in , so is open in .
The component is connected and now open, so [L3] makes it polygonally connected.
Depends on
- For an open subset of $\mathbb{R}^n$, connectedness, path-connectedness and polygonal connectedness are equivalent
- Open ball, closed ball and sphere in a metric space
- A norm on a real vector space, the induced metric, and the dictionary with the metric axioms
- A finite concatenation of straight segments in $\mathbb{R}^n$ is a continuous path
- Every path-connected space is connected, and every path component lies inside a component
- Connected components, quasicomponents, and totally disconnected spaces
Used by
- The index of a cycle is locally constant off its trace and vanishes far from it Corollary
- Every plane triangulation with at least three vertices is connected Lemma
- The complement of a polygonal arc in ℝ² is polygonally connected Lemma
- A two-connected plane graph of order at least three is maximal exactly when every face is triangular Proposition
- Polygonal Jordan curve theorem: a polygon has exactly two complementary regions and is the frontier of each Theorem
- The winding number is constant on each connected component of the complement of the trace Theorem
Dependency tree · two levels
35 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
- Locally connected space (standard reference, not scraped)