Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-14
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.

Postnikov k-invariant

Definition

Assume AC, let (X,x0) be a connected based space, and let n2. Put A=πn(X,x0). Present the Postnikov-stage map by a based fibration

K(A,n)PnXqnPn1X

with the identification of the fiber over the specified basepoint with K(A,n) fixed. Its primary obstruction to a section, in the sign convention of the local cellular obstruction cochain, is the (n+1)st Postnikov k-invariant

kn+1(X):=on+1(qn)Hn+1(Pn1X;A).

Here A is the local system whose monodromy is the π1(X,x0)-action on A. If X is simple, this action is trivial and the chosen identification makes A the constant system A, so

kn+1(X)Hn+1(Pn1X;A).

Representability then identifies this class with a based homotopy class

κn+1:Pn1XK(A,n+1).

A fiber-homotopy-equivalent stage, together with the stated base and fiber-group identifications, transports the obstruction class to the same k-invariant. If those identifications are changed, the corresponding automorphism of A acts on the class. For a nontrivial π1-action, the local-coefficient class above is still the definition, but no untwisted cohomology formula or ordinary map to K(A,n+1) is asserted here.

Depends on

Used by

Dependency tree · two levels

24 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