Alphabeta Math
TheoremStatement: 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.

Numerable fiber bundles are hurewicz fibrations

Statement

Assume AC. Every numerable fiber bundle, with its supplied ordinary local product charts and support-subordinate locally finite partition of unity, is a Hurewicz fibration in all ordinary spaces. In particular a bundle of CGWH spaces with these charts is a Hurewicz fibration in CGWH. AC is used to well-order the set of finite chart words. No selection of a chart for every base point or of a separate lift for every path is made.

Facts & Assumptions

[F1]

Numerating data are charts θi:p1(Ui)Ui×F and a locally finite partition ρi with closed support contained in Ui. Locally trivial fiber bundle

[F2]

Hurewicz HLP requires a jointly continuous lift for every initial map and base homotopy. Hurewicz and serre fibrations

[F3]

Evaluation and transposition for compact-open interval paths hold for arbitrary spaces. Interval exponential law and quotient homotopies

[F4]

A locally finite family of continuous nonnegative functions has continuous sum. A locally finite family of continuous nonnegative functions has a continuous pointwise sum

[F5]

Finite minima, maxima, sums and quotients with nonzero denominator of continuous real maps are continuous. Sums, products, absolute values, finite maxima and minima, and quotients of continuous real-valued maps on a topological space are continuous where defined

[F7]

Under AC a set admits a well-order. The well-ordering theorem

Proof

Given: The F1 bundle data indexed by a set S, AC, I=[0,1], and the ordinary compact-open path space P=C0(I,B).

1.1

For each nonempty finite word T=(i1,,in) in S, repetitions allowed, put Jj=[(j1)/n,j/n] and λT(α)=minjminvJjρij(α(v)). Extrema exist by F6. These functions are continuous on P: for a fixed α, index all closed interval neighbourhoods on which each relevant original real-valued composite varies by less than ε/3, and take finitely many whose relative interiors cover each Jj. Requiring β to map each selected compact interval into the inverse image under the relevant ρi of the ε/3-enlargement of its original value range is a finite compact-open condition. On it the original and new values at every time differ by less than ε; minima differ by at most the same bound. Finite minima over j preserve continuity by F5.

F3F5F6F9
1.2

Let VT={α:α(Jj)Uij for all j}, an open compact-open set. We have suppλTVT. Indeed, outside VT some α(v) lies outside Uij and hence outside the closed support of ρij. The evaluation neighbourhood requiring β(v) to remain outside that support is open and makes λT(β)=0. Thus that α is outside the support. This argument uses neighbourhoods, not sequential convergence.

F1F3
1.3

For each α some λT(α)>0. The inverse images of the cozero sets of ρi cover I. Consider all pairs of a centre and a positive radius whose relative interval of twice that radius lies in one cover member. Their smaller intervals cover I; choose a finite subcover and a positive minimum of its finitely many radii. Every sufficiently short subinterval lies in one of the corresponding larger intervals: take a point in the short interval, place it in a chosen smaller interval, and use the radius bound on its diameter. Thus a sufficiently fine equal subdivision has every closed Jj contained in one cozero inverse image. Finitely many index choices give a word; each selected continuous positive function has positive minimum on its Jj by F6. Also, for fixed n, the family λT, T=n, is locally finite: cover the compact image α(I) by neighbourhoods meeting only finitely many cozero sets of the original partition, extract finitely many, and take their union O. The neighbourhood {β:β(I)O} meets cozero λT only for words in a fixed finite alphabet, hence only finitely many length-n words. No infinite pointwise choice was made.

F1F6F9
2.1

Put γT=max(0,λTnR<nλR) for T=n. The shorter sum is locally finite by step 1.3, hence continuous by F4; F5 proves continuity of γT, with 0γTλT1. At each α, the least length with a positive λT has zero shorter sum, so some γT(α)>0. The full family is locally finite: choose R of length N with λR(α)>0 and a neighbourhood on which it exceeds c>0. For n>N and nc1, every γT of length n vanishes there. Only finitely many lengths remain, each locally finite by step 1.3. Intersect finitely many corresponding neighbourhoods.

F4F5step 1.1step 1.3
2.2

For αVT and 0st1, define LT(α,e,s,t) by transporting e successively across the intersections of [s,t] with J1,,Jn. In chart j a segment [a,b]Jj sends the current point z to θij1(α(b),prFθij(z)); empty segments act identically. After chart j the base point is α(min(t,max(s,j/n))), which proves that the next nonempty segment starts at the current base point. For continuity use the finite closed cases t(j1)/n, sj/n, and sj/n, t(j1)/n. On the third case the segment endpoints are max(s,(j1)/n) and min(t,j/n). The other cases use identity. At overlaps the segment has length zero and the chart formula equals identity, so F8 pastes them continuously. F1 and F3 make each nonempty chart formula continuous on its domain, including the incoming point. Iterate finitely many times. In particular LT(α,e,s,s)=e exactly.

F1F3F5F8step 1.2
3.1

Set G=TγT>0 and wT=γT/G. By step 2.1 and F4–F5 these are continuous, locally finite, sum to one, and suppwTsuppλTVT. Use AC, precisely through F7, to well-order the set of words. Put aT=R<TwR and bT=aT+wT; subfamilies are locally finite so these are continuous. At any fixed path the finitely many positive weights, in their induced order, give consecutive intervals [aT,bT] filling [0,1].

F4F5F7step 1.2step 2.1
4.1

Given (e,α) with p(e)=α(0) and an endpoint time t, process the finitely many positive-weight words in order, applying LT on [min(t,aT),min(t,bT)]. Consecutive endpoints agree because their untruncated intervals are consecutive, and clipping preserves this. The result Λ(e,α,t) lies over α(t). At t=0 every segment has length zero, so Λ(e,α,0)=e. Inserting zero-weight words changes nothing, by the exact zero-length identity in step 2.2. Thus the definition is independent of any finite list containing all positive weights.

step 2.2step 3.1
5.1

The map Λ is jointly continuous. Near a fixed α0, local finiteness leaves only finitely many possibly nonzero weights. For a word in that list with α0suppwT, shrink the neighbourhood so that its weight vanishes and discard it. For every remaining word, shrink into VT, using the support inclusion in step 3.1. On this single neighbourhood, Λ is a fixed finite composition of the continuous maps in step 2.2 with the continuous clipped endpoint functions. Each formula is defined even when its weight becomes zero, since the whole neighbourhood is in VT. F8 proves joint continuity, including intervals shrinking to length zero and changes of the active list.

F8step 2.2step 3.1step 4.1
6.1

For an arbitrary initial map f:XE and compatible base homotopy H:X×IB, F3 makes xαx=H(x,) continuous. Then H~(x,t)=Λ(f(x),αx,t) is continuous by step 5.1, starts at f(x) and projects to H(x,t) by step 4.1. This is the full ordinary HLP of F2. When the bundle spaces and test space are CGWH, their interval cylinders have the ordinary topology, so the same ordinary lift is a lift in that category. This conclusion uses the ordinary charts specified in F1 and asserts nothing about merely k-product charts.

F1F2F3step 4.1step 5.1
7.1

If B is empty then E is empty. If F is empty then again E is empty and only empty initial-map domains occur, so HLP is vacuous. Otherwise the construction covers constant paths, a single active word, zero weights and both endpoints without modification. The well-order in step 3.1 is the sole use of AC; all other selections were finite or a single local witness, and chart assignments were supplied data. Thus the theorem, with its exact choice and topology conventions, is proved.

F1step 1.3step 3.1step 6.1

Depends on

Used by

Dependency tree · two levels

55 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