Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passverified 2026-08-04 (gpt-5.6-sol-codex-subscription)
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 zigzag curve and its closure worked out: the components, the path components, and the points at which local connectedness fails

Example

Let G be the graph of the zigzag function and G‾=G∪({0}×[0,1]) its closure in R2 (The graph of the piecewise-linear map oscillating between 0 and 1 on the intervals [1/(n+2),1/(n+1)] is path-connected, its closure adds the segment {0}×[0,1], and that closure is connected, is not path-connected because no path joins the segment to the graph, and is not locally connected, claim 2). Write Σ:={0}×[0,1] for the added segment. Then, in the space G‾ with its subspace topology (Subspace topology: the traces of the open sets, its closed sets and its bases, the continuity of the inclusion, and the characteristic property of a map into a subspace):

  1. One component. G‾ is connected, so it has exactly one component, namely G‾ itself, and exactly one quasicomponent, also G‾ (Connected components, quasicomponents, and totally disconnected spaces, The components of a space are its maximal connected subsets, they partition it, and each of them is closed, Every quasicomponent is a closed union of components, so each component is contained in a quasicomponent, and the quasicomponents partition the space).
  2. Two path components, namely G and Σ (Paths, path-connected spaces and path components).
  3. G is open in G‾ and Σ is closed in it; neither is clopen, since G‾ is connected.
  4. Local connectedness holds at every point of G and fails at every point of Σ (Locally connected and locally path-connected spaces: a neighbourhood base of open connected, respectively open path-connected, sets at every point). So the set of points at which G‾ fails to be locally connected is exactly Σ.

Claim 2 is the sharp form of "not path-connected": the failure is not that some pair of points is unjoined but that the space splits into exactly two path classes, one of which is the whole added segment.

Facts & Assumptions

Given: G, Σ={0}×[0,1] and G‾=G∪Σ as subspaces of R2.

[L1]

G is path-connected, connected and locally connected; G‾=G∪Σ; G‾ is connected; no path in G‾ joins a point of Σ to a point of G; and G‾ is not locally connected at any point of Σ (The graph of the piecewise-linear map oscillating between 0 and 1 on the intervals [1/(n+2),1/(n+1)] is path-connected, its closure adds the segment {0}×[0,1], and that closure is connected, is not path-connected because no path joins the segment to the graph, and is not locally connected, claims 1, 2, 3, 4, 5).

[A2]

The path components partition the space and each is path-connected; a path-connected subset containing x lies inside the path component of x (Paths, path-connected spaces and path components).

Verification

technique · direct
1.1

G‾ is connected by [L1], so the largest connected subset containing any of its points is G‾ itself; by [A1] it is therefore the unique component, and by [A1] the unique quasicomponent contains it and is contained in the space, hence equals it. This is claim 1.

L1A1
1.2

Σ={0}×[0,1] is path-connected: for (0,s),(0,u)∈Σ the map t↦(0,s+t(u−s)) is continuous into R2 by [A3] and takes values in Σ, since s+t(u−s) lies between s and u, hence in [0,1].

A3
2.1

Σ is closed in R2 by [A4], being a product of two closed subsets of R; hence Σ=Σ‾∩G‾ is closed in G‾ by [A4], and G=G‾∖Σ is open in G‾. This is claim 3, the "not clopen" half following from claim 1, a clopen proper nonempty subset being impossible in a connected space.

step 1.1A4
2.2

G and Σ are path-connected subsets of G‾ by [L1] and step 1.2, so each lies inside a single path component by [A2]; and no path joins a point of one to a point of the other by [L1], so the two lie in different path components. Since G∪Σ=G‾, the path components are exactly G and Σ. This is claim 2.

step 1.2L1A2
3.1

Local connectedness holds at every point of G: let p∈G and let U be open in G‾ with p∈U. Then U∩G is open in G‾ by step 2.1, hence open in G by [A5], G being open; G is locally connected by [L1], so there is V open in G and connected with p∈V⊆U∩G; and V is open in G‾ by [A5].

step 2.1L1A5
4.1

Local connectedness fails at every point of Σ by [L1]; with step 3.1 this shows the failure set is exactly Σ, which is claim 4.

step 3.1L1A5∎

Remarks

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

64 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