Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)
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.

The cyclic cover retracts onto the lifted flower and has a deck-equivariant spine model

Statement

Let W⊆X be the standard flower, a deformation retract of X=D2∖Qn fixing d (The standard flower is a deformation retract with free meridian basis), with its n positively oriented loop edges C1,…,Cn and its tether tree T. For the Burau cover p:X~→X of The Burau infinite cyclic cover, let Σ be the lifted spine: vertices vk (k∈Z), one for each point of p−1d, with Ttkv0=vk, and for each i∈{1,…,n} one edge ei(k):vk→vk+1 for every k∈Z, the positively oriented lift of Ci joining the level-k tree to the level-(k+1) tree; deck translation acts by t⋅vk=vk+1 and t⋅ei(k)=ei(k+1). Then:

(1) the deformation retraction of X onto W lifts to a deck-equivariant homotopy of pairs from (X~,p−1d) onto (p−1(W),p−1d) that fixes every point of p−1d pointwise, so p−1(W) is a deformation retract of X~ by a deck-equivariant homotopy of pairs;

(2) collapsing each lifted tether tree to its root by a fixed contraction of T carried along by the deck action is a deck-equivariant homotopy equivalence of pairs (p−1(W),p−1d)→(Σ,Σ0); hence H1(X~)≅H1(Σ) and H1(X~,p−1d)≅H1(Σ,Σ0) as Λ1-modules;

(3) the cellular chain complexes are free Λ1-modules C1(Σ)=⨁i=1nΛ1ei,C0(Σ)=Λ1v,∂1ei=(t−1)v, and C1(Σ,Σ0)=⨁i=1nΛ1ϵi, C0(Σ,Σ0)=0, where ei=ei(0), v=v0 and ϵi is the relative class of the level-0 i-th edge; consequently H1(Σ)=ker⁡∂1 is free of rank n−1 with basis ei−en (1≤i≤n−1), and H1(Σ,Σ0)=C1(Σ,Σ0) is free of rank n with basis ϵ1,…,ϵn. No choice principle is used.

Facts & Assumptions

Given: n≥1 (the Burau cover exists under this hypothesis, as in The Burau infinite cyclic cover); the flower W=T∪⋃i=1nCi with its tether tree T=⋃iti and the truncated stems si meeting only at d and satisfying T∩Ci={pi}; the cover p:X~→X with deck group Deck⁡(X~/X)={Ttk:k∈Z} and t=Tt1, where t raises total winding by 1 (The standard flower is a deformation retract with free meridian basis, Standard meridians of a punctured disk, The Burau infinite cyclic cover).

[F1]

The deformation retraction of X onto W has the form H:X×I→X with H(x,0)=x, H(x,1)=r(x)∈W, and H(w,u)=w for all w∈W; the tree T is simply connected and T∩Ci={pi} (The standard flower is a deformation retract with free meridian basis, Standard meridians of a punctured disk).

[F2]

Homotopies through a covering lift uniquely once an initial lift is fixed, and two lifts from a connected space agreeing at one point agree everywhere; the lifting criterion applies to based maps from path-connected locally path-connected spaces (Existence and uniqueness of homotopy lifts through a covering map, Two lifts from a connected space that agree at one point agree everywhere, Lifting criterion for maps from path-connected locally path-connected spaces, Existence and uniqueness of path lifts through a covering map).

[F3]

The restriction of a covering q:E→B to an arbitrary subspace A⊆B is a covering q−1(A)→A: if V is evenly covered with sheets Vj, then V∩A is evenly covered with sheets Vj∩q−1(A), each mapped homeomorphically onto V∩A. The published statement covers the open case (Covering spaces are stable under restriction, finite products, and pullback, Covering maps, evenly covered neighbourhoods, fibres, sheets, and trivial coverings).

[F4]

The deck group acts freely on X~, and a deck transformation is determined by its value at one point of a connected total space (On a connected covering space, a deck transformation is determined by one point and the deck action is free, Deck transformations and the deck-transformation group of a covering).

[F5]

W is a finite graph, hence a one-dimensional CW complex with weak topology; a locally finite graph embedded in a Hausdorff space carries the weak topology, and its cellular chain complex in degree one is free on the oriented edges with d1(e)=[end]−[start] under the above conventions (CW complex with closure finiteness and weak topology, Oriented cellular chain group, Cellular boundary from three consecutive skeleta, Relative connecting homomorphism on cycles, Cellular homology).

[F6]

Cellular homology computes singular homology, naturally with respect to cellular maps; a homotopy equivalence induces homology isomorphisms; a map of pairs induces a commuting morphism of the pair long exact sequences, so the five lemma identifies relative homology when the absolute and subspace maps are isomorphisms (Cellular homology computes singular homology, Homotopy equivalences induce isomorphisms on singular homology, Long exact sequence of a pair, Naturality of the pair long exact sequence, The Five Lemma for modules).

