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.
Puncturing a connected open subset of preserves path-connectedness for
Statement
Let , let be nonempty, open and connected, and let . Then is a nonempty, open, connected, path-connected set.
Facts & Assumptions
Given: The objects and hypotheses in the statement, with Euclidean balls and spheres as in Euclidean spheres and closed balls as subspaces of .
A connected open subset of is polygonally connected, and a polygonal path has finitely many affine pieces (For an open subset of , connectedness, path-connectedness and polygonal connectedness are equivalent, Polygonal paths and polygonally connected subsets of ).
For , the unit sphere is path-connected (For , the sphere is path-connected and connected). Translation and positive scaling take a path on the unit sphere continuously to a path on any sphere ; indeed for .
A path is a continuous map from , and finitely many continuous pieces that agree at their shared endpoints paste to a continuous path (Paths, path-connected spaces and path components, Continuity may be checked on any open cover, and on any finite closed cover; composites of continuous maps are continuous).
Every path-connected space is connected (Every path-connected space is connected, and every path component lies inside a component).
Proof
Fix . If , the constant path at lies in the punctured set. Otherwise [F1] gives a polygonal path from to . Choose small enough that and . If avoids , it already gives the required path.
Suppose meets . The preimage is a finite union of closed intervals: on each of the finitely many affine pieces in [F1], the preimage of the convex closed ball is a closed interval, possibly empty or a point. Its connected components are therefore finitely many closed intervals . Since the endpoints lie outside the closed ball, each component is contained in , and continuity and maximality give . If , that component is a single sphere point and cannot contain .
For each component with , use [F2] to choose a continuous path on from to , reparameterized on . Replace on those finitely many intervals by these sphere paths and retain it on the intervening closed intervals. The pieces agree at every endpoint, so [F3] gives a continuous path . Every replacement lies on a sphere of positive radius and hence misses ; the retained portions lie outside the closed ball, apart from singleton components already on the sphere. Some component has positive length because meets the interior point . Thus avoids and joins to . This also covers any zero-length polygonal pieces and tangencies to the sphere.
The construction proves path-connectedness, including equal endpoints by the constant path in step 1.1. The set is open: for each in , openness of gives a ball about contained in , and shrinking its radius below makes it avoid . It is nonempty because a ball about contains for some sufficiently small , where . By [F4] it is connected. The proof covers zero-length polygonal pieces, tangent singleton components and the case ; no infinite family of detours or iff claim is used. [F3, F4, given, step 1.1, step 3.1, algebra, cases, discharge-construct] \square
Source notes
This is an elementary local supplier proved from the cited path-connectedness, polygonal-path and finite-pasting interfaces. The underlying path-connectedness facts are treated in the cited topology references; the finite detour construction is given here in full. No external PDE or potential-theory result is used.
Depends on
- For $n\ge2$, the sphere $S^{n-1}$ is path-connected and connected
- Euclidean spheres and closed balls as subspaces of $\mathbb{R}^n$
- Paths, path-connected spaces and path components
- Polygonal paths and polygonally connected subsets of $\mathbb{R}^n$
- Continuity may be checked on any open cover, and on any finite closed cover; composites of continuous maps are continuous
- Every path-connected space is connected, and every path component lies inside a component
- For an open subset of $\mathbb{R}^n$, connectedness, path-connectedness and polygonal connectedness are equivalent
Used by
Dependency tree · two levels
29 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
- Paul Bankston, Metric Topology: A First Course, Proposition 21.3 (standard reference, not scraped)
- N. P. Strickland, Algebraic Topology notes, Proposition 5.14 (standard reference, not scraped)