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.
Unipotent double-coset biset splitting
Statement
Let , let be a prime power, put and let and be compositions of with blocks and and standard parabolics , (Compositions, partial flags, and standard parabolics, Block Levi decomposition of standard parabolics). Let be any permutation and let be its permutation matrix. One may in particular choose the block-increasing representative of a -double coset (Parabolic double cosets and block permutations, Permutation Weyl group and inversion length), and put Then:
- Subgroups and normalities. are subgroups of with , and ; and are subgroups of with , , , , normalising both and and .
- The biset splitting. Let be the set of equivalence classes of the pairs with and under the equivalence relation generated by the balanced product of the right -set and the left -set , and write for the class of . Then is well defined and is a bijection from onto the set of -double cosets inside .
- Equivariance. The formulas and define a left action of and a right action of on the set of claim 2; the formulas define a left action of and a right action of on the balanced product; and is equivariant for them, that is and .
Facts & Assumptions
Given: An integer , a prime power , the group , compositions and of with blocks and , the standard parabolics and , a permutation , its permutation matrix , and the groups displayed in the statement.
For every composition of with blocks , writing for the index with , the standard parabolic , its Levi subgroup and its unipotent radical of Compositions, partial flags, and standard parabolics satisfy , , the multiplication map is a bijection (so that each has a unique factorisation with , ), , and, with the -block diagonal part of defined by when and otherwise, one has and is the Levi factor of , that is with (Compositions, partial flags, and standard parabolics, Block Levi decomposition of standard parabolics).
For the permutation matrix satisfies exactly when , and , and the classes identify with the Weyl group (Permutation Weyl group and inversion length); consequently is invertible with , and for every matrix and all one has , the entry formula for the product coming from the permutation-matrix entries together with (Matrix multiplication is associative, unital, distributive, and compatible with scalar multiplication, Rectangular matrix multiplication and the identity matrix , including zero-sized shapes).
Matrix multiplication over a field is associative, distributes over addition and is compatible with scalar multiplication (Matrix multiplication is associative, unital, distributive, and compatible with scalar multiplication), and the entry of a product of matrices is (Rectangular matrix multiplication and the identity matrix , including zero-sized shapes).
In a group, the intersection of a nonempty family of subgroups is a subgroup (The intersection of a nonempty family of subgroups of is a subgroup of ); a subgroup is normal when for all (Normal subgroup: invariance under conjugation); and for a subgroup the left coset is (Left and right cosets and of a subgroup, Subgroup).
Every -double coset of contains exactly one -block-increasing permutation , which is its unique element of minimal inversion length, and is a bijection from the set of these double cosets onto the set of -double cosets of (Parabolic double cosets and block permutations).
A left action of a group on a set is a map with and for all , (Left group actions, transitive actions, and faithful actions); a right action of on is a map , written , with and for all , , an axiom pair verified below directly from associativity in .
The two extreme compositions give with , and with , , where is the diagonal torus and the standard maximal unipotent subgroup; and for one has and (Compositions, partial flags, and standard parabolics, Block Levi decomposition of standard parabolics, Standard subgroups of finite general linear groups).
Proof
The transported blocks and the groups . Put for , so that exactly when ; by [L2] one has for every matrix , so applying the criteria of [L1] to the composition gives and then , (both contain , and an element with , satisfies ), (as ), are subgroups of and , because products and inverses are carried by and by [L3], and for and one has since by [L1].
The subgroups . The sets , and are subgroups of by [L4], and , , , hold by definition; moreover by step 1.1.
The projection onto . Since with and by step 1.1, every has a unique factorisation with and : if with , , then , so and . Define by for ; then for all , and is a group homomorphism with kernel , because for and one has with and by [L3] and step 1.1, so the factorisation of is and , while holds exactly when .
The components of lie in . Let and let be its factorisation from [L1] with and ; put and , so that with and . Then is the -block diagonal part of : if lie in the same -block , then, since is block diagonal and has identity diagonal blocks, ; entries of between different -blocks are zero. Hence : if then either and , or and because by the criterion of step 1.1. Finally , because is a subgroup containing and by step 1.1.
is well defined. First, changing representatives of the two cosets does not change the image. If , then because normalises by step 1.1; hence , because . If , then by [L1], so . Second, for the two sides of the generating balancing relation have the same image, since by [L3]: Finally, takes values in the specified -double cosets inside : writing with gives .
Normalisation by . Let . Then and , because and by [L1]; and , because ; and , because and by step 1.1. Hence and , so normalises and . Consequently right multiplication by on and left multiplication by on are well defined.
The -block diagonal part, and . For let be the -block diagonal part of , that is when and otherwise; then . Indeed, write with and with , as in [L1]; the conjugation formula of [L2] gives , and by step 1.1, while by [L1], so the factorisation with and is the one of step 2.2 and . Consequently, for the element lies in : its entries are entries of inside -blocks and zero elsewhere, and vanishes off the -block diagonal by [L1]; hence . Moreover with : here by step 2.2, and because normalises the normal subgroup of step 1.1, while as a product of elements of ; so .
is surjective. Let , say with and . By [L1] write with , and with , , and put , so that and . Then because (as and by [L1]) makes , and since . Hence every -double coset inside lies in the image of .
Claim 3: the two biset structures agree. For and the formulas and are well defined (as and by [L1]) and satisfy the axioms of [L6], so they are a left action of and a right action of . On the balanced product the formulas and are well defined, because they carry the generating relation to a relation of the same form, and for ; they are actions because is a subgroup and is a homomorphism (it is conjugation by the fixed element and , while and by [L3]). Finally, for one has , so
The -component of . For one has . Indeed is the -block diagonal part of by step 3.2, so and for all , while whenever and : if then , and if then by the criterion for in [L1]. Hence and .
is injective. Let and with , that is . Then there are and with ; putting gives and hence where , and . Therefore with , because normalises by step 1.1; so by step 1.1 and by [L1], that is , and step 2.3 gives and . Applying the homomorphism of step 2.2 to gives since satisfies and by step 2.2; with by step 4.1 and by step 3.2 this is . By step 3.2 applied to we have with , so . Hence and , and the pair is related to by the generating relation, because and ; therefore , so is injective.
Claims 1 and 2. Steps 1.1, 2.1 and 3.1 prove claim 1. Step 2.4 shows that is well defined on the balanced product, step 3.3 that it is surjective onto the set of -double cosets inside , and step 5.1 that it is injective; hence is a bijection, which is claim 2, the set being by [L5] the double coset attached to the -double coset of . The entry and projection arguments above used no block-increasing hypothesis.
The extreme cases. For one has and by [L7], so , , and ; the balanced product is the quotient of by and is in bijection with via the well-defined map (with inverse ), while the double cosets inside are the singletons, so claim 2 reads via , each target double coset being a singleton. For one has and by [L7], so (the conjugation formula of [L2] only permutes the diagonal positions), , , and , because by [L7] and is a conjugate of ; the balanced product is therefore and claim 2 specialises to a bijection . For one has , and by [L7], so , and claim 2 is the tautological bijection from onto the singletons inside .
Conclusion. Claims 1, 2 and 3 of the statement are steps 6.1, 6.1 and 3.4, with the extreme cases verified in step 7.1; the proof is complete. ∎
Depends on
- Compositions, partial flags, and standard parabolics
- Block Levi decomposition of standard parabolics
- Permutation Weyl group and inversion length
- Parabolic double cosets and block permutations
- Matrix multiplication is associative, unital, distributive, and compatible with scalar multiplication
- Rectangular matrix multiplication and the identity matrix $I_n$, including zero-sized shapes
- The intersection of a nonempty family of subgroups of $G$ is a subgroup of $G$
- Normal subgroup: invariance under conjugation
- Left and right cosets $gH$ and $Hg$ of a subgroup
- Subgroup
- Left group actions, transitive actions, and faithful actions
- Standard subgroups of finite general linear groups
Used by
Dependency tree · two levels
46 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.
Sources
- Olivier Dudas and Jean Michel, Lectures on Finite Reductive Groups and Their Representations - Lemma 9.11 and its proof, printed p. 39 (standard reference, not scraped)
- Jay Taylor, Finite Reductive Groups - Harish-Chandra section, printed pp. 41-43 (standard reference, not scraped)