Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 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.

Obstruction theory for lifting through a fibration

Statement

Assume AC and n1. Let p:EB be a Serre fibration with path-connected simple fiber F, let (X,A) be a relative CW complex, and let f:XB. If a lift

g:XnAE,pg=fXnA,

has been fixed, then its next obstruction is a canonical class

on+1(g)Hn+1(X,A;fΠnF).

Here fΠnF is the local system obtained by transporting πn of the fibers along f; “simple” means that the change-of-basepoint action inside a fiber is trivial in the degree used. The class vanishes if and only if, after changing g on the relative n-cells rel Xn1A, the lift extends over Xn+1A.

If πi(F)=0 for i<n, the lift through XnA exists whenever the lower relative lifting problem has been solved, and the displayed class is the choice-independent primary obstruction. A numerable fiber bundle satisfies the fibration hypothesis by the published numerable-bundle theorem. For finite relative cell sets, only finite choice is used.

Facts & Assumptions

[F1]

The pullback construction identifies lifts of f with sections of q:fEX (Hurewicz and serre fibrations).

[F2]

A fibration has path lifting and homotopy lifting relative to a subspace supplies relative lifting for the finite CW pairs Sn×I and their cubical prisms in a Serre fibration. Higher homotopy basepoint transport and moving homotopies supplies the endpoint-path correction on based πn. The varying-fiber local system is constructed in Step 1.2 below; the fixed-target system for a map into one space is not being used as its source.

[F3]

For one relative (n+1)-cell, the lifted attaching sphere determines an element of the transported πn(F), and it is zero exactly when the section extends across that disk.

[F4]

In ordinary primary obstruction theory the signed cellular incidence calculation gives δθ=0 (The primary obstruction cochain is a cocycle).

[F5]

The ordinary prism calculation gives δd=θ(s0)θ(s1) (The primary obstruction class is independent of cellular choices).

[F6]

The ordinary realization theorem changes an n-stage map on each relative n-cell, keeping the prior skeleton fixed, by inserting prescribed sphere representatives; it expressly does not claim a homotopy on the n-skeleton (Vanishing of the primary obstruction is equivalent to extension over the next skeleton).

[A1]

AC is used only for simultaneous representatives and lift extensions over arbitrary cell families (The Axiom of Choice).

Proof

Given: p, (X,A), f, g, and [A1] as in the statement.

1.1

Form fE={(x,e):f(x)=p(e)} with projection q(x,e)=x. The map g corresponds to the section s(x)=(x,g(x)), and conversely a section has second coordinate a lift. Pullbacks preserve the Serre lifting property.

F1
1.2

Construct the coefficient system for the varying fibers. For a base path γ:bc and a chosen lift γ~ beginning at eFb and ending at eFc, lift the constant-in-the-sphere-coordinate homotopy γ on Sn×I, prescribed on Sn×{0}{}×I by a based sphere map a:SnFb and γ~. The top face gives a based sphere map into (Fc,e). Relative lifting on a second parameter cube shows that homotopic based sphere representatives give homotopic top faces, while lifting the two halves of the cubical concatenation and comparing along their common face shows preservation of the πn group law. Reversing γ gives an inverse up to the based retracing-prism homotopy, so this is an isomorphism πn(Fb,e)πn(Fc,e). The same relative lifting on a square compares two path lifts and an endpoint-fixed homotopy of base paths; the top edge of that square is a path between their endpoint basepoints in Fc. Correcting by its basepoint transport from [F2] makes the maps agree. A two-interval prism compares a concatenated path with successive transports. Because the fiber is simple in degree n, loops in a fiber act trivially on πn, so the correction does not depend on the comparison edge; for n=1 this is precisely the stated abelian/trivial-conjugation condition. The resulting maps depend only on endpoint-fixed base-path classes, preserve composition, and are invertible. Consequently bπn(Fb) is an abelian local system ΠnF on the relevant base component, and pulling it back along f gives the stated fΠnF. This uses only finite cubical lifting for each supplied path; [A1] is needed later for simultaneous choices over arbitrary cells.

F2A1
2.1

Let ϕ:(Dn+1,Sn)(Xn+1A,XnA) be a characteristic map for the pullback section of Step 1.1. Contract Dn+1 to its center and lift that contraction along q on the boundary section. The terminal boundary map lies in the fiber over the center and defines

F2step 1.1

os(ϕ)πn(Fϕ(0)).

Reversing the contraction and applying the relative homotopy lifting property shows that a nullhomotopy of this sphere produces a section over Dn+1 agreeing with s on Sn. Conversely, any such section supplies that nullhomotopy. This proves [F3], not merely one implication. [F2, F3]

3.1

Choose orientations, lifts of relative cells, and whiskers. Step 2.1 assigns a value to every relative (n+1)-cell. Replacing a whisker by a loop applies precisely the fiber-transport automorphism of [F2], while a deck translate applies the corresponding equivariance rule. The values therefore form a well-typed cellular cochain

F2step 2.1

θn+1(s)Cn+1(X,A;fΠnF).

[F2, step 2.1]

4.1

Evaluate the cochain of Step 3.1 on the boundary of one relative (n+2)-cell. Pull everything back to its characteristic disk. Lifting its radial contraction identifies all boundary fiber groups, and the signed incidence sum is the boundary of the single lifted sphere datum on that disk. It is zero in πn(F) because a boundary is null in the relative homotopy exact sequence. Undoing the transports restores exactly the local-coefficient incidence formula. Hence δθn+1(s)=0.

F2F4step 3.1
5.1

A different cellular contraction, whisker, or partial section gives a fiberwise prism. Applying the signed boundary calculation of Step 4.1 to that prism yields the identity recorded in [F5]:

δd(s0,H,s1)=θn+1(s0)θn+1(s1).

Thus on+1(g)=[θn+1(s)] is independent of those choices while the preceding-stage lift is fixed up to homotopy. [F5, step 4.1]

6.1

If the class from Step 5.1 is zero, write θn+1(s)=δd. On a relative n-cell, lift a contraction of its base disk to transport the given section to a map into the center fiber. Apply the relative pinch construction of [F6] there, inserting a signed sphere representative of d(en) while fixing the boundary. Lift the reversed contraction relative to the boundary; the resulting map is again a section over the cell and agrees with s on Xn1A. AC chooses the sphere representatives and relative lifts simultaneously over all cells. The fiberwise prism calculation of Step 5.1 then gives θn+1(sd)=θn+1(s)δd=0. Step 2.1 extends sd over every relative (n+1)-cell, and the CW pushout glues the extensions. Conversely, an extended section has zero cell values, so its class, and hence the class of the original partial lift, is zero.

A1F3F5F6step 2.1step 5.1
7.1

If πi(F)=0 for i<n, every earlier cell obstruction group is zero. Induction gives a lift through the n-skeleton, and the same prism identity shows that any two such lifts have the same primary class. If the original map is a numerable bundle projection, the published theorem makes it a Hurewicz and therefore a Serre fibration, so all preceding steps apply. AC is confined to [A1], and finite cell families require only finite choice.

A1F2F5step 6.1

Depends on

Used by

Dependency tree · two levels

37 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