Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)
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 fibration connecting map is independent of lift and representative

Statement

For a based Serre fibration p:(E,e0)(B,b0) and F=p1(b0), composition induces a bijection p:πn(E,F,e0)πn(B,b0)(n1), a group isomorphism for n2. The connecting map defined by lifting and restricting the distinguished face is independent of both choices, pointed, and a homomorphism for n2. No AC is required.

Facts & Assumptions

[F1]

The connecting construction lifts with all faces other than the last-coordinate-zero face fixed at e0. Fibration connecting map

[F2]

Relative classes, boundary maps and pair maps are well-defined with their stated group ranges. Relative homotopy operations are well defined in their valid degrees

[F3]

Finite CW relative lifting holds without AC, with prescribed bottom and sides, and with reversed lifting time. A fibration has path lifting and homotopy lifting relative to a subspace

Proof

Given: n1 and the based Serre fibration of the statement; write a cube as (u,t)In1×I and J for all faces except t=0.

1.1

A relative representative a has pa=b0 on its entire boundary because a(t=0)F and aJ=e0. Relative homotopies similarly project to based homotopies. Thus composition defines the displayed pointed map; for n2 it preserves coordinate-one concatenation by F2. Given an absolute representative b in B, F1 constructs a lift constant on J, hence a relative representative with projection exactly b. This proves surjectivity in every degree, including n=1.

F1F2
1.2

Suppose relative representatives a0,a1 have based-homotopic projections, through b(u,t,r), rI. Treat (u,r)In1×I as the parameter disk and lift in reversed t-time. At t=1 prescribe e0 everywhere. On the parameter boundary prescribe a0(u,t) at r=0, a1(u,t) at r=1, and e0 on uIn1. These prescriptions agree on intersections, and project to b there because the base homotopy is based. F3 extends them over the full cylinder. At t=0 the lift lies in F, since b(u,0,r)=b0; on every J face it is e0. It is therefore a relative homotopy from a0 to a1. For n=1 the parameter disk is just the r interval and its two endpoints carry the two given paths, so the same argument proves injectivity of pointed sets.

F2F3
2.1

Steps 1.1–1.2 prove bijectivity. The connecting map equals the relative boundary map of F2 composed with the inverse bijection. Consequently both arbitrary lift choices and representative changes give the same output. For n2 a bijective homomorphism has a homomorphic inverse, so this composite is a homomorphism. For n=1 it is a pointed map: the constant base representative admits the constant e0 lift, whose initial component is distinguished.

F1F2step 1.1step 1.2
3.1

Specifying e0 excludes empty fibers and empty total/base spaces; zero-dimensional boundary cubes when n=1 record points, not a nonexistent relative π0. Constant cubes and point spaces are included by the same construction. All extension domains above are finite cubes with finite subcomplexes; F3 therefore uses only finitely many existential witnesses, and no AC. The equations at t=0,1 and r=0,1 establish every required endpoint condition.

F3step 1.2step 2.1

Depends on

Used by

Cited to discharge well-definedness by Fibration connecting map.

Dependency tree · two levels

16 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