Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passjudge pass (z-ai/glm-5.2)audited 2026-07-31
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.

The points polygonally reachable from a fixed point form a clopen subset of every open subset of Rn\mathbb{R}^n

Statement

Let URnU\subseteq\mathbb{R}^n be open and let aUa\in U. The set RaR_a of points of UU joined to aa by a polygonal path (Polygonal paths and polygonally connected subsets of Rn\mathbb{R}^n) in UU is both open and closed in the subspace UU.

Facts & Assumptions

Given: An open subset URnU\subseteq\mathbb{R}^n, a point aUa\in U, and the polygonally reachable set RaUR_a\subseteq U.

[L2]

A straight segment between two points of an Euclidean ball stays in that ball, by the triangle inequality for the Euclidean norm (Rn\mathbb{R}^n as the set of functions nRn \to \mathbb{R}, and d1d_1, d2d_2, dd_\infty are metrics on it).

[L3]

A finite concatenation of such segments is a continuous polygonal path (A finite concatenation of straight segments in Rn\mathbb{R}^n is a continuous path).

Proof

technique · direct
1.1

Let yRay\in R_a. Choose r>0r>0 with B(y,r)UB(y,r)\subseteq U. For every zB(y,r)z\in B(y,r), the segment from yy to zz lies in B(y,r)B(y,r) by [L2].

L1L2choose
1.2

Let yURay\in U\setminus R_a and choose r>0r>0 with B(y,r)UB(y,r)\subseteq U. If some zB(y,r)z\in B(y,r) lay in RaR_a, a path from aa to zz followed by the segment from zz to yy would put yy in RaR_a, a contradiction.

L1L2L3choose
2.1

Concatenating a polygonal path from aa to yy with that segment gives a polygonal path from aa to zz in UU. Thus B(y,r)RaB(y,r)\subseteq R_a, so RaR_a is open in UU.

L3step 1.1
3.1

Hence B(y,r)URaB(y,r)\subseteq U\setminus R_a, so the complement is open in UU. Therefore RaR_a is clopen in UU.

step 2.1step 1.2

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 99 results over 25 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