Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-21
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 topologist's sine curve is connected

Statement

The topologist's sine curve S={(x,sin⁡(1/x)):0<x≤1}∪({0}×[−1,1]) is connected.

Facts & Assumptions

Given: The graph C:={(x,sin⁡(1/x)):0<x≤1} and the set S:=C∪({0}×[−1,1]) in R2.

[L6]

The positive naturals are cofinal, and for every real ε>0 some positive integer N satisfies 1/N<ε (Every complete ordered field is Archimedean, For every ε>0 in a complete ordered field there is a natural n≥1 with 1/n<ε).

[L9]

The number π=2γ is positive because the smallest positive zero of cosine satisfies γ∈(0,2) (Pi as twice the smallest positive zero of cosine, Cosine has a smallest positive zero, lying strictly between zero and two).

Proof

technique · direct
1.1L1L2L3L7

The interval (0,1] is connected by [L1]. The map h(x):=(x,sin⁡(1/x)) has continuous components by [L7], so it is continuous by [L3]. Its image C is therefore connected by [L2].

1.2L4L5L6L9chooseconstructalgebra

Fix y∈[−1,1]. By [L4], choose u∈R with sin⁡u=y. By [L6] and [L9], choose a positive integer N with u+2πN≥1. For j∈N, put rj:=1/(u+2π(N+j)). Then 0<rj≤1, rj→0, and [L5] gives sin⁡(1/rj)=y. Thus (rj,y)∈C and (rj,y)→(0,y), so (0,y)∈C‾.

2.1step 1.1step 1.2L8∎

Since y was arbitrary, step 1.2 gives {0}×[−1,1]⊆C‾. Hence C⊆S⊆C‾, and [L8] applied to the connected set from step 1.1 proves that S is connected.

Depends on

Used by

Dependency tree · two levels

74 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