Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge 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 two-variable covering homomorphism

Definition

Let C be the two-point configuration space of the punctured disk, with basepoint c0={d1,d2} and boundary-fixed action, of The two-point configuration space of a punctured disk. Let Z2=⟨q⟩⊕⟨t⟩ denote the free abelian group written multiplicatively with basis the two letters q,t.

The winding form. Let α be a loop in C at c0 (Based loops and the fundamental group). It can be written α(s)={α1(s),α2(s)} for continuous arcs α1,α2 in D∖P. The symmetric nonvanishing functions W({x,y})=∏j=1n(x−pj)(y−pj),V({x,y})=(x−y)2 define closed loops W∘α,V∘α in C∗ even when the mobile labels exchange. Define a(α) and b(α) as their integer winding numbers, using continuous argument lifts on the compact parameter interval. For piecewise smooth tracks this is equivalently a(α)=12πi∑j=1n(∫α1dzz−pj+∫α2dzz−pj),b(α)=1πi∫α1−α2dzz. The winding definition applies to arbitrary continuous loops; no differentiability of α is presumed. The total puncture winding is a, and b is the mutual half-twist exponent, even for returning labels and odd for exchanged labels. A loop with one mobile point going positively around a single puncture in a small disk missing the other mobile point has (a,b)=(1,0). Exchanging the two mobile points by a positive half rotation in a small disk missing all punctures gives (a,b)=(0,1). Join these local configurations to c0 by the finite-buffer paths of the configuration-space definition; conjugating the local loops does not alter winding numbers. Hence Φ is surjective, with images q and t, including when n=1.

The exponent-sum form. Ignoring the punctures turns α into a loop in the space of unordered pairs of points of the disk, hence into a braid in B2 (The braid group by Artin presentation); let b be its exponent of σ1. Adjoining the n fixed punctures turns α into a loop of unordered (n+2)-tuples in the disk; that loop is a braid in Bn+2, and the exponent sum of that braid in the Artin generators σ1,…,σn+1 is written b′. Then b′≡b(mod2) and a=12(b′−b)∈Z. Equivalently, the parity statement is the relation b′=2a+b: each mobile–puncture difference occurs squared in the full discriminant, while the fixed–fixed factors are constant and the mutual half-twist of the two mobile points contributes exactly the parity of b.

The homomorphism. The two-variable covering homomorphism is Φ:π1(C,c0)⟶Z2,Φ(α)=qatb,a=12(b′(α)−b(α)). It is well defined and a homomorphism of groups: path-homotopy classes have well-defined winding numbers and well-defined exponent sums, because the defining relations of the Artin presentation preserve the total exponent sum, and both a and b are additive under concatenation of loops, which is the product of Based loops and the fundamental group. Since the integers a and b are determined by the class [α], the formula defines a map; additivity of winding numbers and of exponent sums gives Φ([α][β])=Φ([α])Φ([β]). The case n=1 is included, with P={p1}.

The cover classified by ker⁡Φ and the resulting LKB module are built from this homomorphism on the same page; the variables q and t are the deck generators used there.

Depends on

Used by

Dependency tree · two levels

10 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