Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedaudited 2026-09-06
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 normalized homogeneous bar complex

Definition

For the homogeneous complex, let Dn(G) be the Z[G]-submodule of Bn(G) generated by tuples (g0,,gn) with gi=gi+1 for some i. The normalized homogeneous bar complex is the augmented quotient B(G)=B(G)/D(G)Z, The quotient differential is well defined: if gi=gi+1, deleting either of these two entries gives the same tuple with opposite signs in dn, while every other deletion leaves an adjacent equal pair. Thus dnDnDn1 for n1. Here D0=0, and for n=1 the two faces cancel exactly, so the augmentation descends as well. Degeneracy is invariant under diagonal translation, making this a quotient of Z[G]-complexes.

Each Bn(G) is free over Z[G] on the orbits of nondegenerate tuples: every orbit has the unique representative (1,g01g1,,g01gn), and the degenerate tuples span a disjoint union of the other free orbits. The next contractibility and homotopy-equivalence results prove that this augmented free complex is a resolution. Under the coordinates xi=gi11gi, an adjacent equal pair is exactly xi=1. Thus its cochains are the inhomogeneous cochains that vanish whenever one argument is 1.

Depends on

Used by

Dependency tree · two levels

2 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