Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17
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.

R/Z is not simply connected

Statement

R/Z is not simply connected.

Facts & Assumptions

Given: The quotient circle with basepoint [0] and its standard loop ω1.

[L1]

R/Z is compact and path-connected (R/Z is compact and path-connected).

[L2]

A based circle loop is nullhomotopic exactly when its degree is zero (A based circle loop is nullhomotopic exactly when its degree is zero).

[L3]

deg⁡(ωn)=n for every integer n (deg⁡(ωn)=n for every integer n).

[L4]

A space is simply connected when it is nonempty and path-connected and its fundamental group has exactly one element at every basepoint (Simply connected topological spaces).

[L5]

The quotient circle contains its basepoint [0] (The circle as S1=R/Z with basepoint [0]).

Proof

technique · direct
1.1L1L5

The quotient is nonempty because it contains [0] by [L5], and it is path-connected by [L1].

1.2L2L3algebra

By [L3], deg⁡(ω1)=1≠0. The criterion [L2] therefore shows that ω1 is not nullhomotopic, so its loop class differs from the constant-loop class.

2.1step 1.1step 1.2L4∎

Thus the fundamental group at [0] does not have exactly one element. Although step 1.1 supplies the other two clauses of [L4], this failure at one basepoint violates the definition, so R/Z is not simply connected.

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