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.
A crossing double transposition whose interval is Boolean, and the two incomparable maximal Coxeter elements of S3
Example
(1) A crossing interval that is a lattice. In let and . Then , and its absolute interval is a Boolean lattice on two generators. The support partition is crossing, so by the type-A criterion (The Kreweras complement of [1,c], and the type-A model by noncrossing set partitions (2)–(3)). Directly, has reflection length , so the absolute-order length equality for fails (Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator (2)). Thus a non-Coxeter element can have a lattice interval.
(2) The absolute order of is not a lattice. With and , the two Coxeter elements are and (The symmetric group has the Coxeter presentation). They are distinct maximal and incomparable elements of reflection length in , and have no common upper bound. Each interval and is the five-element lattice , with the top element replaced by in the second interval.
Facts & Assumptions
Given: The symmetric groups , their usual right-to-left permutation composition, the reflection-length absolute order, and the type-A length and interval criterion of The Kreweras complement of [1,c], and the type-A model by noncrossing set partitions.
In , is the set of transpositions and , with fixed points counted (The Kreweras complement of [1,c], and the type-A model by noncrossing set partitions (2)).
exactly when ; exactly for (Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator (1)–(2)).
In , the adjacent transpositions are the simple reflections of type , and composition acts from right to left (The symmetric group has the Coxeter presentation, The finite symmetric group , one-line notation, and cycle notation).
Verification
Given: The data above.
(The interval below the crossing element.) By [F1], . If is a transposition, then . For or , is the other transposition, so and . The remaining four transpositions join the two cycles of ; explicitly, , , , and , each a 4-cycle of reflection length . None is below . If , [F2] gives ; length forces , and length forces , hence . Therefore the displayed four elements are the entire interval. Its two distinct atoms have meet and join , so it is the Boolean lattice on two generators.
(The two maximal elements.) By [F1], the identity, the three transpositions, and the two 3-cycles are exactly the elements of , with reflection lengths , respectively. The products are and . They are distinct and have equal length, so [F2] makes them incomparable. No element has length greater than , so each is maximal. A common upper bound would have to be strictly above one of these distinct maximal elements; hence none exists and has no join for this pair.
(The crossing obstruction.) The diagonals joining to and to cross in the square, so the support partition of is crossing. Also direct right-to-left multiplication gives , which has length by [F1], while and . Thus , so by [F2]. This verifies directly the exclusion predicted by the type-A criterion.
(The Coxeter intervals are five-element lattices.) Fix either 3-cycle . For , the products for are , respectively; for they are . Hence every satisfies and lies below . If has length , [F2] forces , so . Therefore . Its three transpositions are incomparable atoms, any two have meet and join , so this interval is a five-element lattice. Finally, , so the two Coxeter elements are conjugate.
Depends on
- The Kreweras complement of [1,c], and the type-A model by noncrossing set partitions
- Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator
- The finite symmetric group $S_n$, one-line notation, and cycle notation
- The symmetric group has the Coxeter presentation
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
26 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.