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.
Relative position classifies pairs of complete flags
Statement
Let , let be a prime power, put and , let be the set of complete flags with , and let be the standard flag with , so that the stabiliser of is the standard Borel subgroup and acts on by componentwise transport (Complete flags are G/B). Write for the flag with components and consider the diagonal action of on . Then:
- Invariant. The assignment is a well-defined -invariant map , and its fibres are exactly the diagonal -orbits; composing with the Bruhat bijection of Bruhat decomposition of GL_n over a finite field therefore gives a bijection from the set of diagonal orbits on onto . The permutation attached to a pair is its relative position.
- Intersection dimensions. For and all , where is the rank of the submatrix of on the rows and the columns , with the convention . Consequently for a pair with and all in particular, if is the standard flag and , then : the southwest ranks of a matrix sending the standard flag to compute the intersection dimensions.
- Complete invariant. Two pairs and lie in the same diagonal -orbit if and only if for all , if and only if and have the same southwest rank matrix; in particular the intersection dimensions determine the relative position . The diagonal orbits, the relative positions and the double cosets are thus in canonical bijection.
Facts & Assumptions
Given: An integer , a prime power , the space with its standard basis and standard flag , the group with standard Borel subgroup , the set of complete flags of , and the diagonal action of on .
acts on by , the standard flag is complete with , its stabiliser is , and is a -equivariant bijection (Complete flags are G/B).
and is a bijection from onto the set of double cosets (Bruhat decomposition of GL_n over a finite field).
For and let be the rank of the submatrix on the rows and the columns . Then for , if then , and, for , the rank matrix determines and hence the double coset (Southwest rank matrices determine Bruhat cells).
, and , and is an ordered basis of (Standard subgroups of finite general linear groups, The standard list with and for is an ordered basis of ; hence , and is the zero space with basis and dimension , Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis).
For finite-dimensional linear subspaces of a vector space over a field one has (The dimension formula: for finite-dimensional linear subspaces and of , the subspaces and are finite-dimensional and ).
If is finite-dimensional and is a linear subspace, then (A quotient basis lifts to a basis adapted to ), and a linearly independent subset of a finite-dimensional space is contained in a basis (If and is a linear subspace of , then is finite-dimensional, , and if and only if ).
For ordered bases of and of the matrix of a linear map has as its -th column the coordinate column of (Coordinate columns and matrices of linear maps relative to ordered bases).
For a matrix over a field, the rank is the dimension of its column space and equals the dimension of its row space (Row space, column space, nullspace, row rank, column rank and matrix rank).
A function is injective when implies , surjective when every equals for some , and bijective when it is both; denotes the image of under and its preimage (Injection, surjection, bijection). An invertible linear map, called a linear isomorphism, satisfies two inverse equations that make it bijective (Invertible linear maps, linear isomorphisms, and inverse linear maps).
A finite list of vectors is linearly independent when every list of scalars with has all , and a basis is a linearly independent spanning set (Linear independence: a finite list is independent when forces every , and a subset is independent when every injective finite list into is independent, Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis).
Proof
Well-definedness of . Suppose and in . Then stabilises every , hence by [L1], so with ; likewise with . Therefore , so : the class does not depend on the chosen representatives.
A quotient identification. Fix and , and let be the linear map , where denotes placed in the first coordinates. Its image is , so by [L6], [L5] and of [L4] we have , where because is bijective by [L9] and is the image of . The images of the basis vectors of [L4] form a basis of : they span, because lie in , so the class of every lies in their span; and they are linearly independent, because a relation means , by [L4] and [L10]. Therefore, by [L7], the matrix of with respect to the standard basis of and this basis of is the submatrix of on the rows and the columns , whose rank equals by [L8]. Comparing the two computations gives for , and for both sides equal because and by the convention of the statement.
-invariance. For the representatives give , so : the map is constant on diagonal orbits. It is surjective, since for every .
Pairs of flags. Let and . The invertible linear map satisfies , and it preserves dimensions by [L9]; hence by step 1.2 with we get . For the representative may be taken to be , so for any with .
The fibres of are the orbits. Suppose , that is . Then for some , so . Put . Then , so because stabilises by [L1]; and , so as well. Hence lies in the same diagonal orbit. Together with step 2.1 this shows that two pairs have the same image under exactly when they lie in the same diagonal orbit.
The dimension function is a complete invariant. Suppose for all . By step 2.2 the rank matrices of and satisfy for all ; since is fixed by the convention of the statement and because are invertible, this determines the whole southwest rank matrix of [L3], so and lie in one double coset by [L3]. Then step 3.1 shows that the two pairs lie in the same diagonal orbit. Conversely, if the pairs lie in the same orbit, say with , then and , so and the dimensions agree by [L9].
By step 4.1 the fibres of the composite assignment (pair intersection-dimension function southwest rank matrix double coset) are exactly the diagonal orbits, and by step 3.1 the fibres of are the same orbits; the Bruhat decomposition [L2] identifies the double cosets bijectively with through . Hence is well defined, is determined by the intersection dimensions , and classifies the diagonal -orbits on . In particular, when the southwest rank matrix of the single matrix with determines by [L3], while two choices with differ by right multiplication by an element of and give the same rank matrix by the first assertion of [L3]. ∎
Remark. The relative position is the analogue for complete flags of the Bruhat index of a matrix: the double coset records how the two flags are positioned, and the intersection dimensions are the coordinate-free form of the southwest rank matrix. The dimension identity of step 1.2 is the only place where the direction of the picture enters: the ranks are taken on the rows , so the formula pairs the prefix flag with the suffix quotient .
Depends on
- Complete flags are G/B
- Bruhat decomposition of GL_n over a finite field
- Southwest rank matrices determine Bruhat cells
- Standard subgroups of finite general linear groups
- The dimension formula: for finite-dimensional linear subspaces $U$ and $W$ of $V$, the subspaces $U + W$ and $U \cap W$ are finite-dimensional and $\dim_F(U+W) + \dim_F(U \cap W) = \dim_F U + \dim_F W$
- If $\dim_F V = n$ and $U$ is a linear subspace of $V$, then $U$ is finite-dimensional, $\dim_F U \le n$, and $\dim_F U = n$ if and only if $U = V$
- A quotient basis lifts to a basis adapted to $W$
- Coordinate columns $[v]_{\mathcal B}$ and matrices $[T]_{\mathcal B}^{\mathcal C}$ of linear maps relative to ordered bases
- Row space, column space, nullspace, row rank, column rank and matrix rank
- Linear independence: a finite list $v : n \to V$ is independent when $\sum_{i<n} \lambda_i v_i = 0_V$ forces every $\lambda_i = 0_F$, and a subset $S \subseteq V$ is independent when every injective finite list into $S$ is independent
- Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis
- Injection, surjection, bijection
- The standard list $e : n \to F^{n}$ with $e_i(i) = 1_F$ and $e_i(j) = 0_F$ for $j \ne i$ is an ordered basis of $F^{n}$; hence $\dim_F F^{n} = n$, and $F^{0}$ is the zero space with basis $\varnothing$ and dimension $0$
- Invertible linear maps, linear isomorphisms, and inverse linear maps
Used by
Dependency tree · two levels
71 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 - Example 4.5 and Lemma 4.7, printed p. 18 (standard reference, not scraped)
- Jay Taylor, Finite Reductive Groups - Exercise 4.28, printed pp. 38-39 (standard reference, not scraped)