Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generated
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.

Equivariant equivalence with fundamental groupoids

PDF p. 25: Lemma 6.6 and commutative square; PDF p. 26: Lemma 6.6 and commutative square

Statement

Let (W,S) be a Coxeter system with finite W, and let J⊆S. Put G=N(W,J)=Norm⁡W(WJ)/WJ, where WJ is generated by J. Let X=XJC be the relative complexified arrangement complement and let D=D(J) be the groupoid completion of the positive relative chamber category. Thus its objects are chambers and its generating arrows are directed crossings of adjacent chambers, subject to equality of positive geodesic galleries with the same endpoints and formal inversion of arrows.

The space X is nonempty, path-connected and locally path-connected.

There is a G-equivariant equivalence p:D→Π1(X), where Π1(X) has points of X as objects and endpoint-fixed path-homotopy classes as arrows. Equivariance means p(gC)=gp(C) on objects and p(gα)=gp(α) on arrows. With Q:D→D/G the orbit functor and q:X→X/G the topological orbit map, p induces an equivalence pˉ:D/G→Π1(X/G) satisfying pˉ Q=q∗p. The map q is a normal covering. An equivalence means a functor equipped with a quasi-inverse and natural isomorphisms to the two identity functors; the Axiom of Choice is used below to choose connecting paths for all objects.

Facts & Assumptions

[F1]

The relative arrangement is finite, central and simplicial, and X is its complexified complement. Its ambient space E=ΘJ is finite-dimensional with its coordinate Euclidean topology, and X=(E×E)∖⋃H∈HJ(H×H) has the product subspace topology. A linear hyperplane H has dim⁡(E/H)=1; choosing an identification E/H≅R gives a nonzero linear functional ℓH:E→R with kernel H. Spherical relative arrangements and Deligne topology Relative complexified hyperplane complement Linear hyperplane

[F2]

The action of G on chambers is free, preserves adjacency, and is induced by linear automorphisms of the relative real space preserving the arrangement. Normaliser action on labels, orbits and adjacency Faithful normaliser-quotient action on the relative cone

[F3]

Given equivariant points aC in the chamber charts, the assignment of an adjacent directed crossing to the path class through the ordered chart intersection is independent of its intermediate point and paths and is equivariant. For a crossing from C to C′, this ordered intersection has real part on the C side of the separating wall; the chart of C requires the imaginary part to be on the C side whenever the real part lies on that wall. Equivariant chamber-point and path assignment Chamber open sets used for the topological equivalence

[F4]

For a finite central simplicial arrangement, the groupoid completion of positive galleries modulo equal-endpoint minimal-gallery relations is isomorphic to the full fundamental subgroupoid on chosen real chamber points by the positive wall-crossing convention: at a positive crossing the imaginary component is on the preceding chamber's side. Gallery fractions, fundamental groupoid and asphericity

[F5]

The G-action on X is by homeomorphisms, is free and has the disjoint-neighbourhood property; the orbit map is a normal covering. Relative free action, normal cover and exact sequence If X is nonempty, path-connected and locally path-connected, these action properties imply that projection identifies Π1(X)/G with Π1(X/G). The three topological hypotheses are proved in steps 1.1 and 2.1 below before this implication is applied. Covering-space actions and fundamental-groupoid quotients

[F6]

The orbit groupoid has object and arrow orbits, with composition by aligning representatives when the action is free on objects. The arrangement groupoid is the completion described in the Statement. Free actions and quotient groupoids Positive arrangement category and its groupoid completion

[F7]

A quasi-inverse and natural isomorphisms give an equivalence; arbitrary indexed selections are available under the Axiom of Choice. Equivalence, quasi-inverse, and adjoint equivalence of categories The Axiom of Choice

[F8]

A finite-dimensional vector space over an infinite field is not the union of finitely many proper linear subspaces. We apply this over R to E and to E×E. A finite-dimensional vector space over an infinite field is not a finite union of proper subspaces

[F9]

Every linear map between coordinate Euclidean spaces satisfies a bound ∥Lv∥2≤K∥v∥2 for some K≥0. Every Euclidean ball is convex, and every convex subset of Rn for n≥1 is path-connected. Local path connectedness means that every point has a base of open path-connected neighbourhoods. Every Euclidean linear map has a unique matrix and satisfies ‖Lh‖₂≤ K‖h‖₂ for some K≥0 Every convex subset of ℝⁿ, in particular every ball and ℝⁿ itself, is path-connected and hence connected Locally connected and locally path-connected spaces: a neighbourhood base of open connected, respectively open path-connected, sets at every point

[F10]

For every topological space Y, the fundamental groupoid Π1(Y) has points as objects and endpoint-fixed path-homotopy classes as arrows, with composition [β]∘[α]=[α∗β] traversing α first, constant-path identities and reversed-path inverses. Fundamental groupoid of a space

Proof

Given: The finite Coxeter system and subset J of the Statement.

Given: The data in the Statement, with the Axiom of Choice.

Goal: Construct the equivariant equivalence and prove the quotient square and equivalence.

Proof technique: direct.

1.1F1F8F9

By [F1] and [F8], choose a∈E∖⋃HJ; then (a,0)∈X, so X is nonempty. If E has dimension zero, there are no hyperplanes and X is a singleton, hence is locally path-connected. Otherwise, fix z=(x,y)∈X. For each H, at least one of ℓH(x) and ℓH(y) is nonzero. The bound in [F9] gives KH>0 with ∣ℓH(v)∣≤KH∥v∥2. If, for example, ℓH(x)≠0, every perturbation of z of norm less than ∣ℓH(x)∣/(2KH) still has nonzero first-coordinate value under ℓH; use the analogous radius for y otherwise. Taking the minimum of these finitely many positive radii gives an open Euclidean ball about z contained in X; if the arrangement is empty, any radius works. Thus X is open. Inside any neighbourhood of z open in X, a sufficiently small Euclidean ball is still contained in that neighbourhood. Such balls are open and path-connected by [F9], so they give the required neighbourhood base and prove local path connectedness.

