The Clebsch-Gordan decomposition for SU2 is
where increases by one and every summand occurs once. The tensor product of Lie algebra representations is antihermitian for the product inner product, so an invariant subspace has an invariant orthogonal complement; this gives complete reducibility. To see the particular summands, suppose . The product weight diagram has one state of weight , two of weight , and increasing multiplicities down to the plateau determined by . Subtracting the weight string of leaves a single highest state of weight . Repeating highest-weight character subtraction yields exactly the displayed sequence, down to . Its dimensions exhaust the tensor product because
The case is identical with the factors exchanged.
Let be the Clebsch-Gordan coefficients. Since the total is , orthogonality of its eigenspaces gives the selection rule unless . Normalize the coupled states by lowering from a unit highest-weight vector, as in part (i); a common phase for an entire summand is immaterial. Then
Take the inner product with . On the other hand, the total ladder operator is , and . Its action on the product bra is therefore
Equating the two evaluations and multiplying by proves both signs of the ladder recurrence for Clebsch-Gordan coefficients:
Terms with an index outside its allowed weight range are zero. Merely specifying eigenvectors of would allow unrelated phases for different ; the coherent positive-ladder convention above is what makes these recurrences hold with the displayed positive square roots.
A highest-weight vector is a nonzero vector satisfying and ; its eigenvalue is the highest weight. Existence does not require the Lie algebra representation to be antihermitian. Since is a nonzero finite-dimensional complex vector space, has an eigenvector with some eigenvalue . The commutator with shows that each nonzero has eigenvalue . Infinitely many such vectors would have distinct eigenvalues and be linearly independent, which is impossible. The last nonzero vector in this raising chain is therefore a highest-weight vector .
Put . The ladder operator relations give . The raising coefficient follows by expanding the commutator of with a power of :
The factor is essential: these ladder operators have , rather than the convention with . The same finite-dimensionality argument gives a last nonzero lowered vector , with . Applying to yields
so . All are nonzero and have distinct eigenvalues. Their span is invariant under and therefore under the original three generators. Irreducibility of the Lie algebra representation makes this span equal to . Hence
In particular, the initial construction produces the largest eigenvalue of , since its full spectrum is now . This establishes the highest weight without assuming beforehand that all eigenvalues are real or that is diagonalizable.
For the additional antihermitian Lie algebra representation, the given definitions imply and . Thus distinct eigenvalues give orthogonal weight vectors. With , write . The adjoint relation and the raising coefficient give
Multiplying this recursion proves the normalized highest-weight lowering formula in the present normalization:
Every factorial argument is an integer, even for half-integral . The displayed states have unit norm, mutually distinct eigenvalues, and span , so they form an orthonormal basis. Their phase convention also fixes the positive ladder amplitudes
with the endpoint actions interpreted as zero. These amplitudes will determine the Clebsch-Gordan coefficients.
Use the Feynman vertex for the scalar Yukawa coupling, the internal scalar propagator , incoming factors and outgoing Dirac adjoints . Define as the coefficient in the connected S-matrix element after removing its overall momentum-conserving Dirac delta function. A direct pairing contributes
The crossed pairing interchanges the identical outgoing fermions and therefore has a relative fermionic sign of minus. With and , the result is
It changes sign under exchange of the two outgoing momenta and spin labels, as required for identical fermions. No fermion spin sum or identical-particle phase-space factor belongs in this amplitude; those enter a relativistic scattering cross-section calculation.
The Yukawa interaction has one real-scalar leg and an oriented fermion line at each vertex. At lowest connected order, two vertices exchange one scalar, so the diagrams are of order .
For two incoming fermions, there are two pairings of the outgoing fermions: the channel joins to and to , with scalar momentum ; the channel joins to and to , with scalar momentum . Fermion number conservation excludes an annihilation channel for two particles carrying the same charge.
For an incoming fermion and antiparticle, there is a -channel scalar exchange with momentum and an -channel annihilation and recreation diagram with momentum . Arrows on antiparticle lines run opposite to the direction of physical propagation. These are the four tree scattering in Yukawa theory diagrams shown below; all external momenta are labelled.
Figure 1.
Tree-level scalar-exchange diagrams for fermion–fermion and fermion–antifermion scattering; incoming states on the left
. Details.
The crossing in the -channel drawing is not a vertex. Dashed internal lines are the real scalar field; solid arrows show fermion-number flow.
Write and . By time ordering for a bosonic field,
Reverse in the second integral. At fixed spatial momentum consider
The Feynman i-epsilon prescription places the poles at and . For , close in the lower half-plane, clockwise. The positive-energy residue and the orientation give . For , close counterclockwise in the upper half-plane; the negative pole has derivative denominator , and its residue gives . Thus , reproducing the time-ordered mode expression. We obtain
This is a distributional boundary value, not an absolutely convergent Fourier integral. As an independent normalization check, , so ; the numerator is with the question's definition of the propagator.
The normalized Fock vacuum obeys for every momentum and . Taking adjoints gives . Of the four products in the mode expansion of , only has a nonzero vacuum expectation value. The commutator implies
Consequently
This unordered Wightman function differs from the time-ordered Feynman propagator when the temporal ordering is reversed.
For positive frequency take , with . Lowering the index in is important: put
These are commuting Hermitian matrices with . Their eigenvalues are , so they are positive definite for and positive semidefinite matrices for . Simultaneous diagonalization defines their positive square roots of a matrix and gives .
The plane-wave ansatz reduces the Dirac equation to , where
For and , commutativity gives and . Therefore
This is the Hermitian square-root construction of Dirac plane waves.
For negative frequency retain the future-directed momentum label and use . The equation is now . Its general solution is
with arbitrary two-spinor . The minus between its two blocks gives and . For these parametrizations span the two-dimensional positive- and negative-frequency solution spaces. At nonzero null momentum the square roots have complementary rank-one supports and still give the full two-dimensional kernels. If , both spinors have norm squared ; the positive one also has .
Apply to the Dirac equation. Since partial derivatives commute, only the symmetric part of the gamma matrix product contributes:
Here in the signature fixed above. The remaining operator is scalar in spinor indices, giving
This is the Klein-Gordon equation for each component, although the first-order Dirac equation additionally couples them.
The Pauli matrix multiplication law is , so . Block multiplication of the chiral gamma-matrix representation gives
and
Thus the mixed anticommutators vanish and the spatial ones are . With the Minkowski metric convention ,
These matrices therefore represent the required Clifford algebra.
We next bound the closed derived series. For odd , the depth calculation yields
For the inclusion from left to right, two series of depth at least commute modulo : at depth the only possible leading pair has equal depths and its coefficient vanishes. For the reverse inclusion, every depth can be written with and . Start with ; if their difference vanishes modulo , replace them by , which is allowed except at , where the original difference is already nonzero. The difference changes by , nonzero for odd . Commutators thus supply every high leading coefficient, and closed successive coefficient correction fills the tail.
With , induction on gives
For use the standard characteristic-two derived-series collection bound, explicitly stated as an additional result:
for a fixed constant . One can take a fixed enlarged constant from the tail estimate . The more involved two-coefficient collection is necessary in characteristic two; the exact odd-prime tail formula is not asserted there.
In either case there are constants and such that . If an analytic structure existed, its dimension would be positive, since a zero-dimensional analytic pro-p group is discrete and compact, hence finite. The second alternative of the supplied theorem would require
for all sufficiently large , for some fixed . Combining the bounds gives , impossible as .
The root solution proved hereditary just infiniteness, so the supplied theorem applies. Part (i) excluded its linear alternative, and this calculation excludes its growth alternative. Hence the Nottingham group is not analytic over any pro- ring.
The first alternative in the supplied analytic-group theorem would give a faithful representation of in some or . The embedding proved above supplies cyclic subgroups of order for arbitrarily large . Such orders are impossible in either fixed matrix dimension.
In characteristic zero, a matrix of order is diagonalizable over an algebraic closure, because its minimal polynomial divides the separable polynomial . At least one eigenvalue must be a primitive th root of unity; otherwise . The cyclotomic polynomial is irreducible over , since satisfies the Eisenstein criterion at . Consequently that eigenvalue has degree over , which must be at most the matrix dimension . This bounds .
In characteristic , pass from the power-series ring to its fraction field. A matrix of -power order satisfies , so it is unipotent. Writing , nilpotence gives . For ,
Thus its order is at most , again a fixed bound. Therefore the linear alternative is impossible in both coefficient rings.
Conversely, if all equal , the same Frattini-quotient identity gives for every . This is exactly the index definition of a uniform pro-p group. Thus (ii)(i), completing the equivalence of the first two conditions.
For a powerful pro-p group, . The Burnside basis theorem therefore gives
If is uniform, all these indices equal . Hence for every , proving (i)(ii).
Suppose and are inverse limits of the same system, in the universal-property sense. The compatible family induces a unique continuous homomorphism with ; similarly there is a unique with . Then and both induce the projections , so uniqueness gives . Likewise . Thus the limits are uniquely isomorphic by an isomorphism preserving every projection. In particular the inverse maps are continuous, so this is an isomorphism of topological groups, not just abstract groups.
The left cosets of an open subgroup form an open cover of the compact group. A finite subfamily therefore covers the group. Distinct cosets are disjoint, so every coset must occur in this finite subfamily. Hence .

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