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.
Cartan coherence for higher diagonals
Statement
Work over . Put , , and let and be Alexander--Whitney and shuffle. If interchanges the two factors output by a higher diagonal and regroups
define degree- maps
Let interchange the two blocks. There are natural degree- maps , with , such that
These homotopies preserve both relative carriers: for and , they carry into and into .
Facts & Assumptions
Given: Spaces , their ordinary unnormalized mod-two singular chains, and a fixed natural higher-diagonal system.
The higher diagonals satisfy (Natural higher diagonal approximations).
The Alexander--Whitney formula is a finite sum of tensor products of face restrictions (Alexander–Whitney map and diagonal approximation).
The shuffle and Alexander--Whitney are natural chain-homotopy inverses on ordinary unnormalized chains without AC (Alexander--Whitney and shuffle are natural chain-homotopy inverses).
A specified homotopy has a finite prism operator satisfying the singular chain-homotopy identity (The singular chain homotopy formula).
The higher diagonals are natural (Natural higher diagonal approximations).
The higher diagonals preserve the chain complexes of subspaces (Natural higher diagonal approximations).
Proof
Proof technique: compare two equivariant chain maps in the same explicit fourfold acyclic carrier.
Record the diagonal on the mod-two resolution. [given] Let have one free-orbit generator in every degree , with and . Define
With the diagonal action on , this is a chain map. Indeed, expanding makes every term with occur twice after the index shifts and ; the two endpoint terms that remain are exactly . All sums are finite.
Fix an explicit contraction of every common fourfold model carrier. [F4] For a standard simplex , let be the prism from its affine contraction to the first vertex. By [F4], , where collapses to a point and includes that vertex. On the unnormalized point complex, whose degree- generator is , put for odd and for even . Directly, . Hence
satisfies . On a tensor of four standard simplex complexes use , where each is its augmentation projection. The mixed terms cancel, giving a fixed with . Thus every positive-degree cycle and every augmentation-zero degree-zero cycle has the specified filling . Every displayed operator is a finite sum, so this family of contractions is fixed without AC.
Assemble the two displayed families into equivariant maps. [F1, F3, F5, step 1.1] Define . This is the composite obtained by shuffling to , applying the equivariant higher diagonal there, and applying to its two outputs. Define by first applying , then applying the two higher-diagonal systems and finally regrouping with . The factor in is precisely the twist in . Naturality and the chain-map identities in [F1]--[F3], together with step 1.1, show that both are -equivariant chain maps
where acts on the target by .
Construct the coherent homotopy. [step 1.2, step 2.1] Induct first on and then on . Suppose and the values of on lower-dimensional model generators are known. On the identity model generator form
The chain-map equations for and from step 2.1 and the already established lower equations give ; the two augmentation-preserving maps agree in total degree zero, so the remaining degree-zero case has augmentation zero. Set and extend to arbitrary by postcomposition. Taking its boundary gives exactly
The postcomposition formula proves naturality. The fixed contractions and the lexicographic recursion use no choice principle.
The construction preserves the stated relative carriers. [F2, F3, F6, step 1.2, step 3.1] If lands in , every occurrence of in the two maps and in the model filling lands in ; the other factor remains in . The same argument applies when lands in . Linearity gives the assertions for their generated subcomplexes and for their sum. Empty factors give zero complexes; zero chains and are included by ; one-point and degenerate singular simplices remain in the unnormalized model. Hence every boundary case obeys the same equation. ∎
Depends on
Used by
Dependency tree · two levels
14 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
- Mosher and Tangora, Cohomology Operations and Applications (standard reference, not scraped)