Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generated
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.

Standard parabolics in GL_n

Example

Assume the Axiom of Choice inherited from the named suppliers. Let k be a field and n≥1, G=GLn with standard split maximal torus T=Dn of diagonal matrices and standard Borel B of upper triangular matrices (The root datum of a split reductive group, Parabolic subgroups and Levi decomposition). The roots are αij=χi−χj (i≠j) with root groups Uij={I+aEij}, and the base is {αi,i+1:1≤i≤n−1}, identified with {1,…,n−1}. For I⊆{1,…,n−1} let Δ∖I={a1,a1+a2,…,a1+⋯+as−1} with ai≥1 and ∑ai=n; then PI consists of the block upper triangular matrices with diagonal blocks of sizes a1,…,as, arbitrary entries above the block diagonal and zero below, the standard Levi subgroup is LI=∏iGLai (block diagonal) and Ru(PI) is the block upper unitriangular subgroup, with identity diagonal blocks, zero blocks below them and arbitrary blocks above them; the multiplication Ru(PI)⋊LI→PI is an isomorphism, I↦PI is a bijection onto the smooth parabolic subgroup varieties containing B, and P∅=B, PΔ=G. The maximal proper parabolics PΔ∖{i} are the stabilizers of the partial flags with a single subspace of dimension i, and the Bruhat cells of the complete flag variety G/B are indexed by Sn with dim⁡Y(w)=n(w)=#{(i,j):i<j, w(i)>w(j)}.

Facts & Assumptions

Given: AC, a field k, n≥1, G=GLn with diagonal torus T=Dn, upper triangular Borel B, and the roots and root groups above (The root datum of a split reductive group).

[F1]

The standard root datum of GLn: X(T)=⨁iZχi, roots αij=χi−χj with αij∨=λi−λj and ⟨αij,αij∨⟩=2, root groups Uij={I+aEij}≅Ga, positive system i<j, base {αi,i+1} (The root datum of a split reductive group, Structure of SL_2 and root coordinates for the rank-one case).

[F2]

Parabolics and Levi decomposition: standard parabolics PI are described by subsets I of the base, Ru(PI)⋊LI→PI is an isomorphism with LI=CG(TI) the standard Levi subgroup, and the correspondence I↦PI is a bijection (Parabolic subgroups and Levi decomposition, Standard Levi subgroups of a split reductive group).

[F3]

Bruhat cells of G/B are indexed by W with dim⁡Y(w)=n(w) (Bruhat decomposition for a split reductive group, Root coordinate cells and generation). The inversion notation in Permutation Weyl group and inversion length is combinatorial; its finite-field group conventions are not used for the arbitrary-field claim here.

Verification

1.1F1givenalgebra

The roots and root groups of GLn are as in [F1]: the weight of the coordinate function χi on Dn is χi(diag⁡(x1,…,xn))=xi; the adjoint action on Eij gives the weight χi−χj, and the root group Uij consists of the elementary matrices I+aEij, isomorphic to Ga; the positive roots relative to B are those with i<j, and the simple roots αi,i+1 form the base of the root system An−1.

2.1F2step 1.1algebra

Let I⊆{1,…,n−1} and let the complement of I in the ordered set of simple roots be the partial sums listed, so that the integers a1,…,as≥1 sum to n. Choose a cocharacter with diagonal exponents constant within each block and strictly decreasing between consecutive blocks. Entrywise conjugation scales xij by the exponent difference, so its limit subgroup is precisely the group with zero blocks below the diagonal and its limit kernel has identity diagonal blocks. By [F2] its zero simple-root pairings recover I. Thus PI is the group of invertible matrices preserving the flag of subspaces 0⊆ka1⊆ka1+a2⊆⋯⊆kn, i.e. the block upper triangular matrices with diagonal blocks of sizes a1,…,as; its unipotent radical Ru(PI) has identity diagonal blocks, zeros below and arbitrary blocks above and its Levi factor is the block diagonal ∏iGLai; the multiplication map Ru(PI)⋊LI→PI is a group-scheme isomorphism by [F2], and P∅=B and PΔ=G because the corresponding flags are the complete flag and the trivial flag. The all-algebra matrix equations verify these stabilizers scheme-theoretically. For n=1 the simple-root set is empty, both endpoints are G=B=Gm, and its unipotent radical is trivial.

3.1F2F3step 2.1algebra∎

The maximal proper parabolics correspond to I=Δ∖{i}, i.e. to the stabilizers of a single subspace of dimension i: taking a1=i, a2=n−i gives the block upper triangular group with two diagonal blocks, which is the stabilizer of ki⊆kn, and the general PI is the intersection of these stabilizers over the cuts i∈Δ∖I, not over I. For n≥3, the minimal proper parabolics strictly above B are P{i}, since singletons are the minimal nonempty proper subsets of the base. For n≤2 there is no proper parabolic strictly between B and G; in particular, for n=2 the singleton gives G, rather than a proper parabolic. Finally, the simple-root reflections act on the characters χi by adjacent transpositions. Since they generate the Weyl group, its faithful lattice action is precisely Sn. The Bruhat cells of G/B are indexed by Sn, and the length n(w) equals the dimension of the cell by the length formula of [F3]. For the roots χi−χj with i<j, the count ∣Φ+∩wΦ−∣ is the inversion number of w−1. This equals the inversion number of w: (i,j)↦(w(j),w(i)) bijects their inversion sets. Thus the count is #{(i,j):i<j, w(i)>w(j)} over every field.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

51 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