Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-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.

Fibration connecting map

Definition

Let p:(E,e0)(B,b0) be a based Serre fibration and let F=p1(b0), with basepoint e0, as in Fiber and fiber homotopy equivalence. For n1, represent [b]πn(B,b0) by a based cube b:InB as in Higher homotopy group by based cubes. Write uIn1 and tI for its coordinates. The distinguished face is t=0; the union J of all other faces is the relative convention of Relative homotopy classes and groups.

Apply A fibration has path lifting and homotopy lifting relative to a subspace to the homotopy b(u,1s), starting with the constant e0 lift at s=0 and keeping uIn1 fixed. Reversing s gives a lift b~:InE with pb~=b and b~J=e0. Its face a(u)=b~(u,0) lies in F and is based on In1.

The connecting map is p[b]=[a]πn1(F,e0)(n2). For n=1 it is the path component [b~(0)]π0(F,e0). Thus a loop is lifted with its terminal point fixed to e0, and the initial component is recorded. This orientation matters: it need not equal the endpoint component of a lift with initial point e0.

Independence of representative and lift and the homomorphism property for n2 are proved in the next lemma, the declared justifier. No group structure on π0(F) is assumed. Only finite cubical relative lifting is used here, so AC is unnecessary. The fiber is nonempty because e0 is specified.

Depends on

Used by

Dependency tree · two levels

17 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