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 group acting freely on a positive even sphere has at most two elements
Statement
If a group acts freely by homeomorphisms on with , then . If it is nontrivial, it is isomorphic to . The antipodal action realizes the nontrivial case.
Facts & Assumptions
Given: The objects and hypotheses in the statement above.
For , any continuous fixed-point-free map has degree . Consequently, a self-map of any other degree has a fixed point. (A fixed point free sphere map has antipodal degree)
For and continuous sphere self-maps , homotopic maps have the same degree and . Every homotopy equivalence has degree or . (Degree is homotopy invariant and multiplicative under composition)
On for , the identity, a constant map, any single coordinate reflection, and the antipodal map have degrees , , , and respectively. (Degree of identity constant reflection and antipodal sphere maps)
Proof
Let be the homeomorphism associated to . F2 makes a homomorphism , since and a homeomorphism is a homotopy equivalence.
For every , freeness says has no fixed point. F1, in positive even dimension, gives . Thus , so is injective and , including the trivial group. A nontrivial subgroup of is the entire two-element group.
The antipodal involution squares to the identity and has no fixed point on a unit sphere: would imply . Together with the identity it therefore gives a free two-element action, of nonidentity degree by F3.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
7 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
- Hatcher, Algebraic Topology, Proposition 2.29, p.135 (standard reference, not scraped)