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.

A based circle loop is nullhomotopic exactly when its degree is zero

Statement

A based circle loop is nullhomotopic exactly when its degree is zero. Here nullhomotopic means path-homotopic relative to the endpoints to the constant loop at [0].

Facts & Assumptions

Given: A based loop α at [0].

[L1]

Two based circle loops are path-homotopic if and only if they have equal degree (Two based circle loops are path-homotopic if and only if they have equal degree).

[L2]

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

[L3]

For every integer n, define ω~n(t)=nt and ωn=p∘ω~n; in particular, ω0 is the constant loop at [0] (The standard circle loops ωn(t)=[nt] for n∈Z).

Proof

technique · direct
1.1L1L2L3

If α is nullhomotopic, then it is path-homotopic to the constant loop ω0 by [L3]. The forward implication of [L1] and [L2] give deg⁡(α)=deg⁡(ω0)=0.

1.2L1L2L3

Conversely, if deg⁡(α)=0, then [L2] gives deg⁡(α)=deg⁡(ω0). The reverse implication of [L1] makes α path-homotopic to ω0, which is the required based nullhomotopy by [L3].

2.1step 1.1step 1.2∎

Steps 1.1 and 1.2 establish both directions of the degree-zero criterion.

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