Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 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.

Deg⁡:π1(S1,[0])→(Z,+) is a group homomorphism

Statement

Deg⁡:π1(S1,[0])→(Z,+) is a group homomorphism.

Facts & Assumptions

Given: Loop classes [α],[β]∈π1(S1,[0]).

[L1]

Degree defines a function Deg⁡:π1(S1,[0])→Z by Deg⁡([γ])=deg⁡(γ) (Degree defines a function Deg⁡:π1(S1,[0])→Z).

[L2]

Degree sends concatenation to addition, reversal to negation, and the constant loop to zero (Degree sends concatenation to addition, reversal to negation, and the constant loop to zero).

[L3]

A group homomorphism f:G→G′ is a function satisfying f(xy)=f(x)f(y) for all x,y∈G (Monoid homomorphism and group homomorphism).

[L4]

(Z,+,⋅,0,1) is a commutative ring with multiplicative identity, so (Z,+) is a group (The integers form a commutative ring).

[L5]

The product of fundamental-group classes is [α][β]=[α∗β] (Based loops and the fundamental group).

Proof

technique · direct
1.1L1L2L5

By [L5], [L1], and the concatenation law in [L2], Deg⁡([α][β])=Deg⁡([α∗β])=deg⁡(α∗β)=deg⁡(α)+deg⁡(β)=Deg⁡([α])+Deg⁡([β]).

2.1step 1.1L2L3L4∎

The target is the additive group of the integers by [L4], and step 1.1 is exactly the product-preservation condition of [L3]. Hence Deg⁡ is a group homomorphism. Its identity and inverse laws also agree with the zero and negation formulas of [L2].

Depends on

Used by

Dependency tree · two levels

27 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