In mathematics, particularly in linear algebra, a flag is an increasing sequence of subspaces of a finite-dimensional vector space V. Here "increasing" means each is a proper subspace of the next (see filtration):
The term flag is motivated by a particular example resembling a flag: the zero point, a line, and a plane correspond to a nail, a staff, and a sheet of fabric.
If we write that dimVi = di then we have
where n is the dimension of V (assumed to be finite). Hence, we must have k ≤ n. A flag is called a complete flag if di = i for all 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 (d1, ..., dk).
An ordered basis for V is said to be adapted to a flag V0 ⊂ V1 ⊂ ... ⊂ Vk if the first di basis vectors form a basis for Vi 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 Vi be the span of the first i basis vectors. For example, the in Rn is induced from the standard basis (e1, ..., en) where ei denotes the vector with a 1 in the ith entry and 0's elsewhere. Concretely, the standard flag is the sequence of subspaces:
An adapted basis is almost never unique (the counterexamples are trivial); 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, e.g. 1, −1, i). Such a basis can be constructed using the Gram-Schmidt process. The uniqueness up to units follows inductively, by noting that lies in the one-dimensional space .
More abstractly, it is unique up to an action of the maximal torus: the flag corresponds to the Borel group, and the inner product corresponds to the maximal compact subgroup.
The stabilizer subgroup of the standard flag is the group of invertible upper triangular matrices.
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
The course introduces the paradigm of quantum computation in an axiomatic way. We introduce the notion of quantum bit, gates, circuits and we treat the most important quantum algorithms. We also touch
In mathematics, the field with one element is a suggestive name for an object that should behave similarly to a finite field with a single element, if such a field could exist. This object is denoted F1, or, in a French–English pun, Fun. The name "field with one element" and the notation F1 are only suggestive, as there is no field with one element in classical abstract algebra. Instead, F1 refers to the idea that there should be a way to replace sets and operations, the traditional building blocks for abstract algebra, with other, more flexible objects.
In mathematics, a generalized flag variety (or simply flag variety) is a homogeneous space whose points are flags in a finite-dimensional vector space V over a field F. When F is the real or complex numbers, a generalized flag variety is a smooth or complex manifold, called a real or complex flag manifold. Flag varieties are naturally projective varieties. Flag varieties can be defined in various degrees of generality. A prototype is the variety of complete flags in a vector space V over a field F, which is a flag variety for the special linear group over F.
In mathematics, the Grassmannian Gr(k, V) is a space that parameterizes all k-dimensional linear subspaces of the n-dimensional vector space V. For example, the Grassmannian Gr(1, V) is the space of lines through the origin in V, so it is the same as the projective space of one dimension lower than V. When V is a real or complex vector space, Grassmannians are compact smooth manifolds.
We generalize the class vectors found in neural networks to linear subspaces (i.e., points in the Grassmann manifold) and show that the Grassmann Class Representation (GCR) enables simultaneous improvement in accuracy and feature transferability. In GCR, e ...
Ieee Computer Soc2023
,
In this paper, we study the rank-one convex hull of a differential inclusion associated to entropy solutions of a hyperbolic system of conservation laws. This was introduced in [B. Kirchheim, S. Muller and V. S(sic)ver & aacute;k, Studying Nonlinear PDE by ...
WORLD SCIENTIFIC PUBL CO PTE LTD2023
, ,
We study the problem of computing the matrix exponential of a block triangular matrix in a peculiar way: Block column by block column, from left to right. The need for such an evaluation scheme arises naturally in the context of option pricing in polynomia ...