Flag (linear Algebra) Article Index for
Flag
Website Links For
Flag
 

Information About

Flag (linear Algebra)




In Mathematics , particularly in Linear Algebra , a flag is an increasing sequence of Subspace s of a Vector Space ''V''. Here "increasing" means each is a proper subspace of the next (see Filtration ):
:\{0\} = V_0 \sub V_1 \sub V_2 \sub \cdots \sub V_k = V.
If we write the dim ''V''''i'' = ''d''''i'' then we have
:0 = d_0 < d_1 < d_2 < \cdots < d_k = n,
where ''n'' is the Dimension of ''V'' (assumed to be finite-dimensional). Hence, we must have ''k'' ≤ ''n''. A flag is called a complete flag if ''d''''i'' = ''i'', otherwise it is called a '''partial flag'''.

A partial flag can be obtained from a complete flag by deleting some of the subspaces. Conversely, any partial flag can be completed (in many different ways) by inserting suitable subspaces.

The signature of the flag is the sequence ''d''0, ''d''1, … ''d''''k''.


BASES


An ordered Basis for ''V'' is said to be adapted to a flag if the first ''d''''i'' basis vectors form a basis for ''V''''i'' for each 0 ≤ ''i'' ≤ ''k''. Standard arguments from linear algebra can show that any flag has an adapted basis.

Any ordered basis gives rise to a complete flag by letting the ''V''''i'' be the span of the first ''i'' basis vectors. For example, the standard flag in R''n'' is induced from the Standard Basis {''e''1, …, ''e''''n''} where ''e''''i'' denotes the vector with a 1 in the ''i''th slot and 0's elsewhere.

An adapted basis is almost never unique (trivial counterexamples); see below.

A complete flag on an Inner Product Space has an essentially unique Orthonormal Basis : it is unique up to multiplying each vector by a unit (scalar of unit length, like 1, -1, ''i''). This is easiest to prove inductively, by noting that v_i \in V_{i-1}^\perp < V_i, which defines it uniquely up to unit.

More abstractly, it is unique up to an action of the , and the inner product corresponds to the Maximal Compact Subgroup .


STABILIZER

The stabilizer of the standard flag is the Upper Triangular matrices.

More generally, the stabilizer of a flag (the Linear Operators on ''V'' such that T(V_i) < V_i for all ''i'') is, in matrix terms, the Algebra of block Upper Triangular matrices (with respect to an adapted basis), where the block sizes d_i-d_{i-1}. The stabilizer of a complete flag is the Upper Triangular matrices (with respect to an adapted basis). In a basis adapted to a complete flag, Lower Triangular matrices are the stabilizer of the orthogonal flag (given by W_i = V_{n-i}^\perp).

If we take the operators to be invertible, then we call the stabilizer of a complete flag a Borel Group , and stabilizers of partial flags Parabolic Subgroup s.

The (invertible) stabilizer acts freely transitively on adapted bases, and thus these are not unique unless the stabilizer is trivial, which happens in these degenerate cases:
the trivial flag consisting of just \{0\}, or the flag on a vector space over \mathbf{F}_2 with just a 1-dimensional (and optionally 0-dimensional) component.


SUBSPACE NEST


In an infinite-dimensional space ''V'', as used in Functional Analysis , the flag idea generalises to a subspace nest, namely a collection of subspaces of ''V'' that is a Total Order for inclusion and which further is closed under arbitrary intersections and closed linear spans. See Nest Algebra .


SEE ALSO