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.
Coxeter, Artin, and Hecke Interfaces — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Extensions, Extension Degree, and Finite Fields
- Approximation and Compactness in C(K)
- Artin Presentation Completeness and Braid Combing
- Asymptotic Cones and the Sublinear Triangle Criterion
- Binary Operations, Monoids, Groups and Subgroups
- Braided and Symmetric Monoidal Categories
- Braids as Fundamental Groups of Configuration Spaces
- Canonical Roots, Signs, and Faithful Reflections
- Chain Conditions, Semisimple Modules and the Wedderburn–Artin Theorem
- Classification of Covering Spaces
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Conjugacy in Sₙ, Generation, and the Simplicity of Aₙ
- Connectedness
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Covering Spaces and Lifting
- Coxeter Presentations, Exchange, and Reduced Word Theorems
- Coxeter, Artin, and Hecke Interfaces
- Cw Complexes and Cellular Homology
- Cyclic Groups and Direct Products
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Euclidean Ordinary Differential Equations with Smooth Dependence
- Fibrations Fiber Bundles and Homotopy Exact Sequences
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Fields and Cyclotomic Extensions
- Foundations of the Real Numbers for Analysis
- Free Groups and Presentations
- Free Modules, Exact Sequences, Projective and Injective Modules
- Free Products and Amalgamation
- Fubini and Change of Variables
- Function Space Topologies and the Exponential Law
- Garside Structure, Normal Forms, and the Center
- Generic Coxeter Hecke Algebras and the Standard Basis
- Geometric Braids and Artin Generators
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hausdorff via the Diagonal
- Hereditary and Productive Behaviour of the Separation Axioms
- Higher Homotopy Groups and Cofiber Sequences
- Homotopy and Homotopy Equivalence
- Hurewicz Whitehead Freudenthal and Cw Approximation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Manifolds with Boundary Collars and Orientations
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Modules, Submodules, Quotient Modules and the Isomorphism Theorems
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Order, Zorn's Lemma, and the Axiom of Choice
- Ordered and Unordered Configuration Spaces
- Ordinals, Cardinals, and Transfinite Recursion
- Partitions of Unity and Paracompactness
- Permutation Statistics, Inversions and Eulerian Numbers
- Picard-Lindelöf and First-Order Ordinary Differential Equations
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Properties of the Integral and the Working FTC
- Punctured Disks, Mapping Classes, and Point Pushing
- Pure Braids, Fadell–Neuwirth, and Asphericity
- Rank Theorems and Embedded Submanifolds
- Real Forms and Reflection Geometry
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Semidirect Products, Automorphism Groups and Split Extensions
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Simple Field Extensions and the Construction of the Complex Numbers
- Simply Connected Plane Domains: the Grand Equivalence
- Sine, Cosine, and the Definition of Pi
- Smooth Manifolds and Smooth Maps
- Smooth Partitions of Unity and Exhaustions
- Smooth Vector Bundles and Sections
- Splitting Fields
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- Tangent Cotangent and the Differential
- Tensor Coherence and Algebraic Descent
- Tensor Products of Modules
- The Ascoli–Arzelà Theorem
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Fundamental Group
- The Fundamental Group of the Circle
- The Fundamental Theorem of Finite Abelian Groups
- The Fundamental Theorems of Calculus
- The Inverse and Implicit Function Theorems
- The Inverse Function Theorem Completed
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Seifert–van Kampen Theorem
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Uniform Spaces: the Three Definitions
- Urysohn's Lemma and the Tietze Extension Theorem
- Vector Fields Flows and Lie Derivatives
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
This companion is a dependency leaf: its entries test the constructions of coxeter-artin-and-hecke-interfaces and use only that page's prerequisite closure.
For the standard type- system the examples run the whole presentation-level dictionary. Composing the type- isomorphism with the projection of the Artin group produces the surjection with ; the same assignment on the monoid of positive words gives a negative-free section which is injective and satisfies . Two explicit computations exhibit the mechanism: for , the length-additive pair satisfies , while the longest element of shows the independence of the lift from the chosen reduced expression through the braid move. Because the two presentations coincide word for word, the positive Artin monoid is identified with the published positive braid monoid by the universal properties; no embedding into the group or geometric model is claimed.
The companion counterexample exhibits the converse boundary of the length criterion: for a single generator the element is the empty-word class, while is distinguished by the class length, so the positive lift is not a monoid homomorphism and its composite with is not a group homomorphism. The precise dropped hypothesis is length additivity.
On the Hecke side the examples compare the quadratic normalizations with , the opposite-sign form and the Soergel-calculus form, and record the rank-one Kazhdan–Lusztig conversion, so that coefficients are compared only after the substitution; no canonical basis or positivity statement is constructed. The final counterexample isolates the reflection-faithfulness boundary: in the rank-two system (the diagram) the canonical representation is faithful, yet its one-dimensional radical is the only full fixed space of codimension one of an element of , so the two simple reflections share a fixed hyperplane and the realization is not reflection faithful; arguments assuming reflection faithfulness must supply a realization satisfying that hypothesis separately.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Type-A Artin projections, positive lifts, and the positive braid monoid
Example
Let , and let be the type- Coxeter matrix on : , when , and when . Let be the presented Coxeter group with length , let and be the Artin group and monoid of Artin monoid and Artin group presentations, and the canonical monoid-to-group map, and let , , , and be as in Universal properties of the Artin monoid and group, the projection onto the Coxeter group, and the quotient by the squares and The reduced positive section b_w, its length additivity, and the degree homomorphism. By the type- clause of Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (4), extends to an isomorphism (The finite symmetric group , one-line notation, and cycle notation) with , the inversion number (Inversions, inversion number, the sign , and even and odd permutations).
Throughout, relabel the library's underlying set as by , as in that supplier. Cycle symbols, one-line lists and inversion positions below use these transported labels; the order-preserving relabelling leaves inversion numbers unchanged.
- The Artin-to-symmetric map. Composing with that isomorphism, extends to a surjective homomorphism
with for every word; the same assignment on the generators gives a monoid homomorphism with . Surjectivity holds because the adjacent transpositions generate (the existence follows from the universal property (2) of Universal properties of the Artin monoid and group, the projection onto the Coxeter group, and the quotient by the squares, since the braid words of the type- matrix are equal in ).
- Positive lifts. For the element of any reduced expression is well defined, satisfies , and the map is injective (The reduced positive section b_w, its length additivity, and the degree homomorphism (1),(2)). For instance, when ,
because , an instance of the length-additive case of The reduced positive section b_w, its length additivity, and the degree homomorphism (4).
- Two reduced expressions of the longest element. For , has , and the two reduced expressions are related by the braid move in , so
a nonempty instance of the independence clause (1) of The reduced positive section b_w, its length additivity, and the degree homomorphism.
-
Positive braid monoid. For the same standard type- indexing, the generators and positive braid relations of agree exactly with the presentation of in Positive braid monoid. Thus the assignment gives a monoid isomorphism by the quotient universal properties. This is only an identification by positive presentations; it does not assert that embeds in or construct a geometric braid monoid.
-
Scope. This example proves only the stated presentation-level maps, lifts and finite calculations. It constructs no topological model, proves no Garside or lattice property, and makes no claim about the embedding of the positive monoid into the group. The type-A group identification with geometric braids is the separate conditional application in A2, using its independently published completeness theorem. The failure of to be multiplicative is the companion counterexample.
Facts & Assumptions
Given: An integer , the type- Coxeter matrix on , the group with length , and the constructions , , , and of the items named in the statement, together with the isomorphism , , of the type- clause (4) of Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification.
A map into a monoid whose values on the two words of every braid pair agree extends uniquely to a monoid homomorphism with . (Universal properties of the Artin monoid and group, the projection onto the Coxeter group, and the quotient by the squares)
A map into a group whose values on the two words of every braid pair agree extends uniquely to a group homomorphism with . (Universal properties of the Artin monoid and group, the projection onto the Coxeter group, and the quotient by the squares)
is well defined independently of the reduced expression, , and . (The reduced positive section b_w, its length additivity, and the degree homomorphism)
and , hence is injective and is a set-theoretic section. (The reduced positive section b_w, its length additivity, and the degree homomorphism)
For the symmetric group has the presentation with generators and relations , and for . (The symmetric group has the Coxeter presentation)
For the adjacent transpositions generate . Generation follows directly from the zero-indexed adjacent-swap proof of Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (4). The repaired Adjacent transpositions generate the finite symmetric group also proves generation in exactly the transported one-based model fixed above; the direct argument here remains valid.
In the transported one-based model fixed above, an inversion of is a pair with and , and is the number of inversions. (Inversions, inversion number, the sign , and even and odd permutations)
Let be a monoid and satisfy and for ; then there is exactly one monoid homomorphism with . (Positive braid monoid)
The subgroup generated by a set is contained in every subgroup containing that set. (The subgroup generated by a subset, the cyclic subgroup , and cyclic groups)
Verification
The braid pairs of the type- matrix are the pairs of alternating words for and the commuting pairs for ; their images under are equal in by the presentation of [F6]. Hence [F2] gives a homomorphism with . Its image is a subgroup of containing the adjacent transpositions, which generate by [F7], so the image is all of by [F10]: is surjective.
The monoid isomorphism : define on generators by . The braid pairs of the type- matrix map to the two defining word pairs of of [F9], whose two members are -equivalent in , so [F1] gives a monoid homomorphism . Conversely the elements satisfy and for , because the corresponding alternating words are -equivalent in and hence equal in ; so [F9] gives a monoid homomorphism with . The composites and fix every generator, hence are the respective identities by the uniqueness clauses of [F1] and [F9]; thus and are mutually inverse isomorphisms.
The same assignment has equal values on the two words of every braid pair by [F6], so [F1] with gives a monoid homomorphism with . The composites and are monoid homomorphisms agreeing on every generator , so they are equal by the uniqueness clause of [F1]: .
The map is well defined by the type- isomorphism of the given data: its input corresponds to the unique element of with the same name, and [F3] applies. It satisfies by [F3], and because by step 2.1 and by [F4]; in particular is injective by [F4] and is a set-theoretic section of both and .
For , the element permutes the first three symbols as in and fixes the others; it corresponds to , whose one-line form is (with no tail when ); the pairs and are its only inversions: is not an inversion and all pairs involving the increasing tail contribute none, so by [F8]. By the given type- clause while , so and [F5] gives ; explicitly both sides equal , and no braid move is needed for this pair.
For , the two words and both act as the transposition , whose one-line form has all three pairs as inversions, so by [F8]; with by the given type- clause, both words have length and hence are reduced expressions of . Step 3.1 therefore gives as the product along either word, and the two products are equal in because and are the two words of a braid pair of , hence equal in and in .
Scope and choice: only presentation-level maps, the positive monoid isomorphism and the displayed finite computations are proved; no topological model, no Garside or lattice property, and no embedding of into or into is asserted. All constructions are given on generators of explicitly presented monoids and groups, and no choice is used.
The positive lift b_w is not a monoid homomorphism
Statement refuted
For every finite Coxeter matrix with , the positive lift , , is a monoid homomorphism; that is, for all (and dually, is a group homomorphism).
Facts & Assumptions
Given: The rank-one Coxeter matrix with and , the presented group with its length function , and the constructions , , , , and the lift of Artin monoid and Artin group presentations, and the canonical monoid-to-group map, Universal properties of the Artin monoid and group, the projection onto the Coxeter group, and the quotient by the squares and The reduced positive section b_w, its length additivity, and the degree homomorphism.
A braid pair requires two distinct letters , and is the quotient of by the smallest congruence containing the braid pairs, with and . (Artin monoid and Artin group presentations, and the canonical monoid-to-group map)
depends only on and not on the chosen reduced expression, , and . (The reduced positive section b_w, its length additivity, and the degree homomorphism)
The monoid homomorphism satisfies , hence is additive with and . (The reduced positive section b_w, its length additivity, and the degree homomorphism)
The same assignment defines a group homomorphism with and for all . (The reduced positive section b_w, its length additivity, and the degree homomorphism)
holds if and only if . (The reduced positive section b_w, its length additivity, and the degree homomorphism)
A monoid homomorphism satisfies and ; a group homomorphism satisfies and preserves the identity. (Monoid homomorphism and group homomorphism)
Counterexample
The rank-one data: since a braid pair requires two distinct letters, the braid-pair set of is empty by [F1], so is the diagonal and is the free monoid on the single generator , with elements for and exactly when , because by [F3]. The relator set of is , so with and (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups, Length parity, exchange, two-letter deletion, and faithfulness of the signed reflection action).
The positive lifts are (the empty word is a reduced expression of because ) and (the one-letter word is a reduced expression of because ), by the definition of and step 1.1.
But by the product rule of [F1], while since in ; the two are different elements of , because by [F3]. Hence , so the assignment is not a monoid homomorphism: it fails to preserve the product .
The same defect appears at the group level: while , and because by [F3] and [F4], a group homomorphism preserving the identity. Thus is not a group homomorphism .
The failure is not an artefact of the rank-one computation: for every finite Coxeter matrix with and every , is the class of the word in , and its length satisfies by [F3]; combined with in and (Length parity, exchange, two-letter deletion, and faithfulness of the signed reflection action) this gives for the ambient monoid, and no parabolic reduction is needed. The general theorem records that holds exactly on the pairs with by [F5], so the refuted statement is obtained by dropping that length hypothesis.
Scope and choice: this counterexample is a finite computation in the rank-one system plus the stated supplier clauses; it constructs no topological model, claims nothing about embeddings of into , and uses no choice.
Quadratic Hecke normalizations: S=qT with Q=q^2, the opposite-sign form, and the Soergel-calculus and Kazhdan-Lusztig conversions
Example
Let and let be the generic Hecke algebra over with generator and the single relation , equivalently (Universal parameters, the generic Coxeter Hecke algebra and generator conjugacy, The standard basis of the generic Hecke algebra and base change).
- The four generators and relations. Put , , and
Then, in ,
i.e. . Moreover , , and are each -bases of , and the four normalizations are interconverted by
which are mutually inverse changes of generators. The first displayed relation is the multiplicative convention ", " (The reversal anti-involution, generator invertibility, the bar operator and the multiplicative normalization (4)); the second is the opposite-sign normalization and the third is the quadratic relation of Hecke and Lie seam contract compatibility: the Artin-to-Hecke map, normalization conversions, root-length matching, and the reflection-faithfulness boundary (2).
- The rank-two consistency check. For with and the single parameter (a legitimate specialization; equality of the two parameters is forced when is odd by Universal parameters, the generic Coxeter Hecke algebra and generator conjugacy), the same substitutions preserve the braid relation (both sides have factors, so they acquire the same factor , or ), and on the standard bases the substitutions are diagonal:
In particular both alternating products have the same sign and the same multiplicative factor, including for odd-length braid words.
- Kazhdan–Lusztig conversion (rank one). Let be the generator of the presentation with the single relation , so that . Then the substitution sends to , and with the corresponding element satisfies ; this is the rank-one instance of the conversion and recorded in the Hodge-theory source. The conversion is stated here so that coefficients are compared only after it; no canonical basis, Kazhdan–Lusztig polynomial or positivity statement is constructed in this example.
Facts & Assumptions
Given: The rank-one Hecke datum , the ring , the algebra with generator and relation , the parameters , , and the substituted generators , , ; in the rank-two part, the system with and .
In the generic Hecke algebra the normalized relation is . (Hecke and Lie seam contract compatibility: the Artin-to-Hecke map, normalization conversions, root-length matching, and the reflection-faithfulness boundary)
The multiplicative generators satisfy with . (Hecke and Lie seam contract compatibility: the Artin-to-Hecke map, normalization conversions, root-length matching, and the reflection-faithfulness boundary)
The opposite-sign generators satisfy . (Hecke and Lie seam contract compatibility: the Artin-to-Hecke map, normalization conversions, root-length matching, and the reflection-faithfulness boundary)
The Soergel-calculus generators satisfy . (Hecke and Lie seam contract compatibility: the Artin-to-Hecke map, normalization conversions, root-length matching, and the reflection-faithfulness boundary)
The four normalizations are interconverted by . (Hecke and Lie seam contract compatibility: the Artin-to-Hecke map, normalization conversions, root-length matching, and the reflection-faithfulness boundary)
In the single-parameter normalization, ; for a supplied finite expansion , its -coefficients are . (Hecke and Lie seam contract compatibility: the Artin-to-Hecke map, normalization conversions, root-length matching, and the reflection-faithfulness boundary)
The induced scalar action of an -algebra makes it an -module and its multiplication -bilinear, so multiplication by a unit of is an -linear bijection. (Algebras over a commutative ring, central structure maps, and algebra homomorphisms)
Verification
The four relations of part 1 are the relations [F1]–[F4] specialized to : the normalized relation is the defining relation , and the other three read , and with . The interconversions are [F5] at . In rank one the standard basis of The standard basis of the generic Hecke algebra and base change is , and , , are obtained by fixing and scaling the other basis vector by the units , , , respectively. For each such unit , the -linear map , has inverse , , hence carries a basis to a basis by [F7].
For the rank-two check, each of the three substitutions multiplies every generator by one constant: , , . Hence an alternating product of factors acquires the same constant factor, , or , on both sides of the braid relation, so the braid relation is preserved by each substitution; this is exactly the content of the corresponding change of generators in [F2]–[F5]. For the diagonal formulas, the substituted standard-basis element is the product of the images of the generators along a reduced expression, , and similarly and , using the product rule and independence of the standard basis in Reduced-word independence of T_w and the length-multiplication rules (1).
For the rank-one Kazhdan–Lusztig conversion, set , which is part 1's ; since and the relation for holds, the substitution is consistent, and satisfies by the computation of step 1.1. With one gets , the rank-one case of the recorded conversion [F6] with .
Scope and choice: this example compares four quadratic normalizations and verifies the exponent conversions of the standard bases in one rank-two family; it constructs no canonical basis, no Kazhdan–Lusztig polynomial and no positivity or bar-invariance statement, all of which remain in their designated proof homes, and the general coefficient conversion [F6] is supplied by the seam lemma. Every computation is a substitution in , and no choice is used.
A faithful canonical realization that is not reflection faithful: the affine rank-two system
Statement refuted
Every faithful realization of a finite-rank Coxeter system is reflection faithful in the sense of Elias–Williamson; in particular the canonical geometric realization of a Coxeter system is reflection faithful whenever its reflection representation is faithful.
Facts & Assumptions
Given: The rank-two system with , the group , the space , the Coxeter form and the canonical representation with , , and the root system (The real Coxeter form, its radical, reflections, and form-preserving maps, The canonical reflection homomorphism, roots, reflections, and the positive cone, Descent of the reflection representation, unit root norms, and conjugation of reflections).
The radicals of a bilinear form on are and ; for a symmetric form they coincide, and the form is degenerate exactly when the radical is nonzero. (The matrix, left and right radicals, rank, and nondegeneracy of a bilinear form on a finite-dimensional space, Bilinear forms, and symmetric, skew-symmetric, and alternating bilinear forms)
The matrix of a linear map in ordered bases has as its columns the coordinate columns of the images of the basis vectors. (Coordinate columns and matrices of linear maps relative to ordered bases)
The subgroup generated by a set is contained in every subgroup containing that set; in particular every element of lies in the set of finite products of the generators and their inverses, which is a subgroup containing them. (The subgroup generated by a subset, the cyclic subgroup , and cyclic groups)
Counterexample
The representation is faithful: is injective by clause (3) of The root-length criterion and faithfulness of the canonical reflection representation, applied to the system , . Hence is a faithful canonical realization of the system, and by clause (4)(a) of Hecke and Lie seam contract compatibility: the Artin-to-Hecke map, normalization conversions, root-length matching, and the reflection-faithfulness boundary the canonical construction is a realization in the sense of Elias–Williamson, with , and the functional .
The radical: since one has and (The real Coxeter form, its radical, reflections, and form-preserving maps). Hence and , so ; for , one has and . Thus lies in the radical exactly when . The radical is therefore the one-dimensional line , and is a hyperplane.
The radical is fixed pointwise by : for or and one has , so the reflection formula gives (Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order (2)); a composite of finitely many maps fixing a vector fixes it, and every element of is a finite product of the generators and their inverses by [F3]. Hence every element of , in particular for , fixes pointwise.
There are infinitely many reflections: by part (4) of The rank-two block computation, exact dihedral orders, the signed reflection action, and ambient reducedness, has infinite order in . Put ; since , induction gives and hence for every . Each lies in the reflection set (The canonical reflection homomorphism, roots, reflections, and the positive cone (2)), and the elements , , are pairwise distinct: if then right multiplication by gives , hence and because has infinite order. So has infinitely many reflections. Moreover for has infinite order, whereas every conjugate of or is an involution; hence these powers are not reflections.
The matrices of the two generators in the basis follow from the reflection formula with for : and , and , (The real Coxeter form, its radical, reflections, and form-preserving maps, Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order (3)). By step 1.2 the fixed space of is , and similarly : the two distinct reflections have the same fixed hyperplane. In coordinates [F2] differ in their -entries, so indeed while .
Every full fixed space of codimension one of an element of equals . Every element of is or for some with : repeatedly deleting adjacent equal letters from a word in (using ) leaves an alternating word, and the alternating words are , , and . For every reflection of , with , its image is with (Descent of the reflection representation, unit root norms, and conjugation of reflections (4)); its fixed space is , a hyperplane (Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order (2)) containing by step 1.3, hence equal to . For the elements write , whose matrix is the product of the two matrices of step 2.1, ; then satisfies , so for every (the case being when ), and with exactly when , i.e. exactly when ; the identity fixes all of , of codimension zero. For the elements one has because , so is an involution; it fixes pointwise by step 1.3, while , so its fixed space is a proper subspace containing the hyperplane , hence equals . Therefore the only full fixed space of codimension one of an element of is .
Conclusion: the assignment "reflection its fixed hyperplane" is not injective, since the distinct reflections of step 2.1 have the same image ; it also cannot be a bijection onto the codimension-one fixed subspaces, since by step 1.4 the set of reflections is infinite while by step 3.1 the set of full fixed spaces of codimension one of elements of is the singleton . Hence the faithful canonical realization is not reflection faithful in the sense of Elias–Williamson (Hecke and Lie seam contract compatibility: the Artin-to-Hecke map, normalization conversions, root-length matching, and the reflection-faithfulness boundary (4)), and any Soergel-calculus or Kazhdan–Lusztig argument invoking reflection faithfulness must supply a realization satisfying that hypothesis separately. The failure is caused by the degeneracy of : the radical is a codimension-one fixed subspace, fixed by non-reflections and by all reflections alike.
Scope and choice: this is a counterexample in the rank-two system ; it constructs no Soergel bimodule, no reflection-faithful realization and no Kazhdan–Lusztig object, and it claims nothing beyond the failure of reflection faithfulness for this canonical realization. Every argument is a finite matrix and line computation plus the supplied order, faithfulness and reflection facts, and no choice is used.
5 · Examples, counterexamples and false statements
None yet.
Sources
- Rachael Boyd, Homology of Coxeter and Artin groups (PhD thesis, University of Aberdeen 2018, corrected version)
- Michael W. Davis, The Geometry and Topology of Coxeter Groups (Princeton University Press 2008; author's complete PDF)
- George Lusztig, Hecke Algebras with Unequal Parameters (revised book text, arXiv:math/0208154v2)
- Ben Elias and Geordie Williamson, The Hodge theory of Soergel bimodules (arXiv:1212.0791v2)
- Ben Elias and Geordie Williamson, Soergel calculus (arXiv:1309.0865v1)
- Jon McCammond, The mysterious geometry of Artin groups (Winter Braids Lecture Notes Vol. 4 (2017), Course no I, pp. 1-30)