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 classifying space of a discrete group is a K(G,1)
Statement
Assume AC. For a discrete group , Milnor's is connected and
Consequently any connected CW model of is an Eilenberg--Mac Lane space .
Facts & Assumptions
The loop comparison gives for and identifies with (The based loop space of BG recovers G weakly).
A discrete group has components indexed by its elements and has zero positive homotopy groups.
is contractible and its orbit map is surjective (Milnor's join model is a contractible free G-space).
AC is inherited exactly from the loop comparison and its numerable-bundle lifting construction (The Axiom of Choice).
Proof
Given: A discrete group and [A1].
Assume AC, exactly as required by the loop comparison [F1]. By [F3], is path connected. Its continuous surjective image is therefore path connected. By [F1, F2], for we have , and the component part of the same fiber sequence gives . With right-action conventions this identification may differ from the chosen concatenation convention by inversion, which is the canonical isomorphism .
A connected CW model preserves all these homotopy groups. It therefore has fundamental group and no higher positive homotopy groups, exactly the definition of . The trivial group gives a contractible connected model and is included.
Depends on
Used by
- Real projective infinity as BZ/2 Example
Dependency tree · two levels
13 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
- James Davis and Paul Kirk, Lecture Notes in Algebraic Topology (standard reference, not scraped)
- Dale Husemoller, Fibre Bundles, Third Edition (standard reference, not scraped)