Use the buyer's utility indifference price: is the cash payment satisfying
Assume the utilities are well-defined, the finite indifference price exists, and the suprema are attained as allowed. Write the common reference value as . For claims , choose optimizers at their indifference prices . Because is a vector space, is admissible. The concavity of gives
The optimized utility decreases with the payment; strict increase of and attainment make the comparison strict whenever a smaller payment is substituted into an attained optimizer. Hence the payment restoring utility is at least . Thus
The sign corresponds to buying the payoff. A seller's price uses a different convention.
For matrices and scalars , the definition of the trace gives
Hence the trace is a linear functional on the vector space of matrices.
Right multiplication by acts separately on the rows. After transposing each row its matrix is , so its determinant is . Composing this linear map with left multiplication and using part (a) gives
Here the determinant is taken on the -dimensional complex vector space of matrices.
A norm on a real or complex vector space is a function with exactly when , , and the triangle inequality . These are positivity, absolute homogeneity and the triangle inequality.
The Laurent polynomial ring is a localization of a ring:
The Hilbert basis theorem makes a Noetherian ring, and Localization of a Noetherian ring preserves this property. Thus .
For separating finite Laurent support by an integer weight, take a nonzero Laurent polynomial and let be its finite set of exponent pairs with nonzero coefficients. Choose an integer such that
where the maximum is zero if has only one member. Set . If , then
so and then . Consequently all powers of in are distinct. The linear independence of the Laurent monomials prevents cancellation, giving
The choice depends on the finite support of ; a single fixed substitution need not detect every nonzero element.
For Noetherianity of subalgebras of a one-variable Laurent polynomial ring, let be a unital -subalgebra of . If , it is already a Noetherian ring. Otherwise we find a nonconstant and an ambient ring containing such that is a finitely generated module over .
If , choose a nonconstant polynomial in , where . Then is an integral element over , since it satisfies the monic polynomial equation
Thus is a finitely generated module over , generated by . The case is identical after replacing by .
In the remaining case is contained in neither of these two polynomial rings. There is an element with a positive exponent and an element with a negative exponent. If either already has both, use it as . Otherwise their sum has both, since the positive powers of the first and the negative powers of the second cannot cancel. We obtain
Multiplying this identity by gives a polynomial equation for with leading coefficient :
Dividing by makes it monic. Similarly, multiplication by gives a monic equation for after division by . Both generators are therefore integral elements over , so is a finitely generated module over .
In all three cases is a Noetherian ring, as a quotient of a one-variable polynomial ring. The subalgebra is also a -submodule, so it is a Noetherian module. Every ideal of is a -submodule of and is therefore finitely generated over , hence over . This proves
For the final request, take the following subalgebra of the two-variable Laurent polynomial ring:
Let , an ideal of . We have
as -vector spaces. In particular, the classes of , for , are linearly independent. If had finitely many generators as an -module, their classes would span over , contradicting its infinite dimension. Hence is not finitely generated and is not a Noetherian ring. This illustrates why the preceding result is special to one Laurent variable.
The Weak Hilbert Nullstellensatz states that if is an algebraically closed field, every maximal ideal of is
Equivalently, every proper ideal has a common zero. We prove the more general field statement, the Zariski lemma: a field finitely generated as a -algebra is a finite field extension of .
Write such a field as . Choose a maximal set of algebraically independent elements among these generators and denote the remaining generators by . Each is an algebraic element over , so is a finite field extension. Clearing the denominators in their monic equations, choose a nonzero such that each is an integral element over
Because is a field and , we have . Thus is an integral extension of .
A subring over which a field is integral must itself be a field. Indeed, for , an integral equation for multiplied by expresses as an element of . But if , the ring is not a field: choose an irreducible polynomial which does not divide . There are infinitely many monic irreducible polynomials in , by the usual product-plus-one argument, whereas only finitely many can divide the nonzero . The prime ideal stays proper after inverting , so has no inverse in . Therefore , proving that is a finite field extension, and in particular an algebraic field extension.
Apply the Zariski lemma to the residue field of a maximal ideal. When is an algebraically closed field, this field is itself. The images of then give , proving the Weak Hilbert Nullstellensatz.
For the real Laurent polynomial ring, the same argument applies because it is the finitely generated algebra
Every residue field at a maximal ideal is consequently a finite field extension of , and so is or . Here we use the fundamental theorem of algebra, which makes the algebraic closure of of degree two. The images of must be nonzero since these elements are units. It follows that the answer is
with and defining the same maximal ideal. If both coordinates are real, evaluation has image ; otherwise its image is . Thus every displayed kernel is maximal, and the Zariski lemma shows that this list is exhaustive.
For explicit generating sets of an ideal, there are three cases. For real nonzero ,
If and with ,
If with and , then
The last two quotients are ; the nonzero coordinate condition ensures that the Laurent inverses exist in them. There are no further coincidences in the classification: equal kernels induce an -isomorphism between the evaluation image fields. The only -automorphisms of are the identity and complex conjugation, so the two pairs must agree or be conjugate.
To prove the intersection assertion, fix a prime ideal and an element . The integral domain has nonzero image . Its localization of a ring is nonzero and still a finitely generated algebra over , so it has a maximal ideal . By the Zariski lemma, the field is finite over .
The image of in is a subring containing and is a finite-dimensional -vector space. It is an integral domain, hence a field: multiplication by any nonzero element is an injective linear map of a finite-dimensional vector space and therefore surjective. The kernel of is thus a maximal ideal which avoids , since is invertible in . Its inverse image in is a maximal ideal containing but avoiding . As this works for every ,
This is the Jacobson ring property for this Laurent polynomial ring.
For a nonzero finitely generated module , its set of associated primes is
Here is the annihilator of the element. The Laurent polynomial ring is a Noetherian ring, so the nonempty collection of annihilators of nonzero elements of has a maximal member, say . It is proper because .
If and , then and
Maximality forces , hence . Thus is a prime ideal, proving . This argument in fact only needs that is Noetherian, not the finite generation of .
A proper ideal is -primary when its radical of an ideal is and
Equivalently, and imply ; equivalently, every zero divisor of is nilpotent. These formulations distinguish the actual primary ideal property from the weaker assertion that there is only one minimal prime ideal.
For the final example, set and . Then
Since is an integral domain, is a prime ideal. Moreover and , so . Consequently is the unique minimal prime ideal over .
Nevertheless , while and no power of belongs to . For the first assertion, reduce modulo : the image of is in , and is not a multiple of because is a nonunit in this integral domain. For the second, , so for every . Thus is not a -primary ideal: a unique minimal prime does not imply primary. In , the nonzero class of is killed by , a zero divisor which is not nilpotent.
For a finitely generated module over the graded ring , with each of degree one, its Poincare series of a graded module is
This is also its Hilbert series. One usually takes ; allowing an integer grading also permits finitely many negative degrees. Homogeneous generators of degrees give a surjection , where the graded shift is defined by . Consequently every is a finite-dimensional vector space and for all sufficiently negative .
The Hilbert-Serre theorem in the standard grading says
For a nonnegatively graded , the numerator is in . Equivalently, the only possible pole of this rational expression is at , with order at most .
We prove the Hilbert-Serre theorem by induction on the number of variables. For , and is a finite-dimensional graded module; thus is a Laurent polynomial. Suppose and put
The Hilbert basis theorem makes a Noetherian ring, so is a finitely generated module, as is . Both are graded modules killed by , hence finitely generated over .
The graded exact sequence
identifies the kernel and cokernel of multiplication by . Taking the alternating sum of the finite-dimensional degree components yields
so
By induction the right side has denominator , which proves the required denominator . Since has no negative powers when is nonnegatively graded, its Laurent polynomial numerator is an ordinary polynomial in that case.
For , this also implies the usual Hilbert polynomial consequence. Writing and using
gives, for all sufficiently large ,
a polynomial in of degree at most . For , the graded pieces are eventually zero.
For the final request, a free resolution of is an exact sequence
with each a free module. In the graded setting we take finite direct sums of shifts and maps preserving degree. The resolution has length at most if for every . The syzygy modules are the successive kernels which record the relations among generators, then relations among those relations, and so on.
Put , the homogeneous maximal ideal with . Choose a homogeneous -basis of and lift it to . These lifts generate by the graded Nakayama lemma: a bounded-below graded module satisfying must be zero, since a nonzero homogeneous element of least degree could not be a sum of variables times elements of lower degrees. Apply this to the quotient by the submodule generated by the chosen lifts. This gives a surjection inducing an isomorphism modulo .
Its kernel is finitely generated because is a Noetherian ring. Repeat the construction for that kernel, then for each subsequent kernel. We obtain a minimal graded free resolution, meaning
Indeed, at each stage the free cover induces an isomorphism modulo , so its kernel lies in times its source. The sequence is exact by construction, though it may at first appear infinite.
The Koszul complex on is
with basis vectors given degree one, and differential
The hat means omission of that factor. Every pair of terms in cancels with opposite signs, so this is a chain complex. The sequence is a regular sequence: after quotienting by the first variables, the next variable is a non-zero-divisor in the remaining polynomial ring.
The Koszul complex is consequently exact in positive degrees and has , so it is a Koszul resolution of of length . For completeness, one proves this by induction: for one variable it is . Appending constructs the mapping cone of multiplication by on the previous chain complex. Its homology is zero in positive degrees because acts injectively on ; its degree-zero homology is the further quotient. Here a mapping cone combines a chain complex with a shifted copy and adds the given multiplication map to the differential, thereby measuring its kernel and cokernel on homology.
The Tor functor is defined as the degree- homology of for a free resolution of . It can equally be computed as the homology of , using the Koszul resolution of . To see the equality, form the double complex . Taking homology first along leaves , since each is a free module; taking homology first along leaves , since each is free. The finite sums along each total degree identify both with the homology of the total complex. This also explains the symmetry used in computing the Tor functor.
Since for , we have for . On the other hand, all differentials of the minimal graded free resolution become zero after tensoring with , so
Thus for , and the graded Nakayama lemma implies for those . We have proved the required Hilbert syzygy theorem:
where some initial may be zero. The argument supplies finitely generated graded free modules, which is stronger than merely giving an ungraded free resolution.
Over the complex numbers, every finite-dimensional representation of a solvable Lie algebra has a basis in which every representing matrix is upper triangular. The Lie theorem is often stated first as the existence of a common eigenvector in every nonzero finite-dimensional Lie algebra representation of a solvable Lie algebra. Applying that assertion successively to quotient representations gives an invariant complete flag, and hence the upper triangular form. The same proof works over any algebraically closed field of characteristic zero.
We prove the common eigenvector assertion by induction on , writing the action as . The zero Lie algebra is immediate. If is solvable, its derived series of a Lie algebra shows that . Choose a codimension-one ideal of a Lie algebra containing , and choose . By induction there are and a linear functional such that for all .
Let be the span of . If , the first of these vectors form a basis, and is -invariant. We claim that for each ,
For this is the definition of . For the induction step, use and . Applying the induction hypothesis to both and proves the claim. Consequently is -invariant, and every acts on by an upper triangular matrix with all diagonal entries .
Since both and preserve , the matrix trace of their commutator on is zero. The claim applied to gives
Here characteristic zero is essential: in the field, so . Now the common weight space
is nonzero and -invariant. Indeed, for ,
An endomorphism of a nonzero finite-dimensional complex vector space has an eigenvector, so choose an eigenvector of in . It is a common eigenvector for . This proves the Lie theorem.
For the printed matrices in characteristic , , and there is no common eigenvector. Index the standard basis by . The cyclic entry in the PDF gives
The diagonal eigenvalues of are distinct in . Thus every eigenvector of is a scalar multiple of a single . Since , is never a scalar multiple of , proving the assertion even when is not an algebraically closed field.
For ,
At the cyclic boundary,
Hence . The two-dimensional Lie subalgebra has derived algebra , whose own derived algebra is zero, so it is solvable. It nevertheless has no common eigenvector, including after extending to its algebraic closure. This is a failure of Lie theorem in positive characteristic. In the proof above, the obstruction is precisely that can vanish as a scalar in .
The derived algebra of a complex solvable Lie algebra is nilpotent. First suppose . By the Lie theorem, put every element of in upper triangular form. The diagonal of a commutator of upper triangular matrices is zero, so consists of strictly upper triangular matrices. The Lie algebra of all such matrices is a nilpotent Lie algebra: if consists of matrices whose entries vanish whenever , then
Therefore the lower central series of a Lie algebra of reaches zero. Alternatively, every element of is a nilpotent linear map, and the Engel theorem states that a finite-dimensional Lie subalgebra consisting of nilpotent linear maps is a nilpotent Lie algebra.
For an abstract complex solvable Lie algebra , apply the preceding result to its Adjoint representation. The Lie algebra is nilpotent. Since is central in , some term of the lower central series of a Lie algebra of lies in that central ideal; the next term is zero. Thus itself is nilpotent.
Conversely, every nilpotent Lie algebra is solvable, since its derived series of a Lie algebra is contained term by term in its lower central series of a Lie algebra. If is nilpotent, it is therefore solvable, and is Abelian. More directly, the derived series of a Lie algebra of , after its first term, is the derived series of a Lie algebra of . Consequently the derived algebra nilpotence criterion is
We prove both the general modular intersection bound for a set family and its sharper uniform version, the Frankl-Wilson theorem. Let be prime, let have size , and let be a family of subsets of . Suppose each member's cardinality modulo is outside , whereas every intersection of two distinct members has cardinality modulo in . Then the general modular intersection bound is
with for . If every member has the same size and , the uniform Frankl-Wilson theorem sharpens this to
Here , so in particular . Primality matters because the argument takes place over the finite field .
For each , define the polynomial
At the indicator vector of another member , this polynomial is zero if and nonzero if . Replace every positive power of by in its expanded monomials, obtaining a multilinear polynomial of degree at most . This multilinear reduction on the Boolean cube preserves values at every zero-one vector.
The resulting polynomials are linearly independent. Indeed, if , evaluating at leaves ; the nonzero diagonal value forces for every . But multilinear polynomials of degree at most lie in the vector space with basis , whose dimension is . The bound on the dimension of a vector space gives the general modular intersection bound for a set family. This is the polynomial method in combinatorics: the intersection conditions produce an evaluation matrix with nonzero diagonal and zero off-diagonal entries.
To prove the sharper uniform bound, we first establish injectivity of inclusion between adjacent set layers. Over a field with field characteristic zero or greater than , suppose coefficients , indexed by -sets in , satisfy
Then all coefficients are zero. For this is immediate. For , fix distinct and subtract the equations for and , where is a -set avoiding . The result is
Apply mathematical induction with degree on the remaining coordinates; its size condition holds because . This forces for every such . Since all -sets are linked by one-element exchanges, all coefficients equal some . An original equation then gives , and the characteristic assumption gives .
For every with , now form the multilinear polynomial
This is the multilinear reduction of , so it vanishes at every indicator vector of a -set. These are linearly independent: in a nonzero linear relation choose the largest degree of a coefficient-bearing . The degree- terms have coefficients . The inclusion lemma makes these nonzero unless all degree- coefficients vanish, a contradiction. It applies because , , and .
The are also independent jointly with the . Evaluating a relation at the indicator vectors of the family first forces every coefficient of to vanish, since the vanish there; their own independence then kills the remaining coefficients. All these polynomials have degree at most , so
Subtracting the lower-degree contribution proves the sharp Frankl-Wilson theorem. For the general bound already gives , so no auxiliary polynomials are needed.
For the even cross-intersection assertion, work instead in the vector space over a finite field and let
The parity assumption is exactly in . By bilinearity, all vectors in are orthogonal to all vectors in , giving . The coordinate dot product is nondegenerate over , so . There is no requirement that be zero; only this dimension formula is used. Each distinct set has a distinct indicator vector, and a dimension- binary vector space has elements. Therefore the even cross-intersection bound is
This is the even cross-intersection bound, including empty families, for which the product is zero.
For odd intersections, append a final coordinate one to every indicator vector:
Their dot product is in . Applying the same orthogonal complement over the binary field argument to their spans, now in dimension , gives the required odd cross-intersection bound:
Appending the coordinate preserves distinctness of the vectors, so the span-cardinality estimates remain valid. This proves the odd cross-intersection bound directly by reducing the odd condition to an even one in a larger vector space.
A sufficient absolute constant is . The proof is a density increment argument for a cap set over the finite field .
First work in , write , and let be the indicator function of a cap set of subset density . All expectations below are uniform. In characteristic three, a solution of having two equal entries has all three equal. Consequently the normalized linear configuration count is
Set and use Fourier analysis on a finite abelian group with
The orthogonality of roots of unity and the Parseval identity on a finite group give
If , then for a cap set and
Thus some nonzero finite abelian Fourier coefficient has magnitude at least .
For this , let be the subset density of on the affine subspace , for . These three affine subspaces have equal cardinality, and
Among three directions separated by , one makes an angle at most with any given complex number. Hence . Restricting to that hyperplane gives the hyperplane density increment for cap sets
Translate the affine subspace to its underlying vector space. This preserves the cap set property: translating a triple by changes its sum by . The same argument can therefore be iterated.
For completeness, the density increment iteration gives an explicit uniform bound. If , the hypothesis is impossible. Suppose and a cap set has . For every integer , its remaining dimension is at least , and its current subset density is at least . Thus
The last inequality holds at and remains true as increases: the successive ratio of is for . At each step, as long as the subset density remains at most one,
After steps this would imply
a contradiction. The endpoint already contradicts the cap set property in positive dimension. This proves the claimed existence of three distinct points and the Meshulam bound for cap sets.
In a manifold chart, write a smooth differential form as , with increasing. Define its exterior derivative by
To check that this definition is global, change coordinates to . The chain rule expresses as . Differentiating it gives zero because the second partial derivatives of are symmetric and is antisymmetric. The coordinate definition satisfies the graded Leibniz rule, so differentiating the transformed expression for leaves exactly . This agrees with the original formula and proves independence of the manifold chart. The same cancellation of mixed derivatives gives .
The de Rham cohomology is therefore
the vector space of closed differential forms modulo exact differential forms.
Here is a Green-theorem proof of exactness on a disc. Identify the disc with a round disc centred at zero, and let be a closed differential form. Set . For and in the disc, Green theorem on the oriented triangle with vertices gives zero boundary integral, since . Hence
Taking and dividing by yields . The radial integral defining is smooth, so and
Degenerate triangles follow by continuity. The same proof works on any star-shaped plane domain, including the whole plane.
Integration requires an orientation: take to be an oriented compact -dimensional smooth manifold without boundary. The Generalized Stokes theorem says for every smooth -form . Every -form is closed by dimension, and changing it by an exact differential form leaves its integral unchanged. Thus
is a well-defined linear map . Compactness alone does not supply the orientation omitted from the printed integration statement.
For an -dimensional Lie group, choose a nonzero and define the invariant volume form on a Lie group by
Each is an isomorphism, so is nowhere zero and defines an orientation. The composition identity gives . Moreover, every left-invariant differential form of degree is determined by its value at , so the space of such forms is one-dimensional.
Under the supplied invariant-representative assumption, all top-degree de Rham cohomology classes are multiples of . For compact , orient it so is positive; then , whereas the Generalized Stokes theorem makes every exact top form have integral zero. Therefore and
under that assumption. For actual compact Lie groups, this argument applies when is connected. The supplied assumption fails for disconnected groups: on , the two components have independent degree-one classes, while globally left-invariant top forms form only a one-dimensional space. In general the top-degree de Rham cohomology of a compact Lie group is , where is its number of connected components.
For , use and . Stereographic projection identifies each with the plane. The disc argument gives and for any closed differential one-form . The overlap is connected, so makes the difference a constant. Adjust one potential by that constant; they glue to a global smooth function with . Thus
Finally, is a compact connected Lie group: the identification
identifies it smoothly with the special unitary group . Matrix multiplication and inversion supply its smooth group operations. The preceding invariant-volume argument therefore gives
A useful comodule natural transformation formula determines from a single linear functional. Define
using the regular right comodule . For any vector space , the cofree right comodule has coaction . Naturality with respect to all maps gives
The coaction is itself a morphism of right comodules. Its naturality equation, followed by , therefore gives
This derivation works for all comodules, not merely finite-dimensional ones.
The monoidal equation , evaluated on the two regular comodules and followed by their counits, implies
The unit equation gives . Thus is a unital algebra homomorphism over a field . In addition, the -colinearity of gives the useful intertwining relation
This fixes the orientation of relative to .
For the convolution product for coalgebra maps, define . Multiplicativity of and the two antipode identities show
Consequently
Coassociativity and the two convolution identities verify both composites directly. Since was a -comodule morphism, its linear inverse is also a -comodule morphism. Inverting the naturality and monoidal equations shows that the inverses form a monoidal natural transformation . Every such monoidal transformation is therefore invertible, without requiring a bijective antipode.
The induced internal hom for modules over a Hopf algebra on is
where both occurrences of have their left regular action. If is a morphism of left -modules, then
So every such morphism is an invariant vector of a module over a Hopf algebra.
For the converse, a calculation valid for every -linear is
If is invariant, its left-hand side is instead . Hence for all , which is precisely the R-module homomorphism condition.
In fact an endomorphism of the left regular module is determined by and has . Conversely each right multiplication map is left -linear. Thus the invariant space has the explicit description
As a vector space it is isomorphic to , and under composition its algebra is the opposite algebra . No dimension or semisimplicity hypothesis is needed.
Use the normalization
This is ridge regression; the penalty is the squared Euclidean norm. The centering removes the need for an intercept. Differentiating gives the normal equation
For every nonzero , . The coefficient matrix is therefore a positive-definite matrix, even if the design matrix has deficient matrix rank. The objective is a strictly convex function, so the unique minimizer is the closed-form ridge regression estimator, with fitted values
For the primal-dual identity for ridge regression, put and observe
Both parenthesized matrices are positive-definite matrices. Multiplying by their inverses gives
Thus the same fitted vector has the dual expression
No inverse of or alone was needed. This is also the kernel-ridge hat matrix for the linear kernel.
Here a positive-definite kernel means a symmetric real-valued function whose every finite kernel matrix is positive semidefinite: for all , and ,
This is the usual positive-semidefinite kernel convention; strict positivity for distinct points is not required. In particular . Write , and . Positivity of the two-point kernel matrix implies
If , substitute to obtain . If , the affine expression can be nonnegative for every only if . Both cases give the Cauchy-Schwarz inequality for positive-semidefinite kernels:
The zero-diagonal case is essential when the positive-definite kernel is not strictly positive.
To construct a feature map, let be the real vector space of finite formal linear combinations of symbols , one for each . Define a symmetric bilinear form by
The positive-definite kernel property makes this a positive semidefinite bilinear form. It need not yet be an inner product: distinct formal vectors can have zero squared length. The same quadratic-polynomial argument, now applied to , proves
Therefore implies for every . The set
is the radical of a bilinear form, hence a linear subspace. Set
The quotient vector space has a well-defined inner product: changing representatives by elements of changes no pairing, and a zero-length class is exactly the zero class. It is therefore an inner product space.
Define . By construction,
Every positive-definite kernel thus has a feature representation, including degenerate kernels and the zero kernel. This is its canonical feature space of a positive-semidefinite kernel. The construction already gives the requested inner product space.
Over or , a Lie algebra is a vector space with a bilinear map which is alternating and obeys the Jacobi identity:
Bilinearity and alternation imply .
For a Matrix Lie group, identify the tangent space with derivatives of smooth curves through . Product curves show that the sum of two such derivatives is again tangent, and reparametrization supplies scalar multiples. In particular this is a real vector space, even when the matrices have complex entries. For , choose a curve with . Conjugating a curve with derivative shows that
Differentiate this curve in the finite-dimensional vector space . The result is
The matrix commutator is bilinear and alternating, and expanding the six terms proves its Jacobi identity. Thus this construction gives the Lie algebra of a matrix Lie group, with the appropriate bracket, using actual group curves rather than an assumed commutator closure.
For the unitary group, differentiating gives . Conversely, if , then is unitary and is a curve with derivative . Consequently
This is the unitary Lie algebra. The diagonal entries are purely imaginary, contributing real parameters, and each upper off-diagonal entry contributes two real parameters. A matrix-unit basis of the unitary Lie algebra is
These anti-Hermitian matrix units and their combinations are linearly independent over and span every allowed entry.
The symplectic stabilizer is a subgroup: the identity preserves , and if and , then
Multiplying on the left by and on the right by gives . Products and inverses remain unitary. This is the compact symplectic group, often denoted or .
Differentiating the stabilizer equation gives . For , this says
Together with , these are equivalently
These conditions are also sufficient: is unitary, and
Hence it stays in the subgroup. They characterize its compact symplectic Lie algebra without adding any trace condition. In fact the trace automatically vanishes. The free anti-Hermitian block has real parameters, and the complex symmetric matrix has real parameters. Thus
Here is a complete matrix-unit basis of the compact symplectic Lie algebra. The generators supplying are
The two families supplying the real and imaginary parts of are, for ,
The denominator merely avoids double-counting diagonal entries. Each displayed generator obeys both defining tangent conditions. The generators form a real basis of the allowed blocks, and the generators form a real basis of the complex symmetric blocks. Thus they are independent and their total number is . They give all generators required by the real compact algebra, including the case .