Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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.

Homotopy-fiber weights reduce to componentwise ratios

Statement

Let f:X→Y be a map of locally finite homotopy types, let y∈π0(Y), and let α∈Qc(X). For each component x∈π0(X) mapping to y, put

rf(x,y):=∏j>0∣πj(X,x)∣(−1)j∣πj(Y,y)∣(−1)j+1.

Then the total homotopy weight of the components of the fiber over y that map to x is rf(x,y). Consequently,

f!(α)(y)=∑x∈π0(X)f(x)=yα(x)rf(x,y).

In particular, every homotopy fiber is locally finite and the defining sum for f! is finite.

Facts & Assumptions

Given: A map f:X→Y of locally finite homotopy types and a component y of Y.

[F1]

All homotopy groups of X and Y are finite and vanish above some degree (Locally finite homotopy types and rational cardinality).

[F2]

A map factors as X→jfEf→pfY, where jf is a homotopy equivalence and pf is a Hurewicz fibration (Mapping path factorization).

[F3]

A based Serre fibration has the long exact sequence of homotopy groups, with the exact pointed-set component tail; the result is choice-free (Long exact sequence of homotopy groups of a fibration).

[F4]

The homotopy fiber of f is the fiber of its mapping-path replacement (Homotopy fiber of a map).

Proof

1.1F1F2F3F4algebra

Replace f by the mapping-path fibration pf in [F2]. For a component x mapping to y, let Px⊆π0(Fy) be the components mapping to x. A point z∈Px bases the fiber over y; pf is a Hurewicz, hence Serre, fibration, and jf identifies its total-space homotopy groups with those of X, so [F3] applies. Its pointed-set tail identifies Px as one orbit of π1(Y,y), with stabilizer the image of π1(X,x)→π1(Y,y); hence ∣Px∣=∣π1(Y,y)∣/∣im⁡(π1(X,x)→π1(Y,y))∣. For z∈Px, the group tail includes π2(Y,y)→π1(Fy,z)→π1(X,x)→π1(Y,y), so π1(Fy,z) need not be the kernel of the last map. All groups are finite, and exactness makes the fiber groups vanish in high degrees. Expanding each finite group order as the product of its kernel and image orders through this entire tail, and using the displayed orbit count at its pointed-set end, gives ∣Px∣=rf(x,y)∏j>0∣πj(Fy,z)∣(−1)j+1. The action transports components within Px, so their higher homotopy groups have the same orders.

2.1F1step 1.1algebra

The total weight of the fiber components mapping to x is ∣Px∣ times the weight of one of them, since their homotopy-group orders agree by step 1.1. Multiplying its formula by ∏j>0∣πj(Fy,z)∣(−1)j cancels the fiber factors and gives rf(x,y).

3.1F1step 1.1step 2.1∎

Substitute the componentwise identity of step 2.1 into the defining fiber sum for f! and group terms by their image component x. Each Px is finite by step 1.1, and only finitely many x have α(x)≠0, so this gives the stated ratio formula and the finiteness of f!(α)(y).

Depends on

Used by

Cited to discharge well-definedness by Locally finite homotopy types and rational cardinality.

Dependency tree · two levels

13 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