Borel subalgebra

In mathematics, specifically in representation theory, a Borel subalgebra of a Lie algebra is a maximal solvable subalgebra.[1] The notion is named after Armand Borel.

If the Lie algebra is the Lie algebra of a complex Lie group, then a Borel subalgebra is the Lie algebra of a Borel subgroup.

Borel subalgebra associated to a flag

Let be the Lie algebra of the endomorphisms of a finite-dimensional vector space V over the complex numbers. Then to specify a Borel subalgebra of amounts to specify a flag of V; given a flag , the subspace is a Borel subalgebra,[2] and conversely, each Borel subalgebra is of that form by Lie's theorem. Hence, the Borel subalgebras are classified by the flag variety of V.

Borel subalgebra relative to a base of a root system

Let be a complex semisimple Lie algebra, a Cartan subalgebra and R the root system associated to them. Choosing a base of R gives the notion of positive roots. Then has the decomposition where . Then is the Borel subalgebra relative to the above setup.[3] (It is solvable since the derived algebra is nilpotent. It is maximal solvable by a theorem of Borel–Morozov on the conjugacy of solvable subalgebras.[4])

Given a -module V, a primitive element of V is a (nonzero) vector that (1) is a weight vector for and that (2) is annihilated by . It is the same thing as a -weight vector (Proof: if and with and if is a line, then .)

gollark: These are done → muahahaha.
gollark: ... also array literals, bee their bad docs.
gollark: Please also give me write access to the repo.
gollark: Oh, right, array indexing.
gollark: ```python# parsita-based pseudocode syntax parserfrom stmt import *from parsita import *from parsita.util import constantdef compose(f, g): return lambda x: f(g(x))def map_expr(x): start, end = x if end == "": return start return Op([start, end[1]], end[0])def map_unop_expr(x): return Op(x[1], x[0])def aliases(name, aliases): p = lit(name) for alias in aliases: p |= (lit(alias) > (lambda _: name)) return pclass ExprParser(TextParsers): ε = lit("") IntLit = reg("\-?[0-9]+") > compose(IntLit, int) StrLit = "'" >> reg("[^']*") << "'" > StrLit # TODO escapes (not in "spec" but could be needed) FloatLit = reg("\-?[0-9]+\.[0-9]+") > compose(FloatLit, float) Identifier = reg("[a-zA-Z_]+[a-zA-Z_0-9]*") > Var BracketedExpr = "(" >> Expr << ")" UnaryOperator = lit("NOT") Start = FloatLit | StrLit | IntLit | BracketedExpr | (UnaryOperator & Expr > map_unop_expr) | Identifier # avoid left recursion problems by not doing left recursion # AQA pseudocode does not appear to have a notion of "operator precedence", simplifying parsing logic nicely BinaryOperator = aliases("≤", ["<="]) | aliases("≠", ["!="]) | aliases("≥", [">="]) | lit("DIV") | lit("MOD") | lit("AND") | lit("OR") | reg("[+/*\-=<>]") End = (BinaryOperator & Expr) | ε Expr = (Start & End) > map_exprparse = ExprParser.Expr.parsex = parse("1+2+3 != 6 AND NOT 4 AND x + y")if isinstance(x, Failure): print(x.message)else: print(x.value)```

See also

References

  1. Humphreys, Ch XVI, § 3.
  2. Serre, Ch I, § 6.
  3. Serre, Ch VI, § 3.
  4. Serre 2000, Ch. VI, § 3. Theorem 5.
  • N.Chriss and V.Ginzburg: Representation Theory and Complex Geometry.
  • Humphreys, James E. (1972), Introduction to Lie Algebras and Representation Theory, Berlin, New York: Springer-Verlag, ISBN 978-0-387-90053-7.
  • Serre, Jean-Pierre (2000), Algèbres de Lie semi-simples complexes [Complex Semisimple Lie Algebras], translated by Jones, G. A., Springer, ISBN 978-3-540-67827-4.


This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.