[F7]

Λ1=Z[t±1] is an integral domain and t−1≠0; the module Mred=H1(X~;Z) carries the Λ1-action t↦(Tt)∗ (Units, powers and the domain property of the Laurent polynomial ring, The reduced Burau homology module).

Proof

technique · direct
1.1F3

Restriction of the cover to the closed subspaces T and W. Let q:E→B be a covering and A⊆B any subspace. For a∈A choose an evenly covered open V∋a, so q−1(V)=⨆jVj with q∣Vj:Vj→V a homeomorphism. Then (q∣q−1A)−1(V∩A)=⨆j(Vj∩q−1A), the pieces are open in q−1A, and q maps each piece homeomorphically onto V∩A; hence V∩A is evenly covered and q∣q−1A is a covering. This applies to A=T and A=W, which are closed and not open, and supplies the conclusion of [F3] beyond its published open case.

1.2F1F2

Clause (1): lifting the deformation retraction. Lift the homotopy F(x~,u):=H(p(x~),u) through p with initial lift id⁡X~, obtaining by [F2] a unique H~:X~×I→X~ with p∘H~=F and H~(x~,0)=x~. For every deck transformation T, the map (x~,u)↦TH~(T−1x~,u) is a lift of F with the same value x~ at u=0, hence equals H~ by uniqueness of homotopy lifts; thus H~u∘T=T∘H~u for all u, and H~ is deck-equivariant. If x~∈p−1(W) then p(H~(x~,u))=H(p(x~),u)=p(x~), so u↦H~(x~,u) is a path in the discrete fibre p−1(p(x~)), hence constant with value x~; in particular H~ fixes p−1d pointwise. Also p(H~(x~,1))=r(p(x~))∈W, so H~1(X~)⊆p−1(W). Therefore H~ is a deck-equivariant homotopy of pairs from the identity to a retraction onto (p−1(W),p−1d) fixing p−1(W) pointwise: a deformation retraction, which is clause (1).

1.3F1F2F4

The lifted tether trees. By 1.1 the restriction p−1(T)→T is a covering. Put vk:=Ttk(d~) and let Tk be the connected component of p−1(T) containing vk; the deck action permutes the components, so Ttk(T0)=Tk. For each component the projection p∣Tk:Tk→T is a homeomorphism: since T is simply connected and path-connected, the lifting criterion [F2] lifts id⁡T to a map s:T→Tk (the subgroup condition being vacuous), and then s∘p∣Tk and id⁡Tk are two lifts of p∣Tk agreeing at vk, so they are equal by uniqueness of lifts [F2]. Hence p identifies Tk with T, the fibrewise preimage of d is exactly {vk:k∈Z}, the points σi(k):=(p∣Tk)−1(pi) are the unique points of Tk over pi, and the lift of ti is an edge Ti,k of Tk joining vk to σi(k).

1.4F1F4F5

The lifted circles and the graph p−1(W). Fix i and parametrize Ci by ci:[0,1]→Ci periodically with ci(0)=pi, positively oriented. Since R is simply connected, the map R→Ci, u↦ci(u−⌊u⌋), lifts through p to a map ε:R→X~ with ε(0)=σi(0); its image is connected and contains ε(k) for every k∈Z. The points ε(k) lie over pi, and ε(k+1) is the endpoint of the lift of one full circle traversal from ε(k), i.e. ε(k) acted on by the monodromy of the class of ci; that class has total winding 1 because ω is conjugation invariant and ω(xi)=1, so by the defining property of t in The Burau infinite cyclic cover the monodromy is Tt and ε(k)=σi(k) by induction. Every component of the 1-manifold p−1(Ci) contains some point of p−1(pi) (follow a lifted circle arc back to pi), and p−1(Ci)∩p−1(T)=p−1(pi)={σi(k)}, so the connected set ε(R)=⋃kEi,k equals all of p−1(Ci), with Ei,k the lifted arc of ci from σi(k) to σi(k+1). Hence p−1(W)=⨆kTk∪⋃i,kEi,k is the locally finite graph with vertices vk,σi(k) and edges Ti,k,Ei,k, a one-dimensional CW complex carrying the weak topology, and the deck action sends Ti,k↦Ti,k+1 and Ei,k↦Ei,k+1.

1.5F5algebra

