Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-10-02
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.

A choice-free continuous section of planar coordinate forgetting

Statement

Let n≥2, write p:Fn(C)→Fn−1(C) and p~:Fn(int⁡D2)→Fn−1(int⁡D2) for the maps forgetting the last coordinate, and let h:C→int⁡D2, h(w)=w/(1+∣w∣), be the radial homeomorphism with inverse h−1(z)=z/(1−∣z∣). Then:

  1. The formula s(z1,…,zn−1):=(z1,…,zn−1, 1+∣z1∣+⋯+∣zn−1∣) defines a continuous section of p, that is p∘s=id⁡Fn−1(C).
  2. Transporting s through the coordinatewise homeomorphisms induced by h yields a continuous section s′=h(n)∘s∘(h−1)(n−1) of p~.
  3. Fix a base configuration q=(q1,…,qn)∈Fn(int⁡D2) and put q′:=(q1,…,qn−1). Then q and s′(q′) both lie in the fibre p~−1(q′), that fibre is path-connected, and any path α in it from q to s′(q′) yields a homomorphism σ:π1(Fn−1(int⁡D2),q′)→π1(Fn(int⁡D2),q) with p~∗∘σ=id⁡, so p~∗ is split surjective on fundamental groups at q.

No choice principle is used.

Facts & Assumptions

Given: an integer n≥2, a base configuration q=(q1,…,qn)∈Fn(int⁡D2) with q′=(q1,…,qn−1), and the radial homeomorphism h(w)=w/(1+∣w∣) with two-sided inverse h−1(z)=z/(1−∣z∣) (A finitely punctured open disk has the homotopy type of a finite wedge of circles).

[F1]

Fm(X)={(x1,…,xm)∈Xm:xi≠xj whenever i≠j} with the subspace topology, and single-coordinate evaluation is a homeomorphism F1(X)≅X (Ordered configuration spaces Fn(X)).

[F2]

The map h:C→int⁡D2, h(w)=w/(1+∣w∣), is a homeomorphism with inverse h−1(z)=z/(1−∣z∣); it preserves arguments and multiplies moduli by the strictly increasing function r↦r/(1+r) (A finitely punctured open disk has the homotopy type of a finite wedge of circles).

[F3]

For a path c:x0→x1 in X the assignment φc([α]):=[(cˉ∗α)∗c] is a group isomorphism π1(X,x0)→π1(X,x1) whose two-sided inverse is φcˉ (Conjugating loop classes by a path is an isomorphism of fundamental groups).

[F4]

Loop classes at a point form a group under first-then-second concatenation, with the constant loop as identity and reversal as inversion (Loop classes form the group π1(X,x0) under concatenation).

Proof

technique · constructive
1.1constructF1given

The plane section. Define s(z1,…,zn−1):=(z1,…,zn−1, 1+∑i<n∣zi∣) on Fn−1(C). The last coordinate is a positive real number and 1+∑i∣zi∣>∣zi∣ for every i, so it differs from each of z1,…,zn−1; the first n−1 coordinates are pairwise distinct because (z1,…,zn−1)∈Fn−1(C) by [F1]. Hence s takes values in Fn(C). The absolute-value and sum operations are continuous, and a tuple of continuous coordinate maps is continuous, so s is continuous; forgetting the last coordinate returns the given tuple, that is p∘s=id⁡.

1.2constructF1given

Complements of finite sets in the disc are path-connected. Let Q⊆int⁡D2 be finite and let x,y∈int⁡D2∖Q. If x=y the constant path joins them, so assume x≠y and choose r with max⁡{∣x∣,∣y∣}<r<1 and r≠∣w∣ for every w∈Q; only finitely many radii are forbidden, so such an r exists, and then the circle Cr={z:∣z∣=r} is disjoint from Q and contains x,y in its interior. For each w∈Q let Rx(w):={x+t(w−x):t≥1} and Ry(w):={y+t(w−y):t≥1} be the rays from x and from y through w extended beyond w; each meets Cr in at most one point, so only finitely many points of Cr are excluded. Choose z∈Cr outside this finite excluded set. If some w∈Q lay on the segment [x,z], then z=x+t(w−x) with t≥1, contradicting the exclusion of z; thus [x,z]∩Q=∅, and likewise [z,y]∩Q=∅. Both segments lie in int⁡D2 because that disc is convex and all three endpoints do, so the concatenation [x,z]∪[z,y] is a path in int⁡D2∖Q from x to y.

1.3F3F4

Conjugation and the constant loop. By [F3] every path c from x0 to x1 gives an isomorphism φc:π1(X,x0)→π1(X,x1) with inverse φcˉ; by [F4] the constant loop at a point represents the identity class, so if c is the constant path at x0 then φc is the identity map of π1(X,x0), since (cˉ∗α)∗c differs from α only by insertions of constant loops at the endpoints.

2.1constructstep 1.1F2

The disc section. Put s′:=h(n)∘s∘(h−1)(n−1) on Fn−1(int⁡D2), where h(k)(u1,…,uk):=(h(u1),…,h(uk)); explicitly s′(v1,…,vn−1)=(v1,…,vn−1, h(1+∑i<n∣ui∣)) with ui=h−1(vi). This is continuous as a composite of continuous maps, and it takes values in Fn(int⁡D2): the last coordinate h(1+∑i∣ui∣) lies in int⁡D2, and it differs from vi=h(ui) because h is injective and 1+∑i∣ui∣=ui is impossible — taking moduli would give 1+∑i∣ui∣=∣ui∣≤∑i∣ui∣. Composing with p~ returns the given tuple, so p~∘s′=id⁡; thus s′ is a continuous section of p~, transported from s as defined.

3.1step 1.2step 1.3step 2.1F3F4discharge-construct

The based splitting. Let F:=p~−1(q′)={(q1,…,qn−1,x):x∈int⁡D2∖{q1,…,qn−1}} be the fibre over q′; it contains q, since qn≠qi for i<n, and it contains s′(q′) by step 2.1. The fibre is homeomorphic to int⁡D2∖{q1,…,qn−1} and hence path-connected by step 1.2 applied to the finite set Q={q1,…,qn−1}. Choose a path α:I→F from q to s′(q′); such a path exists, and choosing it is a single selection, not an instance of AC. Write ι:F→Fn(int⁡D2) for the inclusion and φα:π1(Fn(int⁡D2),q)→π1(Fn(int⁡D2),s′(q′)) for the conjugation isomorphism of [F3], and define σ:=φαˉ∘s∗′:π1(Fn−1(int⁡D2),q′)→π1(Fn(int⁡D2),q), where s∗′ is induced at the basepoint q′ and φαˉ([β])=[(α∗β)∗αˉ]. For [γ]∈π1(Fn−1(int⁡D2),q′), the path p~∘((α∗(s′∘γ))∗αˉ)=(p~∘α)∗(p~∘s′∘γ)∗(p~∘αˉ) has the constant paths p~∘α and p~∘αˉ at q′ as outer factors, because α lies in the fibre over q′, and its middle factor is p~∘s′∘γ=γ by step 2.1; by [F4] and step 1.3 this class equals [γ] in π1(Fn−1(int⁡D2),q′), so p~∗∘σ=id⁡ and p~∗ is split surjective.

The section is explicit, the basepoint adjustment uses one path in one fibre, and no selection over an infinite family is made; the construction is therefore choice-free. ∎

Depends on

Used by

Dependency tree · two levels

32 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