Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6.1-sol)
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.

Simplicial objects, simplicial commutative rings and homotopy groups

Definition

Let Δ be the simplex category: its objects are the finite nonempty ordered sets [n]={0<1<⋯<n} for n≥0, and its morphisms are the order-preserving maps. A simplicial object in a category C is a functor Δop→C (Category, object, morphism, domain, codomain, identity, composition, and hom-collection, Covariant functor, identity functor, composite functor, and contravariant functor). A simplicial set is a simplicial object in sets; a simplicial commutative ring is a simplicial object in commutative rings (Commutative ring), so that each An is a commutative ring and the structure maps are ring homomorphisms (Ring homomorphism: additive, multiplicative, and required to send 1 to 1); a simplicial module over a simplicial ring A∙ is a simplicial object M∙ in abelian groups together with a compatible A∙-action, and the resulting category of simplicial A∙-modules is abelian.

Writing di ⁣:Mn→Mn−1 for the image of the injection [n−1]→[n] omitting i (a face map) and si ⁣:Mn→Mn+1 for the image of the surjection [n+1]→[n] repeating i (a degeneracy map), these maps satisfy the usual simplicial identities didj=dj−1di (i<j),sisj=sj+1si (i≤j),disj={sj−1di,i<j,id,i=j or i=j+1,sjdi−1,i>j+1. Conversely, such a sequence of face and degeneracy maps determines the functor.

The Moore complex of a simplicial abelian group or module M∙ is the chain complex concentrated in nonnegative degrees with Mn in degree n and differential ∂n=∑i=0n(−1)idi ⁣:Mn→Mn−1(n≥1), with ∂0=0; the di are the face maps (Chain complex in an abelian category); the simplicial identities give ∂n−1∂n=0. Its homology is written πn(M∙)=Hn(M∙)(n≥0) (Homology object of a chain complex). By the Dold-Kan normalization theorem this agrees with the classical homotopy-group definition Hn(NM∙) via the normalized subcomplex, so the convention is canonical; no model-category machinery is introduced here.

For a simplicial commutative ring A∙, each πn(A∙) is defined as above, and π0(A∙)=A0/(d0−d1)(A1) is a commutative ring. The image is an ideal: for a∈A0, multiplying a representative b∈A1 by s0a gives a(d0b−d1b). Every πn(A∙) is a π0(A∙)-module. Indeed multiplication by the totally degenerate simplex of a vertex a∈A0 is a chain map on the Moore complex: its faces are the corresponding totally degenerate simplex of a in the preceding degree. If two vertices are the endpoints of b∈A1, multiplication by the simplicial path defined by b gives a homotopy between these chain maps (the alternating prism sum inserts the degeneracies of b). Consequently (d0−d1)(b) acts as zero on homology, so the action factors through the displayed quotient. Additivity, associativity and the unit descend from levelwise ring multiplication.

A morphism of simplicial commutative rings is a natural transformation A∙→B∙ (Natural transformation and its components). Such a morphism is a weak equivalence when it induces isomorphisms πn(A∙)→πn(B∙) for all n≥0. The category of derived rings is the localization of the category of simplicial commutative rings at the weak equivalences; constructions on derived rings are used below only through statements that are independent of the chosen replacement up to canonical isomorphism.

Depends on

Used by

Dependency tree · two levels

19 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