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 noncrossing interval of a dihedral group: a five-reflection claw for I2(5) and its complement
Example
Let be an integer and let be the Coxeter system with and . Put and let , , and be its reflection set, reflection length, and absolute order (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups, Coxeter diagrams: edges, labels, components and finite type, Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator). Then has order , is of finite type ( for and for ), and has exactly elements. The Coxeter form on is positive definite for every such finite , in particular for and (The real Coxeter form, its radical, reflections, and form-preserving maps).
(1) The interval. Every reflection has length one; every nonidentity rotation has length two; and Thus the interval has elements and . For it is a five-reflection claw, and for it is a four-reflection claw.
(2) The lattice. The interval is a lattice. For distinct reflections , and ; also , , , and . This is the corresponding instance of the finite-type lattice theorem (Finite noncrossing intervals are lattices, independently of the Coxeter element (2),(4)).
(3) Kreweras complement. On let (Coxeter elements, the noncrossing interval [1,c], and the Kreweras map w ↦ w⁻¹c, The Kreweras complement of [1,c], and the type-A model by noncrossing set partitions (1)). It interchanges and . If for , then and Thus permutes the reflections in one -cycle, and is the identity on for ; for , it rotates the reflection axes through in the orthonormal orientation used below (an angle of magnitude ), giving one -cycle when is odd and two cycles of length when is even.
Facts & Assumptions
Given: The rank-two Coxeter presentation with finite label , its real Coxeter form, the reflection-length absolute order, and the interval/Kreweras conventions above.
The group is presented by and , and a map from to any group that satisfies these relations extends uniquely to a homomorphism (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups).
is the minimum number of factors from and exactly when (Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator (1)–(2)).
The real Coxeter form satisfies and for finite (The real Coxeter form, its radical, reflections, and form-preserving maps (1)–(2)).
On a finite-type noncrossing interval, is an order-reversing bijection and (The Kreweras complement of [1,c], and the type-A model by noncrossing set partitions (1)).
Sine is positive on (Pi is the first positive zero of sine); (Parity and the Pythagorean identity for sine and cosine); and the sine and cosine addition formulas hold (The addition formulas for sine and cosine).
The canonical homomorphism sends to the orthogonal reflections with normals , and conjugation transports reflection normals by (The canonical reflection homomorphism, roots, reflections, and the positive cone (1),(2), Descent of the reflection representation, unit root norms, and conjugation of reflections (1),(4)).
Verification
Given: The data above.
(The dihedral group and its reflections.) The defining relations give , , and . The order of is exactly : if , let and on . Since and , the assignment , satisfies and , so [F1] gives a homomorphism with the image of of order . If , map to the independent coordinate flips of ; these are commuting involutions, satisfy the defining relations, and their product has order . Since in , in both cases has exact order . Now and , so every word reduces to or , with taken modulo . These at most forms are distinct: the are distinct by the exact order just proved, the are distinct by cancellation, and the two families are separated by the homomorphism with , which exists by [F1] because both simple generators map to and maps to . Thus . The reflection set is exactly . Every conjugate of or has and is therefore in this list. Conversely, for every integer , and, since , . The exponents and cover all residues modulo , so every is a conjugate of a simple reflection. In particular .
(The Coxeter form and its plane action.) Put and . For , [F3] and [F5] give . Since , [F5] gives , so this is positive for every nonzero . In orthonormal coordinates take and . The reflection formula and [F5] give Thus rotates this plane through . The order calculation in step 1.1 proves finite type, including , where commute and the diagram consists of two isolated vertices.
(Reflection lengths.) Every is nonidentity and is itself a reflection, so . Each nonidentity rotation is not in by the sign , and is a product of two reflections; hence . In particular has length .
(The interval below .) The identity and lie below . For , is a conjugate of an involutory simple reflection, so , and so and every reflection lies below . If is a rotation other than or , then is also a nonidentity rotation, so . These are all group elements by step 1.1, proving the interval formula. When there are no rotations other than , so the same argument covers that case.
(Lattice operations.) The interval in step 3.1 has bottom , top , and distinct reflections of equal length between them. Distinct reflections are incomparable by [F2], since each has the same length and a strict absolute-order comparison would require positive length increase. Thus two distinct reflections have only as common lower bound and only as common upper bound; operations with and are forced by their bottom/top roles. This proves the displayed lattice operations directly and verifies the finite-type lattice conclusion in this example.
(Kreweras action on reflections.) By [F4], is an order-reversing bijection; its explicit action is , , and by step 3.1. It therefore cycles through all reflections. Direct multiplication gives and . By [F6] and step 1.2, this conjugation rotates each reflection axis through in the displayed orientation (an angle of magnitude ); for , a rotation through fixes every unoriented axis. Iterating returns to exactly when divides . The least positive such is for odd and for even . Hence has one cycle for odd , two cycles for even , and is the identity on when .
Depends on
- Coxeter elements, the noncrossing interval [1,c], and the Kreweras map w ↦ w⁻¹c
- Finite noncrossing intervals are lattices, independently of the Coxeter element
- The Kreweras complement of [1,c], and the type-A model by noncrossing set partitions
- Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups
- Coxeter diagrams: edges, labels, components and finite type
- The real Coxeter form, its radical, reflections, and form-preserving maps
- Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator
- The canonical reflection homomorphism, roots, reflections, and the positive cone
- Descent of the reflection representation, unit root norms, and conjugation of reflections
- Pi is the first positive zero of sine
- Parity and the Pythagorean identity for sine and cosine
- The addition formulas for sine and cosine
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
82 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.