Clause (3): the cellular chain complex. The CW complex Σ has zero-cells {vk} and one-cells {ei(k)} and no higher cells. With integral coefficients, C1(Σ;Z)=⨁i,kZei(k) and C0(Σ;Z)=⨁kZvk by [F5], and the cellular boundary is d1(ei(k))=vk+1−vk: the relative class of the oriented edge is sent by the connecting morphism to the class of its boundary [∂ei(k)]=[vk+1]−[vk] under the conventions of [F5]. The deck action makes these chain groups Λ1-modules with t⋅ei(k)=ei(k+1) and t⋅vk=vk+1; writing ei:=ei(0) and v:=v0, they are free modules C1(Σ)=⨁i=1nΛ1ei and C0(Σ)=Λ1v, and Λ1-linearity of d1 gives ∂1ei=(t−1)v. For the pair (Σ,Σ0) one has C1(Σ,Σ0)=C1(Σ) and C0(Σ,Σ0)=0, so C1(Σ,Σ0)=⨁i=1nΛ1ϵi with ϵi the relative class of ei and H1(Σ,Σ0)=C1(Σ,Σ0) because there are no 2-cells.

2.1F4F5step 1.4

Clause (2): the collapse onto the spine. Let Σ be the quotient of p−1(W) obtained by collapsing each tree Tk to the vertex vk; its cells are the vertices vk and the images ei(k) of the arcs Ei,k, each an edge vk→vk+1, so Σ is the lifted spine with Σ0={vk}=p−1d and with deck translation t⋅vk=vk+1, t⋅ei(k)=ei(k+1). Let q:p−1(W)→Σ be the quotient map. Parametrize each tether edge Ti,k by u∈[0,1] from vk to σi(k), each circle edge Ei,k by v∈[0,1] from σi(k) to σi(k+1), and let Li,k:[0,3]→p−1(W) be the concatenation of Ti,k, Ei,k and the reverse of Ti,k+1. Define j:Σ→p−1(W) by j(vk)=vk and by mapping ei(k) onto the arc Li,k increasingly; then j is continuous. On the unit parameter v of every spine edge, q∘j has parameter η(v)=max⁡(0,min⁡(1,3v−1)): the two tether thirds collapse. The interpolation (1−u)η(v)+uv defines a deck-equivariant homotopy qj≃id⁡Σ relative to the vertices. Define H~u on p−1(W) by H~u(Ti,k(v)):=Ti,k((1−u)v) and H~u(Ei,k(v)):=Li,k(ψu(v)) with ψu(v):=(1−u)(1+v)+3uv. The values at σi(k) agree from the two incident circle edges and the tether, at σi(k+1) likewise, and at vk all definitions give vk; on the locally finite closed-cell cover this defines a continuous homotopy fixing every root vk, with H~0=id⁡ and H~1=j∘q. Hence q is a homotopy equivalence of pairs with homotopy inverse j: q∘j≃id⁡Σ relative to Σ0 and j∘q≃id⁡ through the homotopy H~, which fixes Σ0=p−1d and is deck-equivariant because every formula is stated in the canonical cell parameters and Ttk∘Li,l=Li,l+k.

3.1F6F7step 1.2step 2.1

The homology isomorphisms are Λ1-linear. By step 1.2 the inclusion-induced map H1(p−1(W))→H1(X~) is an isomorphism, natural for the deck actions, and it maps H1(p−1d) identically; by step 2.1 the homotopy equivalence q induces isomorphisms Hn(p−1(W))→Hn(Σ) and, by the five lemma applied to the commuting map of pair long exact sequences established in [F6], an isomorphism H1(p−1(W),p−1d)→H1(Σ,Σ0), while q∣p−1d is the identity onto Σ0. Since all these maps commute with the deck actions, they are isomorphisms of Λ1-modules for the structures induced by those actions, and the absolute case gives H1(X~)≅H1(Σ) while the relative case gives H1(X~,p−1d)≅H1(Σ,Σ0); this is clause (2).

4.1F7step 3.1step 1.5algebra

The kernel and the ranks. Write an element of C1(Σ) as ∑i=1naiei with ai∈Λ1. Since d1 is Λ1-linear and ∂1ei=(t−1)v, one has ∂1(∑iaiei)=(∑iai)(t−1)v; as C0(Σ)=Λ1v is free of rank one and Λ1 is a domain with t−1≠0 by [F7], this vanishes exactly when ∑iai=0. Hence H1(Σ)=ker⁡∂1=⨁i=1n−1Λ1(ei−en), free of rank n−1, and H1(Σ,Σ0)=⨁i=1nΛ1ϵi is free of rank n; this is clause (3).

5.1step 1.2step 3.1step 4.1∎

Conclusion. Clause (1) is step 1.2, clause (2) is step 3.1, and clause (3) is step 4.1; all constructions used one fixed contraction data set and explicit formulas, so no choice principle is used.

Depends on

Used by

Dependency tree · two levels

106 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