Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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.

Locally finite homotopy types and rational cardinality

Definition

A homotopy type X is locally finite if every homotopy group πi(X,x) is finite for every point x, and for each x there is an integer nx such that πi(X,x)=0 for i>nx.

Write π0(X) for the set of connected components. Let Qc(X) be the rational-valued functions on π0(X) with finite support. For a component x, the homotopy weight is

wX(x):=∏i>0∣πi(X,x)∣(−1)i.

The product is finite because the positive homotopy groups vanish in high degrees; a negative exponent means a reciprocal.

For a map f:X→Y of locally finite homotopy types and α∈Qc(X), define

f!(α)(y):=∑x∈π0(Fy)α(iy(x)) wFy(x),

where Fy is the homotopy fiber of f at y (Homotopy fiber of a map) and iy:Fy→X is its natural map. For a proper map, meaning one whose homotopy fibers have finitely many connected components, also define f∗:Qc(Y)→Qc(X) by f∗β=β∘π0(f).

The ratio lemma Homotopy-fiber weights reduce to componentwise ratios ↗ proves that fibers of maps between locally finite homotopy types are locally finite and that the displayed sum is finite. The set of components of a homotopy fiber alone does not determine f!.

Remarks

For an arbitrary map f:X→Y and a chosen point y∈Y, the unbased homotopy fiber used here is the mapping-path fiber Fy={(x,γ)∈X×YI:γ(0)=f(x), γ(1)=y}, with the path-space and subspace topology of Homotopy fiber of a map, forgetting its required basepoint. No point of X mapping to y is required. If x0∈X satisfies f(x0)=y, the based construction in Homotopy fiber of a map is this same space with the basepoint (x0,cy). If η is a path from y to y′, the map (x,γ)↦(x,γ∗η) has homotopy inverse (x,γ′)↦(x,γ′∗η−1), using path reparameterization and cancellation of η∗η−1. Thus the fiber homotopy type depends only on the chosen target component.

Depends on

Used by

Dependency tree · two levels

3 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