Assume with integers, as required for the quantum binomial expression. Let be the -dimensional irreducible sl2 Lie algebra representation, with one-dimensional weight spaces of weights , . The exterior-power Lie algebra representation on has character
This is already a Laurent polynomial with nonnegative integer coefficients.
To identify it with the requested quotient, introduce and the Gaussian binomial coefficient
Splitting the subsets according to whether is included proves
The product satisfies the same recurrence: after factoring common numerator and denominator terms, the needed identity is . Induction on therefore proves the product identity, including its polynomiality.
Since the quantum integer is , taking the quotient of the products gives
Thus this is the symmetric quantum binomial coefficient. All its weights have parity , because the exponent in the exterior-power sum differs from by an even integer. Applying part i to this finite-dimensional representation proves symmetric unimodality in steps of two. Equivalently, the ordinary polynomial has a unimodal coefficient sequence at consecutive powers of .
Again, the full integer-exponent coefficient sequence in , including the absent parity, need not be unimodal: for the answer is . This counterexample makes precise the convention under which the claimed quantum unimodality holds. The cases or give the constant one.
Let be the standard Cartan element of the sl2 Lie algebra, with and . For a finite-dimensional representation, its formal character records its weight multiplicities:
The classification of finite-dimensional sl2 representations and the Weyl complete reducibility theorem give , with finitely many nonzero . Each has weights , each of multiplicity one. Therefore
In particular , and for one has . This proves parity unimodality of an sl2 character: within each parity, the coefficients increase towards zero and decrease away from zero. For a representation whose weights have a single parity, deleting the intervening zero coefficients gives a symmetric unimodal sequence.
The parity convention is necessary for the printed assertion. If unimodality means the full coefficient sequence at every consecutive integer exponent, it is false: the standard two-dimensional representation has character , whose coefficients at exponents are . The statement established above is unimodality on cosets of the root lattice for , and is the version needed in part ii. Infinite-dimensional representations need not even have Laurent-polynomial characters.
Number the simple roots of the G2 root system so that is short and is long. In the Euclidean plane choose
Their squared lengths are one and three, and their angle is degrees. The six positive roots are
Together with their negatives these form the twelve-root diagram: two regular hexagons of radii one and , rotated by degrees relative to one another. Solving the fundamental weight equations gives
In particular is the highest short root and the highest long root. The root diagram below marks both weights.
To evaluate the Weyl dimension formula, put , and . The Weyl vector is . In the order of positive roots listed above, their coroots have simple-coroot coefficient pairs
For example the short root has coroot , while the long root has coroot . Pairing with and dividing by the same factors at gives the G2 dimension polynomial
The denominator is . As checks, the fundamental representations have dimensions seven and fourteen, and gives the trivial representation of dimension one.
Figure 1.
The twelve G2 roots and the short-first fundamental weights omega one and omega two
. Details.
Let be a complex semisimple Lie algebra, choose a Cartan subalgebra and a positive root system , and let be a dominant integral highest weight. Write for the corresponding finite-dimensional irreducible representation, for a coroot, and for the Weyl vector. The Weyl dimension formula is
The bracket denotes the natural pairing of weights with coroots. The normalization of an invariant inner product cancels from each ratio, so the formula can equivalently use roots instead of coroots in both numerator and denominator.
Label the weight vertices by , with weights . The crystal of the defining odd-orthogonal representation is the chain
Each arrow of color subtracts the simple root . The two arrows through zero form the length-two short-root string.
Here is a complete grid description of the tensor product of crystals, valid for arbitrary . Place the vertex in row , column , in the above chain order; there are vertices. Let and count incoming and outgoing steps along the color- string. For , the two strings are and , each of length one. For , the string is , with pairs equal to . Other vertices have both counts zero.
Using the crystal tensor-product rule, draw every color- edge by
The first case is a downward arrow to the next row and the second a rightward arrow to the next column; omit an arrow when its indicated factor has no outgoing edge. Thus the rule specifies every vertex and every arrow of the general tensor-square diagram, including the boundary nodes. The figure displays the resulting entire grid for , alongside the vector crystal; the generator can draw any positive rank.
The raising rule chooses the first factor when and the second otherwise. For , its only highest vertices are
Indeed a highest tensor must have highest first factor, hence . For colors , the second factor cannot have an incoming edge. For color one, its incoming count must be at most . Inspecting the strings leaves precisely .
These three connected components encode the Irreducible Lie algebra representations
Here is the traceless symmetric square, is the Adjoint representation, and the invariant symmetric form supplies the trivial summand. Their dimensions are , , and one, summing to . In fundamental-weight notation the highest weights are for , but for .
For the vector crystal is . The same tensor rule gives highest vertices , of weights , or , respectively. Its summand dimensions are .
Identify the Cartan subalgebra with its coordinate vector using the invariant inner product. A root reflection is
For every root of the Bn root system, the explicit formulas are
All unlisted coordinates stay fixed, and opposite roots define the same reflection. These reflections give all coordinate permutations and independent sign changes. Therefore the Weyl group is
Its action on is the group of signed permutation matrices.
We construct the exceptional isomorphism between sp4 and so5. Let have a nondegenerate alternating form and symplectic basis . Define the symplectic contraction of an exterior square
It is equivariant for the symplectic Lie algebra, and . Identify with using . Wedge product then gives a symmetric bilinear form on . It is nondegenerate, as the wedge-basis vectors pair with their complementary pairs.
The bivector is invariant under , satisfies , and has . Consequently and is nondegenerate. The exterior-power Lie algebra representation preserves wedge product and the volume form, so restriction gives a homomorphism
We check injectivity directly. If acts trivially on , it also annihilates the invariant line , hence acts trivially on all of . In any basis , the equation forces every off-diagonal coefficient to vanish: choose distinct from and inspect the coefficient of . Thus is diagonal. Its diagonal entries satisfy for every pair, which forces them all to be zero. Therefore is injective.
A symplectic matrix has infinitesimal block form with symmetric, so . Also . Injectivity and equal dimensions make an isomorphism. Every nondegenerate complex symmetric form in dimension five is equivalent by a change of basis to the given antidiagonal form, so
Put and . A Cartan subalgebra is
The defining matrix condition says . Using the matrix units, the nonzero root spaces have the following generators:
Commuting each generator with gives its stated weight. Together with , these matrices span the Special orthogonal Lie algebra; there are independent generators. Thus its decomposition as a Cartan subalgebra module is
This is the Bn root system. The upper-triangular generators select the positive roots
Its simple roots and highest root, for , are
To see the simplicity assertion, , while and . The coefficient pattern for dominates those of every positive root.
Normalize the inner product so the are orthonormal. The simple coroots are for and . Solving gives the fundamental weights
In the half-sum of positive roots, the coordinate occurs with total coefficient . Hence the Weyl vector is
The Dynkin diagram is a chain , with single bonds up to and a double last bond pointing towards the short root . In the Extended Dynkin diagram, add . For , and its inner product with every other simple root is zero, so it attaches to by a single bond. For , both long nodes attach by double bonds to short node . These rules give the Bn Dynkin diagram and affine extension drawn below.
For rank one, , , , and . The finite diagram is one node; its affine extension has two equal-length nodes joined by a double bond, without a short-root arrow.
Figure 1.
Finite and extended B-type Dynkin diagrams with short-root arrows and low-rank exceptions
. Details.
On take the matrix units
Their products give , while commutes with each of the other two. Thus this is a Lie algebra representation. The three images are linearly independent, so its kernel is zero: it is faithful and finite-dimensional. It is reducible, as expected from the classification in part ii; for example, the first coordinate line is invariant.
Use the Polynomial representation of the Heisenberg Lie algebra on :
The product rule gives , verifying the required bracket, and the identity commutes with both operators.
For irreducibility, let be a nonzero invariant subspace and choose a nonzero polynomial of degree in it. Its th derivative is a nonzero constant, so . Repeated multiplication by then puts every monomial in , giving .
For faithfulness, suppose . Applying this operator to gives , so . Applying what remains to gives . The representation is therefore faithful and irreducible. It is necessarily infinite-dimensional, by the finite-dimensional classification just proved.
Let be a nonzero finite-dimensional Irreducible Lie algebra representation. Since is central, its action is a scalar by the Schur lemma. Taking the trace of gives , so .
The actions of now commute. Choose an eigenvalue of . Its nonzero eigenspace is preserved by , which has an eigenvector there, with some eigenvalue . The span of this common eigenvector is invariant under all of . Irreducibility forces it to be the whole representation. Consequently
Conversely each such assignment is a one-dimensional Lie algebra representation and hence irreducible. Distinct pairs give nonisomorphic representations. This classifies all finite-dimensional irreducible representations; none is faithful because all annihilate .
All brackets belong to the line , and shows this line is exactly the first derived algebra. Since is central, the derived series of a Lie algebra is
The lower central series of a Lie algebra is likewise
For completeness, the center of a Lie algebra is : an element commutes with only if , and with only if . The upper central series of a Lie algebra is therefore , because the quotient by is abelian. Thus the Heisenberg Lie algebra is nilpotent of class two and solvable of derived length two. These properties are not mutually exclusive.
Expand , where the sum is over ordered pairs of -sets. If , the two cliques together require different edges: precisely the edges within the overlap are counted twice. Therefore
There are choices of , then ways to choose the overlap and ways to choose the remaining vertices of . It follows that
A binomial coefficient is zero when its lower argument is outside its possible range. The term includes and equals , as it should.
Now take the usual fixed- interpretation of the appearance assertion. For , deterministically. For fixed , the assumption gives
since . Eventually . Subtracting in the second-moment formula, and using the identity that the overlap counts sum to the total number of ordered pairs, gives the overlap formula for the variance of a clique count:
Overlaps of zero or one vertex have no shared edge and hence independent indicators, so their contributions vanish. For fixed , the combinatorial coefficient in the -th summand is . Moreover, because and ,
There are only finitely many terms. Thus . The Chebyshev inequality then gives
proving the fixed-size clique appearance threshold:
The fixed-size condition cannot simply be dropped. For and ,
However the complement graph has a binomial number of missing edges with mean asymptotic to and variance at most that mean. By the Chebyshev inequality, . Conditional on , choose two distinct missing edges uniformly; their endpoints are disjoint except with probability
Thus with probability tending to one the complement has two disjoint edges. Deleting one vertex cannot remove both, so no -clique exists. In this example , despite . This is growing clique size can invalidate a first-moment appearance criterion; the exact second-moment identity remains valid for growing , but the stated conclusion needs the conventional fixed- quantifier.
Count each unordered -vertex set once. For each such set , let be its clique indicator in the binomial random graph. All required edges are independent, so
The Markov inequality, or first moment method, gives
Consequently
This argument works even if varies. The binomial coefficient shows that cliques are counted as vertex sets, not as their different ordered listings.
Scale the SIRS Markov chain by population size: . Suppose in probability, where is a deterministic point in the probability standard simplex. The required fluid limit of the SIRS Markov chain is
We prove uniform convergence in probability on every fixed interval , rather than merely replace random products by products of their expectations.
Introduce the jump vectors and scaled rate functions
At state , an event of type has rate and jump . Let be independent unit-rate Poisson processes. The Poisson time-change representation of a Markov chain gives
This representation follows by giving each event type an independent exponential clock in its accumulated hazard. Conditional on the current state its firing rate is , hence it has exactly the transition rates from part (a). The finite state space and bounded rates rule out explosion. Values at the jump times do not affect the time integrals.
With , this becomes
where
The displayed is precisely the boxed drift. On the simplex, with , , . Thus every Poisson clock used before is at most . For any fixed , the permitted Poisson maximal bound, applied with time horizon and relative tolerance , gives
A channel with contributes nothing and is simply omitted. Since for , these probabilities even decrease exponentially in . Each has norm two. The union bound consequently gives in probability. Notice that the clock is random, but its deterministic upper bound makes the Poisson maximal estimate directly applicable.
The drift is Lipschitz on the simplex. Indeed there, and one may take for its Lipschitz constant. The Picard-Lindelöf theorem gives a unique local solution, which remains in the simplex: the sum of the derivatives is zero, while on the faces , , and the corresponding derivatives are respectively , , and , all nonnegative. More explicitly, is nonnegative, and the linear equations for and have nonnegative forcing terms; their integrating-factor formulas keep both nonnegative. Conservation then bounds every coordinate by one, so the local solution extends globally.
Subtract its integral equation from that of . The Gronwall inequality yields
This proves the Poisson concentration proof of a density-dependent fluid limit for this model, including the initial-condition requirement and uniform finite-time approximation. In terms of population counts, the associated deterministic approximation is , , . The limit concerns macroscopic initial proportions and fixed times; a single initial infective has limiting fraction zero, so early stochastic invasion on a growing time scale is not described by this finite-time limit alone.
Use the compartment counts as the state of the SIRS Markov chain. Its state space is . The transition rates are
Each susceptible has infection hazard , so summing over the susceptibles gives the first rate. The memorylessness of the exponential distribution makes each of the current infectives have recovery hazard , irrespective of its infection time. Each removed individual has immunity-loss hazard . These are all the possible off-diagonal transitions. The diagonal entry of the transition intensity matrix is minus their sum, and a transition with no eligible individual has rate zero. Thus the three total event rates are , and , and every event conserves population size.
For any initial point, rotate its vector through the Brownian angle:
This is a nonanticipating function of the prescribed Brownian path and has the required initial value. Equivalently, . The Itô formula gives , whose real and imaginary parts are exactly the equations in part c. Therefore the displayed formula is the strong solution of a stochastic differential equation, and uniqueness from part d makes it the only one.
The Brownian rotation in the plane preserves radius: . Nonzero starting points move around their initial circle, and the origin remains fixed.
Both coefficient functions are linear, hence globally Lipschitz. Their norms are bounded by a constant times , so they satisfy the linear growth condition for an SDE. The existence and pathwise uniqueness theorem for a stochastic differential equation gives a unique global strong solution of a stochastic differential equation for every deterministic starting point . Linear growth prevents finite-time explosion.
The theorem gives pathwise uniqueness, and strong existence with pathwise uniqueness gives uniqueness in law. Thus every initial value is permitted, and both forms of uniqueness hold. The coefficients need not be bounded for this theorem; their global Lipschitz and linear-growth properties are sufficient.
Apply the Itô formula separately to cosine and sine, using :
In vector standard form , with one-dimensional driving noise and two-dimensional state, the coefficient functions are
The original trigonometric process starts at , but these coefficient functions define a stochastic differential equation on all of .
Put , , and write , where and . The Itô isometry and boundedness give
Continuity and boundedness of then imply . Since has mean zero,
For the variance, . The remaining terms satisfy
Continuity of and the initial convergence give . Expanding the variance and dividing by proves the initial mean and variance derivatives of an Itô diffusion:
The derivatives at the initial time are right derivatives because the process is indexed by .

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