1.2F1F2F3

There are finitely many chambers by [F1]. Choose a real point aC∈C for one chamber in each G-orbit and extend by agC=gaC. By [F2], the action preserves chambers and is free on them, so this is well-defined. A real point of C lies in its chart: its real part lies on no arrangement hyperplane, making the chart conditions in [F3] vacuous. Apply the path assignment of [F3] to these points.

2.1F1F8F9step 1.1

Let p,q∈X. For H∈HJ put LH=H×H. The linear map fH:E×E→R2 defined by fH(u,v)=(ℓH(u),ℓH(v)) is surjective, since ℓH is nonzero, and has kernel LH. For s=p or s=q, fH(s)≠0, so BH,s=LH+Rs is a proper linear subspace: its image under the surjective fH is just the one-dimensional line RfH(s). By [F8], choose r outside all these finitely many BH,s. The segment [p,r] cannot meet any LH: if (1−t)p+tr∈LH, then t≠0 because p∉LH, and solving for r puts it in LH+Rp, a contradiction. The identical argument with q shows that [r,q] avoids every LH. Both segments are continuous paths by [F9], and traversing them successively gives a path in X from p to q. An empty arrangement gives straight segments directly; in dimension zero the constant path suffices. Thus X is path-connected.

2.2F1F2F3F4F9step 1.2F10

Compare the two crossing conventions. The map κ:X→X, κ(x+iy)=x−iy, is a homeomorphism and its own inverse: it preserves the excluded sets H×H and is an isometry of E×E. It fixes the real chamber points and commutes with the real linear G-action. Composing paths and endpoint-fixed homotopies with κ therefore induces a groupoid automorphism κ∗ of Π1(X). For adjacent C,C′, take a short transverse real segment through the relative interior of their common wall, avoiding every other hyperplane, and give it a small imaginary displacement on the C′ side near its crossing, tapering to zero at its endpoints. Join these endpoints to aC,aC′ in the respective real chambers. Choose an intermediate real point d before the crossing, on the C side. Then d∈XC,C′; the portion up to d lies in XC, and the portion after d lies in XC′, since at the crossed wall its imaginary part is on the C′ side and no other wall meets this small segment. Hence [F3] identifies its class with the assigned crossing. Its conjugate under κ instead has imaginary part on the preceding chamber's C side, exactly the convention in [F4]. If Φ denotes that supplier's isomorphism on real chamber basepoints, the assigned crossing class is therefore κ∗Φ(C→C′).

3.1F3F4F6F7step 2.1step 2.2F10

By [F4], Φ is an isomorphism from D to the full fundamental subgroupoid on the selected real points aC. Step 2.2 shows that the graph assignment is κ∗Φ on every generator. This composite is again an isomorphism onto that subgroupoid, since κ∗ fixes its objects and is invertible. Thus the assignment respects the equal-endpoint geodesic relations and extends over formal inverses. Composing with inclusion gives p. It is equivariant by [F3] on generating crossings and objects, and hence on formal inverses and composites. It is fully faithful, and it is essentially surjective because X is path-connected by step 2.1. Using [F7], choose for each point of X a path to a selected chamber point, taking the constant path at selected points. Transporting arrows along these paths and through the inverse of κ∗Φ defines a quasi-inverse; the chosen path classes give the natural isomorphism to the identity, while the other composite is the identity on D. Hence p is an equivalence in the stated sense.

4.1F2F5F6F7step 2.1step 3.1F10

Let A be the full subgroupoid on the points aC. The free action on chambers makes C↦aC injective: distinct real chambers are disjoint. Thus [F2] makes the action on the objects of A free, and [F5] makes the action on all points of X free. By [F6], A/G is the full subgroupoid of Π1(X)/G on the orbits of the aC: any arrow orbit between two such orbits can be translated so that its endpoints are selected points. It is essentially surjective because every point of X is joined by a path to a selected point by step 2.1. Consequently D/G≅A/G maps by an equivalence to Π1(X)/G; a quasi-inverse is obtained by choosing connecting arrows in that quotient as in step 3.1.

5.1F5F6step 1.1step 2.1step 4.1F10∎

Steps 1.1 and 2.1 establish nonemptiness, path connectedness and local path connectedness of X. Together with the action properties in [F5], these verify every hypothesis of the topological orbit interface, so projection induces an isomorphism Π1(X)/G≅Π1(X/G) and q is a normal covering. Define pˉ as this isomorphism after the equivalence in step 4.1. On each object and arrow, both pˉQ and q∗p take the assigned point or path class to its projection, so the square commutes strictly. Composition with an isomorphism preserves the quasi-inverse data, proving that pˉ is an equivalence.

Source notes

The article reference attributes the original claim. The proof uses the declared gallery and covering suppliers and the local comparison of path conventions; it does not use the article's lemma as a premise.

Depends on

Used by · 2

Dependency tree · 2 levels

Each result is drawn at its shortest distance from this item. Arrows run from prerequisites to the items that use them; this item has a heavier outline. External source nodes link directly to the cited text. The view shows up to two dependency steps; open a prerequisite to continue.

Sources