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.
Evaluation is a numerable bundle and Hurewicz fibration
Statement
Assume the Axiom of Choice. Let be the closed unit disc, let be the fixed base configuration of Boundary-fixed mapping class group of a punctured disk, let
with the compact-open topology on the homeomorphism groups, and let , , be the evaluation map. Then:
- is a locally trivial fiber bundle with fiber in the sense of Locally trivial fiber bundle;
- the bundle is numerable: the same charts come with a locally finite partition of unity whose supports are subordinate to their domains;
- consequently is a Hurewicz fibration.
All three assertions include , where is a one-point space and the bundle is trivial.
Facts & Assumptions
Given: The Axiom of Choice, the closed disc , the fixed marked tuple , and the evaluation map .
The evaluation map is surjective, and every configuration has an open neighbourhood with a continuous section satisfying (Continuous local sections for disk point evaluation).
A locally trivial fiber bundle with fiber is a continuous , an open cover and homeomorphisms with ; it is numerable when the data include a locally finite partition of unity with and sum one (Locally trivial fiber bundle).
Assume AC and DC: every open cover of a metric space admits a locally finite partition of unity subordinate to it (Under choice and dependent choice, metric open covers admit locally finite subordinate partitions of unity).
The Axiom of Choice implies the Axiom of Dependent Choice, which implies countable choice (AC implies DC implies countable choice).
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 (Numerable fiber bundles are hurewicz fibrations).
The Axiom of Choice selects an element from each member of every family of nonempty sets (The Axiom of Choice).
with quotient map , points written , and consists of the tuples with pairwise distinct coordinates (Unordered configuration spaces , Ordered configuration spaces ).
is the stabiliser of the marked set and is the group of boundary-fixing homeomorphisms, both with the compact-open topology, and composition is continuous (Boundary-fixed mapping class group of a punctured disk).
Proof
Local product charts. Let and let and be the neighbourhood and continuous section provided by [L1]; the evaluation map is continuous because for one has for all and the quotient map of [L7] is continuous. Define For the composite lies in : applying it to the set gives because as sets. The map is continuous, being built from , the continuous section, inversion and composition, which are continuous by [L8]; it satisfies ; and it is a bijection with inverse , because and , while the other composite is the identity by the same computation. Hence the maps are local product charts over the open cover and is a locally trivial fiber bundle with fiber as in [L2]; the fibre over is exactly by [L8].
Numerating data. For , give the ordered configuration space the metric and set Coordinate permutations are isometries, so this is independent of representatives and symmetric. The finite minimum is zero exactly for equal orbits; composing minimizing permutations and applying the triangle inequality for gives the triangle inequality for . Moreover the preimage of the -ball about of radius is the union of the permutation translates of the ordered -ball about , hence is open. Conversely, the preimage of a quotient-open neighbourhood of contains an ordered ball about and is permutation-invariant, so it contains that union. Thus gives exactly the quotient topology of [L7]. For , is a singleton and is metrizable. The family is therefore an open cover of the metric space . By [L6] choose one such pair for each ; using AC we also obtain DC and countable choice by [L4], so [L3] supplies a locally finite partition of unity subordinate to the cover with all sums equal to one. Since each support satisfies , the charts of step 1.1 together with this partition are exactly the numerating data required in [L2]; hence the bundle is numerable.
The fibration. By [L5] and AC the numerable bundle just produced, with its displayed charts and partition of unity, is a Hurewicz fibration. The same argument applies for , where is a one-point space: the unique chart identifies with the fibre, the constant partition with value one is locally finite, and the bundle over a point is a Hurewicz fibration.
Remarks
- Choice selects one section chart for each base configuration. The Axiom of Choice also implies dependent choice, used for the subordinate partition of unity, and the published numerable-bundle theorem uses it to well-order finite chart words.
- The local section charts were selected once for the open cover in step 2.1. The partition and numerable-bundle theorem then supply the homotopy lifting property without choosing a separate lift for each path.
Depends on
- The Axiom of Choice
- Unordered configuration spaces $C_n(X)$
- Ordered configuration spaces $F_n(X)$
- Locally trivial fiber bundle
- Boundary-fixed mapping class group of a punctured disk
- Continuous local sections for disk point evaluation
- Under choice and dependent choice, metric open covers admit locally finite subordinate partitions of unity
- AC implies DC implies countable choice
- Numerable fiber bundles are hurewicz fibrations
Used by
Dependency tree · two levels
46 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
- Joan S. Birman and Tara E. Brendle, Braids: A Survey, section 1.3 and the proof of Theorem 1, author manuscript pp. 5-7 (standard reference, not scraped)
- Dale Husemoller, Fibre Bundles, Chapter 4 discussion of numerable bundles (standard reference, not scraped)