Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-29
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.

Components of a topological manifold are open and at most countable

Statement

Let M be a topological manifold. Then every connected component of M is open. Moreover the set of connected components of M is at most countable.

Facts & Assumptions

Given: A topological manifold M.

[F2]

A topological manifold is locally path connected (Topological manifolds are locally compact and locally path connected).

[L1]

In a locally connected space, the connected components of every open set are open; applied to the open set M itself, this makes components of M open (A space is locally connected exactly when every component of every open subspace is open; in that case the components of the space itself are clopen).

[L2]
[A1]

Every path-connected open neighbourhood is connected, so local path connectedness implies local connectedness.

Proof

technique · direct
1.1F2L1A1

By [F2] every point of M has a path-connected open neighbourhood; by [A1] such a neighbourhood is connected, so M is locally connected. Therefore [L1] applied to the open set M shows that every connected component of M is open.

2.1F1step 1.1choose

Because M is second countable by [F1], choose a countable basis [F1, step 1.1, choose] B=(Bn)n∈N. Let C be the set of connected components of M. By step 1.1 each C∈C is a nonempty open set, so there exists at least one index n with Bn⊆C and Bn≠∅. Choose the least such index and call it m(C).

3.1L2step 2.1

If C,D∈C and m(C)=m(D)=n, then Bn⊆C∩D. [L2, step 2.1] Since components are disjoint by [L2], this forces C=D. Thus C↦m(C) is injective from C into N, so C is at most countable.

4.1step 1.1step 3.1∎

Step 1.1 proves openness of components and step 3.1 proves that there are at most countably many of them.

Depends on

Used by

Dependency tree · two levels

20 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