Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-10
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.

Any two points in a connected smooth manifold can be joined by a piecewise c one curve

Statement

Any two points in a nonempty connected smooth manifold can be joined by a finite piecewise C1 curve.

Facts & Assumptions

Given: A connected nonempty smooth manifold and points p,q.

[F1]

Piecewise c one curve on a manifold: A piecewise C1 curve in M is a continuous map γ:[a,b]M with a finite subdivision such that its restriction to each closed piece is C1 in local charts, with one-sided derivatives at piece endpoints. Use the chartwise regularity convention of def-c-r-and-smooth-maps-between-smooth-manifolds and the finite path operations of def-piecewise-c1-path-operations-and-oriented-reparametrizations. Refining a piece into finitely many chart pieces is allowed. No nonzero-velocity hypothesis is imposed: constant segments and pauses are admissible. A singleton parameter interval is interpreted as a constant curve of length zero.

[F2]

Separation of a topological space, connected and disconnected spaces, clopen sets, and connected subsets: Let (X,T) be a topological space (def-topological-space). - A separation of X is an ordered pair (U,V) of open, nonempty, disjoint subsets of X with UV=X. - X is disconnected when a separation of X exists, and connected when none does. - A subset AX is a connected subset of X when the space (A,TA) is connected, TA being the subspace topology (def-subspace-topology-top). "Disconnected subset" is read the same way. Since U and V are complementary in X, each of them is closed as well as open; so a separation is the same thing as a partition of X into two nonempty clopen pieces (def-topological-space). The clopen subsets of X are those that are both open and closed, and and X are always among them. The empty space and the one-point space are connected in this library. Neither admits a separation: a separation requires two nonempty disjoint sets whose union is the whole space, and neither nor a singleton can be written as such a union. So both are connected under the definition above, without any special clause. This is a live convention fork and the competing choice is recorded in rem-connectedness-conventions; nothing on this page depends on which is taken except the reading of the word "connected" applied to those two spaces. Connectedness is a property of a space, not of an ambient pair. The condition above mentions only (X,T). When it is applied to AX it is applied to the space (A,TA), so it does not change if A is regarded as a subspace of some other space inducing the same topology on A; in particular a subset of A is connected as a subset of A exactly when it is connected as a subset of X, by transitivity of the subspace topology (def-subspace-topology-top). This is why "connected" may be used of a subset with no ambient space named. Spelled out for a subset. AX is disconnected exactly when there are open U,VX with AUV,UA,VA,UVA=, because the open sets of (A,TA) are precisely the traces UA. Note the last condition: it asks U and V to be disjoint on A, not in X. Requiring UV= outright is a strictly stronger demand and is a different notion. The two-point discrete space. Write 2:={0,1} with the discrete topology (def-standard-topologies), in which every subset is open. A separation of X is the same datum as a surjective continuous map X2 (def-continuous-map-top): given (U,V), the map sending U to 0 and V to 1 is continuous because the preimage of each of the four open subsets of 2 is one of , U, V, X; given a surjective continuous χ:X2, the pair (χ1[{0}],χ1[{1}]) is a separation. This reformulation is proved as a theorem on this page and is recorded here only to name 2. Separated sets. Two subsets A1,A2X are separated in X when A1A2=andA1A2=, closures taken in X (def-interior-closure-boundary-top, thm-closure-characterisation-top). Separated sets are disjoint, since A1A1; the converse fails. This is verbatim the condition def-connected-r uses on the real line, transported to an arbitrary space, and the theorem relating it to the definition above is the next lemma on this page. Totally disconnected spaces, and the empty case. The vocabulary for a space all of whose connected subsets are single points is fixed later on this page, together with the components; it is not defined here because it is stated in terms of components.

Proof

technique · direct
1.1

Let R be the points reachable from p by finitely many coordinate straight segments. It contains p. A small coordinate ball about any point of R is convex, so appending a segment shows the whole ball lies in R; hence R is open. Relative half-balls give the same argument at a boundary.

F1given
2.1

Every reachability class is open by that argument, and reversing and concatenating finite segments makes reachability an equivalence relation. Thus the complement of R is open. If it were nonempty, it and R would separate the connected manifold. Therefore R=M, so q is reachable. For p=q the constant curve works; a connected zero-manifold has only one point.

F2step 1.1

Source locator

Lee, Chapter 13, pp.337–340, Proposition 13.25, Lemma 13.28 and Theorem 13.29; finite piecewise C1 refinements and pauses are treated explicitly here.

Depends on

Used by

Dependency tree · two levels

11 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