Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-sol)audited 2026-09-30
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 Rn preserves path-connectedness for n≥2

Statement

Let n≥2, let Ω⊆Rn be nonempty, open and connected, and let y∈Ω. Then Ω∖{y} 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 Rn.

[F1]

A connected open subset of Rn is polygonally connected, and a polygonal path has finitely many affine pieces (For an open subset of Rn, connectedness, path-connectedness and polygonal connectedness are equivalent, Polygonal paths and polygonally connected subsets of Rn).

[F2]

For n≥2, the unit sphere is path-connected (For n≥2, the sphere Sn−1 is path-connected and connected). Translation and positive scaling take a path on the unit sphere continuously to a path on any sphere S2(y,r); indeed ∣y+ru−y−rv∣=r∣u−v∣ for r>0.

[F3]

A path is a continuous map from [0,1], 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).

Proof

technique · constructive
1.1F1F3givencaseschoose

Fix x,z∈Ω∖{y}. If x=z, the constant path at x lies in the punctured set. Otherwise [F1] gives a polygonal path γ:[0,1]→Ω from x to z. Choose r>0 small enough that B‾2(y,r)⊂Ω and r<min⁡{∣x−y∣,∣z−y∣}. If γ avoids y, it already gives the required path.

2.1F1givenstep 1.1algebra

Suppose γ meets y. The preimage A=γ−1[B‾2(y,r)] 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 [aj,bj]. Since the endpoints x,z lie outside the closed ball, each component is contained in (0,1), and continuity and maximality give γ(aj),γ(bj)∈S2(y,r). If aj=bj, that component is a single sphere point and cannot contain y.

3.1F1F2F3step 2.1algebraconstruct

For each component with aj<bj, use [F2] to choose a continuous path on S2(y,r) from γ(aj) to γ(bj), reparameterized on [aj,bj]. 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 γ~:[0,1]→Ω. Every replacement lies on a sphere of positive radius and hence misses y; 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 y. Thus γ~ avoids y and joins x to z. This also covers any zero-length polygonal pieces and tangencies to the sphere.

4.1

The construction proves path-connectedness, including equal endpoints by the constant path in step 1.1. The set is open: for each x≠y in Ω, openness of Ω gives a ball about x contained in Ω, and shrinking its radius below ∣x−y∣ makes it avoid y. It is nonempty because a ball about y contains y+te1≠y for some sufficiently small t>0, where e1=(1,0,…,0). By [F4] it is connected. The proof covers zero-length polygonal pieces, tangent singleton components and the case x=z; 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

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