Alphabeta Math
TheoremStatement: Literature-sourcedProof: 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.

Isomorphism of algebraic and topological normaliser sequences

PDF p. 3: Theorem 6.7; (6.8); PDF p. 26: Theorem 6.7; (6.8)

Statement

Assume the Axiom of Choice. Let (W,S) be a finite-rank spherical Coxeter system, meaning that W is finite, and let J⊆S. Let A be the associated Artin–Tits group, let π:A→W be its standard projection and let P=ker⁡π. Write WJ and AJ for the subgroups generated by the standard generators indexed by J. For G=W,A, put N(G,J)=Norm⁡G(GJ)/GJ, where Norm⁡G(GJ)={g∈G:gGJg−1=GJ}. Let N(P,J) be the image of P∩Norm⁡A(AJ) in N(A,J).

Let X=XJC be the relative complexified hyperplane complement, let x∈X, and let xˉ be its image in X/N(W,J). The algebraic exact sequence 1→N(P,J)→N(A,J)→πˉN(W,J)→1 is isomorphic to the covering exact sequence 1→π1(X,x)→π1(X/N(W,J),xˉ)→N(W,J)→1, with the identity on N(W,J). In particular, N(P,J)≅π1(X,x) and N(A,J)≅π1(X/N(W,J),xˉ). Fundamental groups use first-path-first multiplication.

Facts & Assumptions

[F1]

The normaliser quotients and N(P,J) are the groups described in the Statement, and the algebraic sequence displayed there is exact. Normalisers and their quotients Normaliser quotient exact sequence

[F2]

In spherical type, X is the complement in the complexification of a finite-dimensional real vector space of finitely many complexified real hyperplanes. Relative complexified hyperplane complement

[F3]

The action of N(W,J) on X gives a normal covering q:X→X/N(W,J) and, at every point of X, the displayed topological exact sequence. Its final map sends a loop to the unique element carrying the initial point of its lift to its endpoint. Relative free action, normal cover and exact sequence

[F4]

With the Axiom of Choice, the completed groupoid comparison provides a point x0∈X and an isomorphism from the algebraic exact sequence to the topological exact sequence based at x0, inducing the identity on N(W,J). It identifies the algebraic kernel with the kernel of the topological endpoint map. Intermediate exact sequences and deck morphism in Theorem 6.7 The Axiom of Choice

[F5]

Endpoint-fixed path classes compose by concatenation and have inverse classes represented by reversed paths. A path downstairs has a unique lift from a specified point over its initial point. Fundamental groupoid of a space Existence and uniqueness of path lifts through a covering map

[F6]

A morphism of group extensions consists of group homomorphisms making the injection and quotient squares commute. Morphisms of group extensions

[F7]

No finite family of proper linear subspaces covers a finite-dimensional vector space over an infinite field. We apply this over R to the underlying real vector space of the complexification in [F2]. A finite-dimensional vector space over an infinite field is not a finite union of proper subspaces

Proof

Given: The Coxeter system, subset, groups, complement and basepoint in the Statement, and the Axiom of Choice.

Goal: Transport the comparison at x0 to the arbitrary basepoint x, preserving the quotient map.

Proof technique: direct.

1.1F2F7choose

Let V be the underlying finite-dimensional real vector space of the ambient complexification in [F2], and let L range over the deleted complexified hyperplanes. Each L has real codimension two: a real basis of the corresponding real hyperplane, together with its multiples by i, is a real basis of L. For p∈X, the subspace L+Rp has dimension dim⁡RV−1, since p∉L, and is proper. For two endpoints p,q∈X, [F7] therefore gives r∈V outside all the finitely many subspaces L+Rp and L+Rq. If there are no deleted hyperplanes, no avoidance condition on r is needed.

2.1F2F4step 1.1construct

The segment from p to r avoids every deleted L: if (1−t)p+tr∈L for 0≤t≤1, then t≠0 because p∉L, and solving for r gives r∈L+Rp, contrary to step 1.1. The same argument applies to the segment from q to r. Both segment maps are continuous, since their real coordinates are affine functions of t; traversing the first and the reverse of the second gives a path in X from p to q. The construction also covers an empty arrangement, while in dimension zero X is a point. Hence X is path-connected. Take p=x0 from [F4] and q=x, and choose the resulting path c:x0→x.

3.1F3F5step 2.1

Write cˉ=q∘c. By [F5], conjugation by path classes gives isomorphisms u:π1(X,x0)→π1(X,x) and v:π1(X/N(W,J),q(x0))→π1(X/N(W,J),xˉ): with first-path-first products they send [α] to [c−1∗α∗c] and [β] to [cˉ−1∗β∗cˉ], respectively. Their inverses use the reversed path. Projection preserves concatenation and reversal, so vq∗=q∗u.

4.1F3F5step 2.1step 3.1

Let a loop β at q(x0) lift from x0 to gx0, where g∈N(W,J). The lift of cˉ−1∗β∗cˉ starting at x is c−1 followed by that lift of β and then by gc. Indeed, gc projects to cˉ and starts at gx0; uniqueness in [F5] identifies it with the final lifted segment. Its endpoint is gx. By the endpoint description in [F3], the last maps of the two covering sequences therefore agree after applying v.

5.1F1F3F4F6step 3.1step 4.1∎

Steps 3.1 and 4.1 give an isomorphism of the two covering exact sequences, with identity on N(W,J). Compose it with the comparison at x0 from [F4]. The result is an isomorphism from the algebraic sequence of [F1] to the covering sequence based at x, with identity on the rightmost nontrivial group. Its kernel and middle components give the two stated group isomorphisms.

Source notes

The article reference attributes the theorem. The intermediate comparison now explicitly carries Choice, which is already assumed here. The finite-union step is supplied by the declared mathematical lemma and the two-segment avoidance argument is local. The proof uses the completed comparison supplier and an explicit change of basepoint; it does not use the article's theorem as a proof 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