A first-order signature specifies sorts, function symbols with specified input and output sorts, and relation symbols with specified input sorts. A coherent formula is built from atomic relations and equalities using , , finite logical conjunctions, finite logical disjunctions, and existential quantification. A coherent theory is a set of sequents between coherent formulas in a common finite context; its axioms are interpreted as universally closed implications. Neither general negation nor universal quantification is allowed inside coherent formulas.
One complete presentation of coherent logic consists of the following axiom and rule schemes, together with the theory's sequents. All displayed formulas have compatible sorts and contexts, and bound variables can be renamed.
Identity and cut give and
Substitution replaces the free variables of any derivable sequent by well-typed terms, avoiding capture. Contexts can be enlarged by unused variables, and permuted or renamed.
The finite-meet rules are , , , and
The finite-join rules are , , , and
Include distributivity .
Existential introduction is . Existential elimination is
where is absent from . Equivalently, the quantifier is left adjoint to weakening along the context projection. Include the Frobenius rule in coherent logic
It can also be derived from the usual coherent natural-deduction rules.
Equality has and the substitution scheme
including atomic formulas and terms of the signature. Symmetry, transitivity and congruence for all functions and relations follow. These schemes impose no unintended inhabitedness axiom on a sort.
The coherent syntactic category has objects formulas in context , up to renaming. An arrow from to is an equivalence class, modulo provable equivalence, of formulas satisfying
and
These are provably total functional relations. The identity is the equality graph restricted by . If and are consecutive arrows, their composite is represented by . Equality, cut and existential rules give the category laws.
A coherent category has finite limits, pullback-stable regular-epi/mono image factorizations, and finite unions of subobjects stable under pullback. We verify these structures syntactically. The terminal object is the empty-context truth formula. Products conjoin formulas in disjoint contexts; equalizers add equality of the two output tuples. For a functional relation , its image in the target is represented by . Its factor onto that image is regular epic: two arrows out of the image agreeing on the source agree by existential elimination, and the same argument with the kernel pair gives the coequalizer property. Frobenius makes these image factorizations stable under pullback.
Every subobject of is represented by a formula with . Indeed, take the existential image of a monic functional relation; uniqueness makes its map to that image an isomorphism. Subobject inclusion is exactly provable implication. Finite unions are consequently disjunctions, with bottom as the empty subobject; distributivity and substitution make them pullback-stable. Hence is coherent.
The conservative syntactic model interprets a sort by , a function by its term graph, and a relation by its atomic-formula subobject. Induction on coherent formulas shows that is interpreted by the subobject of its context object. It satisfies every theory axiom by construction. Conversely, a sequent holds in this model exactly when the corresponding subobject inclusion holds, which is exactly derivability in . Therefore
This is conservativity for coherent sequents, not a claim about non-coherent formulas.
A local operator, also called a Lawvere-Tierney topology, is a map which internally satisfies
The closure operation of a local operator sends a mono with characteristic map to the subobject classified by . It is inflationary, idempotent and pullback-stable. A mono is j-dense if its closure is its whole codomain, and j-closed if it equals its closure. A j-sheaf is an object for which restriction
is a bijection for every j-dense mono ; requiring only injectivity defines a j-separated object.
Here is a construction underlying the sheaf reflector for a local operator. The closed-subobject classifier is a j-sheaf: closed subobjects on a dense subobject extend uniquely by taking their closure in the larger object. Powers are also sheaves, because products of a dense mono with remain dense. A j-closed subobject of a sheaf is a sheaf: first extend a map into the ambient sheaf, then use density to force its image into the closed subobject.
Close the diagonal of . Its j-closure is an equivalence relation, using preservation of finite meets and pullback-stability to verify transitivity. The effective quotient is the separated reflection: every map from into a separated object identifies that closed diagonal and factors uniquely. For separated , the closed-singleton map
is monic. Its j-closed image closure is a sheaf, and is dense. Unique extension across that mono, following the separated quotient factorization, proves
for every sheaf . This proves reflectivity. The closure construction is pullback-stable; equivalently, separated quotients and the subsequent dense embeddings commute with the finite limiting comparisons, giving the usual left-exact sheaf reflector.
Finite limits of sheaves are computed in , because unique extensions can be taken componentwise. If is a sheaf, is a sheaf for any , by the same product-with-dense-mono argument. Thus sheaf exponentials are the ambient exponentials. Monos between sheaves have j-closed images: their closure is a sheaf, and the dense inclusion into it splits by the extension property, hence is an isomorphism. Therefore classifies precisely their subobjects. These observations establish is a reflective topos.
Now let classify the given subterminal object. Its open local operator and closed local operator are
The Heyting algebra identities verify all local-operator axioms: implication by fixed preserves meets and is idempotent, while adjoining preserves meets by distributivity and is idempotent.
For a mono in with characteristic predicate , closedness for means , or . Density for means , again . Thus the c(U)-closed monos are exactly the o(U)-dense monos.
Both densities together force and , hence : the only jointly dense monos are isomorphisms. More explicitly, the meet of these operators is pointwise and
so .
For their join, every mono factors through the union with the pullback :
The first mono is c(U)-dense, because adjoining fills its codomain; the second is o(U)-dense, because its image contains . Any local operator above both must therefore make every mono dense, since its dense monos are closed under composition. It is the largest operator . Consequently
These are the complementary open and closed local operators in the ordered lattice of local operators, with order given by pointwise implication.
A real Lie group is a group equipped with a finite-dimensional real smooth manifold structure, conventionally Hausdorff and second countable, for which multiplication and inversion are smooth.
Its tangent space at the identity is defined by smooth curves through : two curves represent the same tangent vector when their derivatives in a local chart agree at zero. For , left translation determines the left-invariant vector field
The commutator of these derivations on smooth functions is another left-invariant vector field, so define the Lie bracket
This construction supplies the Lie algebra structure. In a Matrix Lie group, and differentiating the two fields gives .
For the special linear group, differentiate the determinant along a curve through . Expansion of the determinant, or its differential , gives
The determinant differential is surjective at , so the level set has tangent space equal to its differential's kernel. Equivalently, every tangent matrix has zero trace, and every zero-trace matrix supplies a curve of determinant . Hence
with the matrix commutator bracket. The same calculation over gives the complex special linear Lie algebra ; as a real group, the complex group has that space viewed as a real Lie algebra.
The matrix exponential is the everywhere-convergent series
whose inverse matrix is . The matrix logarithm is locally defined near by
These maps are inverse on suitable neighbourhoods of zero and , giving a logarithmic chart of a matrix Lie group. A logarithm is not a globally single-valued inverse of the exponential.
Every invertible complex matrix nevertheless has at least one matrix logarithm. Put it in Jordan normal form. For a block , and , choose any complex scalar logarithm of and set
The finite logarithm and exponential identities in the nilpotent variable give . Combine the blocks and conjugate back. Thus the exponential map is surjective on , by existence of a logarithm for every invertible complex matrix.
A connected counterexample is . It is connected: polar decomposition of an invertible real matrix writes each element as , with and positive definite symmetric of determinant one; is connected and is connected to through .
But belongs to this group and is not for any real . Such an would commute with . Since has two distinct real eigenvalues, direct commutation makes a real diagonal matrix. Its exponential has positive diagonal entries, a contradiction. Therefore
This is an exponential-surjectivity obstruction from distinct negative eigenvalues; connectedness does not eliminate the obstruction.
Let be a finite-dimensional Lie algebra representation. The form denoted is
It is the Trace form of a Lie algebra representation; the Killing form without a subscript is specifically the case , . The distinction matters: the form of the trivial representation cannot detect whether the algebra is semisimple.
Linearity of and trace proves bilinearity, and cyclicity of the trace gives symmetry. With , and , the representation identity gives
Thus it is an invariant bilinear form on a Lie algebra, and in particular the Adjoint representation preserves the Killing form.
The Cartan solvability criterion has two useful formulations. For a finite-dimensional complex Lie algebra ,
Its matrix version says that a Lie subalgebra is solvable precisely when for all and . We prove the matrix version first, with ordinary trace in .
If is solvable, the Lie theorem makes all its matrices upper triangular. Their commutators are strictly upper triangular, so multiplying such a matrix by an upper triangular one still has zero diagonal and hence zero trace. This proves the easy direction.
Conversely assume the trace-orthogonality condition and fix . We show that all eigenvalues of vanish. Use its Additive Jordan decomposition with . On the generalized eigenspace of , define an auxiliary endomorphism to be . This need not be in ; we only need control of its commutator with .
On , acts by and by . Choose a polynomial with and at the finitely many distinct differences. Polynomial interpolation supplies it because equal differences have equal conjugates. Therefore .
The adjoint compatibility of additive Jordan decomposition identifies as the semisimple part of . Elementary Jordan–Chevalley decomposition gives for a polynomial with . Hence is a polynomial in with zero constant term. Since maps into and preserves that Lie algebra ideal, we obtain
No assumption that , or belongs to was made.
Write with . Cyclicity and the assumed orthogonality now give
On the other hand the nilpotent parts have zero trace on each generalized eigenspace, so
Thus all are zero and is a nilpotent endomorphism. This is the Conjugate-spectrum proof of Cartan solvability.
The permitted Engel theorem, in the form needed here, states: a finite-dimensional Lie subalgebra of endomorphisms in which every element is nilpotent has a nonzero vector annihilated by all its elements, and iteration on quotients makes every element simultaneously strictly upper triangular. Apply it to . The strictly upper triangular algebra is nilpotent, so is a nilpotent Lie algebra and therefore solvable. Since is abelian, the derived series of a Lie algebra of terminates too. This proves the matrix criterion.
Apply it to . The condition on is exactly the matrix condition on . Thus is solvable. The kernel of is the center of a Lie algebra, which is abelian, so is solvable as well: once the derived series maps to zero it is central, and its next term vanishes. Conversely a solvable has solvable adjoint image, proving the abstract Cartan solvability criterion in both directions.
A finite-dimensional Lie algebra is a semisimple Lie algebra when it has no nonzero solvable Lie algebra ideal, equivalently its solvable radical is zero. Let . Invariance makes an ideal. For , induces zero on , and the block trace gives , where is the adjoint Killing form of itself. The Cartan solvability criterion therefore makes solvable. If is semisimple, .
Conversely suppose is a nondegenerate bilinear form. If a nonzero solvable ideal existed, its last nonzero derived term would be an abelian ideal of . For and , the operator has image in and is zero on , so its square and its trace are zero. Thus , contradicting nondegeneracy. This is Abelian ideals lie in the radical of the Killing form. We conclude the Cartan criterion for semisimplicity:
The appropriate abstract object is a finite reduced crystallographic root system in a real inner product space . Its axioms are: is finite, spans , and does not contain zero; for , ; each root reflection
permutes ; and every Cartan integer is an integer. The restriction to a reduced root system and crystallographic integrality distinguishes roots of complex semisimple Lie algebras from more general reflection configurations.
For any two roots of a root system, the Cauchy-Schwarz inequality gives
If the inner product is zero, both Cartan integers vanish. Otherwise their signs agree, and the absolute value of each is a positive integer. Dividing their product by an integer of absolute value at least one proves
For nonproportional roots the product is strictly less than four. In a reduced root system, proportional roots are just and have Cartan integers , so the printed bound is intentionally looser than the resulting bound of three.
A fundamental system of a root system is a basis of made of roots, such that each root is an integer combination of with either all coefficients nonnegative or all nonpositive. Its members are the simple roots. Suppose distinct had . Then
has a positive coefficient of and a negative coefficient of , contradicting the defining sign condition. Thus . Distinct simple roots are linearly independent, so their Cartan-integer product is strictly less than four. Combining integrality and the sign condition gives
Here nonpositive is the intended sense of the printed convention that includes zero among “negative” numbers; orthogonal simple roots really do give zero.
To form a Dynkin diagram, place a vertex at each simple root. Join two vertices by bonds, hence zero, one, two or three. A multiple bond has an arrow toward the short root. Indeed determines the squared length ratio, and the diagram with the Cartan matrix reconstructs the angles and relative lengths. A single bond joins equal-length roots.
The connected finite Dynkin diagrams are the following. The descriptions include bond multiplicities and arrow directions, so distinguish dual diagrams:
There are no other connected finite Dynkin diagrams. Low-rank conventions also identify and ; is disconnected, so introduces no further connected type. Affine diagrams are outside this finite classification.
Finally suppose the underlying graph contained a cycle on distinct simple roots . Put . Any bonded pair has
and all other distinct pairs have nonpositive inner products. The cycle contributes at least bonded pairs, so
But the simple roots, and hence these normalized vectors, are linearly independent, making the displayed sum nonzero. Positive definiteness gives a contradiction. Thus the underlying graph of a finite Dynkin diagram has no cycle. This acyclicity of a finite Dynkin diagram argument also excludes cycles with extra chords or multiple bonds; multiple bonds themselves are not treated as two-edge cycles.
Use Dynkin labels for the highest weight of the complex special linear Lie algebra . The A2 root system has and in these coordinates. In the drawings, and have equal lengths and angle ; a label at a point records its weight multiplicity, not a further copy at a different position.
The defining fundamental representation has the three weights
For , lower from its highest weight by the simple roots, retaining multiplicities. One convenient way to calculate them is the sl3 interlacing character formula: for shape the integer patterns satisfy , , , and contribute the weight
Enumerating these patterns gives the weight diagram
Its dimension is . The diagram below draws all twelve distinct positions, with the three inner multiplicities equal to two. The extra panel gives the symmetric square used in the calculation.
The six symmetric monomials in the defining basis give , with weights
each occurring once. Thus the tensor product has dimension
In a tensor product of Lie algebra representations, weights add and their multiplicities multiply. In terms of formal characters, . Consequently , summing over the six weights just listed. To show the indicated dominant multiplicities explicitly, the contributions in that order are
The tensor-product weight diagram below includes every position, and highlights these dominant weights. It also records the zero-weight multiplicity nine; that multiplicity is not a count of trivial summands.
Figure 2.
All weights of the ninety-dimensional sl3 tensor product Gamma(2,1) tensor Sym2 Gamma(1,0), with dominant weights highlighted and multiplicities labelled
. Details.
Apply the Weyl complete reducibility theorem and subtract irreducible formal characters in decreasing dominance order. The multiplicities at these five dominant positions in the potential summands are
These entries can be obtained by the same interlacing enumeration or by weight strings. Starting with , subtracting leaves ; subtracting leaves ; then the two ten-dimensional modules leave a single copy of the dominant weight . This is highest-weight character subtraction. Therefore
Every summand occurs once. The Weyl dimension formula gives , exhausting the dimension of and ruling out further irreducible summands. Computing the complete formal character also leaves no residual weight multiplicities.
We use the permitted Casimir operator properties in the following precise form. There is a central quadratic operator commuting with the action on every module; it is zero on the trivial Lie algebra representation, and on every nontrivial finite-dimensional Irreducible Lie algebra representation it is a nonzero scalar . This follows from the Schur lemma and the Casimir eigenvalue , using the Killing form normalization. We also use the permitted one-dimensional-representation fact: a complex semisimple Lie algebra has only trivial one-dimensional representations. Equivalently, it is a perfect Lie algebra, , so a character annihilating brackets must vanish. Neither fact assumes complete reducibility of the module being proved reducible.
First prove that every finite-dimensional short exact sequence
with trivial quotient splits. If is nontrivial irreducible, the Casimir operator has image in and restricts to there. Consequently is a one-dimensional invariant complement to . If is trivial irreducible, has a basis in which every action is . The Lie algebra representation identity makes , so the one-dimensional-representation fact gives and again the sequence splits.
For general , induct on . Choose an irreducible submodule . The induced sequence with kernel and middle term splits by induction. The inverse image of its invariant complement is a submodule fitting into . The irreducible-kernel case gives an invariant line in mapping isomorphically to the quotient. It is also an invariant complement to in . The case starts this induction. This proves splitting of a trivial quotient for a semisimple Lie algebra, including kernels that are not assumed completely reducible.
Now let be any invariant subspace. On the Hom representation the action is
Let consist of the maps whose restriction to is a scalar multiple of . This is a submodule, and restriction gives
The right-hand map is surjective because an ordinary linear projection exists; its quotient action is trivial because a commutator with is zero. The splitting just proved supplies an invariant with . Thus intertwines the actions, , and
The cases and are immediate. Choosing an irreducible submodule and repeating this complement construction proves the Weyl complete reducibility theorem. This last step is invariant complement from an equivariant projection.
Dropping finite dimensionality gives an example with the complex simple Lie algebra . Its Verma module of highest weight zero has a basis with
where . These actions obey , , . The span of is a proper submodule and the quotient is trivial. It has no invariant complement: such a complement would be a trivial line, while is injective on the entire module. Thus a simple Lie algebra can have an infinite-dimensional representation that is not completely reducible, even over .
For a Lie algebra , write for the linear span of brackets with one argument in each indicated subspace. The three definitions are
These are respectively an Abelian Lie algebra, a solvable Lie algebra and a nilpotent Lie algebra. The second and third sequences are the derived series of a Lie algebra and the lower central series of a Lie algebra.
An Abelian Lie algebra has , and a nilpotent Lie algebra is a solvable Lie algebra: induction gives . Thus all the implications are generated by
None of the reverse implications holds. The Heisenberg Lie algebra with basis and , all other basic brackets zero, is nonabelian but has , . The two-dimensional affine Lie algebra of the line with has and , but for every . It is solvable and neither nilpotent nor abelian. These two examples answer all six ordered-pair comparisons.
The Lie theorem says that a finite-dimensional Lie algebra representation of a finite-dimensional solvable Lie algebra over an algebraically closed field of characteristic zero has a common eigenvector whenever its representation space is nonzero. Equivalently it admits an invariant complete flag, or simultaneous upper triangularization. Here the field may be taken to be ; these hypotheses are essential.
To prove the common-eigenvector assertion, induct on . The zero algebra is immediate. Since is nonzero and solvable, its derived algebra is proper. Choose a codimension-one Lie algebra ideal containing it, and write . The Lie algebra is solvable, so induction supplies and a linear functional with .
Consider the finite-dimensional cyclic subspace . Until the first linear dependence, these powers form a basis. The identity
and show by induction, simultaneously for all , that is -invariant and that is upper triangular on it with every diagonal entry . It is also -invariant by construction. Hence
The trace of a commutator is zero, and characteristic zero gives .
The simultaneous eigenspace is nonzero and -invariant, since
Over an algebraically closed field, has an eigenvector, which is therefore a common eigenvector for all of . This finishes induction. Apply the same assertion to the quotient representation by its invariant line, and then to successive quotients. A basis adapted to the resulting complete flag gives the stated simultaneous triangularization of a Lie algebra representation, completing the proof of the Lie theorem.
A nilpotent Lie algebra is a solvable Lie algebra, so the inclusion satisfies the Lie theorem and is upper triangular in a suitable basis, for finite-dimensional complex .
This is insufficient to prove the Engel theorem. Its matrix version starts with a Lie subalgebra of nilpotent endomorphisms and concludes that they are simultaneously strictly upper triangular; its abstract version concludes nilpotence from nilpotence of every Adjoint representation endomorphism. Merely upper triangular matrices can have nonzero diagonal entries: the one-dimensional algebra is an Abelian Lie algebra and a nilpotent Lie algebra, but acts by a nonnilpotent identity matrix. This is nilpotent Lie algebras need not act nilpotently. Moreover, in the abstract Engel theorem nilpotence of the algebra is a conclusion, so assuming it first to invoke the Lie theorem would be circular. Abstract nilpotence and nilpotence of each representing matrix are different conditions.

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 5. . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact