A Non-Abelian gauge theory promotes an internal group representation symmetry to a spacetime-dependent transformation and introduces a gauge field so that differentiation transforms covariantly. The symmetry is a gauge redundancy: physically meaningful quantities must be invariant under local changes of field representative. We work in four-dimensional Minkowski spacetime with signature , and use skew-Hermitian matrix generators throughout.
For the compact Simple Lie group , its real Lie algebra has a negative-definite Killing form. Hence is a positive invariant bilinear form on a Lie algebra. Choose a -orthonormal basis , , with . Invariance makes fully antisymmetric. This construction uses the Adjoint representation and works independently of any chosen scalar representation.
Let be a Lie-algebra-valued gauge potential, with the coupling absorbed into this connection. If is the given finite-dimensional irreducible representation of , its Lie algebra representation defines
For a finite local transformation , require and . Differentiating the first equation forces the gauge-field transformation law
Thus the gauge potential transforms inhomogeneously; an ordinary derivative alone would leave an uncancelled derivative of .
The commutator of gauge covariant derivatives determines the gauge field strength:
The Lie algebra representation preserves the bracket, so this formula holds for any , including a trivial scalar representation. The gauge field strength itself is defined in the gauge algebra. The transformation of the connection implies
It is therefore covariant, rather than invariant as a Lie-algebra-valued quantity.
For infinitesimal , the same equations give the infinitesimal gauge transformation with an anti-Hermitian connection:
Substitution into cancels the terms containing and gives , the gauge covariance of a scalar covariant derivative.
The Yang-Mills theory has Lagrangian density
This is the Killing-form Yang-Mills Lagrangian. Its sign uses a positive internal form and the stated spacetime signature. In a -orthonormal basis it is . Gauge invariance follows because is invariant under the adjoint group action. Infinitesimally, the variation is proportional to
After rescaling , the gauge coupling appears in and in the non-Abelian part of the canonically normalized field strength. Squaring that field strength gives cubic and quartic gauge-field self-interactions. An ordinary local quadratic mass term in the gauge potential is not invariant because its transformation contains .
For the scalar field kinetic term, compactness supplies a positive invariant Hermitian form on its representation space. One can obtain it by averaging any positive form with normalized Haar measure, the unitarization of a compact-group representation. Then is unitary for , and is anti-Hermitian. The Yang-Mills theory coupled to an arbitrary scalar representation has
Here is any real gauge-invariant scalar potential, so . For example,
is available for every unitary representation, with giving a bounded quartic contribution. Other invariant interactions may exist for particular representations; the potential is not required to depend only on .
The scalar kinetic term is gauge-invariant because both covariant derivatives transform by the same unitary . Infinitesimally its variation vanishes by
The potential is invariant by its defining condition. For a real irreducible representation, use the averaged positive symmetric form instead and write the kinetic term as ; all transformation and invariance arguments remain valid. Expansion of the covariant kinetic term produces both the linear gauge-scalar interaction and the quadratic term needed by local gauge invariance.
The invariant inner products, gauge covariant derivatives and gauge field strength together construct the full theory for every compact Simple Lie group and every supplied finite-dimensional irreducible representation of the scalar fields. Both finite and infinitesimal transformation laws have been included, and every sign follows the same anti-Hermitian convention.
Let be the coroots. With a chosen set of simple roots, the root lattice and weight lattice are
The fundamental weights are defined by , and form an integral basis of . We use the Cartan matrix convention .
For the A2 root system, inversion of its Cartan matrix yields the A2 fundamental weights and weight lattice:
Equivalently and . The root lattice has index three in the weight lattice, since the change-of-basis matrix has determinant three. For a planar realization take
The weight lattice is triangular. In fundamental weight coordinates , a point is in the root lattice exactly when is divisible by three. The following sketch marks both bases and the sublattice:
The integers called Dynkin indices here are the Dynkin labels of the highest weight:
For finite-dimensional Irreducible Lie algebra representations, they are nonnegative integers. All weight coordinates below are these Dynkin label coordinates, not simple-root coordinates.
A weight-string enumeration algorithm gives the set of weights without their weight multiplicities. Begin with and process known weights by increasing height below . For each simple root and known weight , find the largest with a weight; all such higher weights have already been processed. The weight string theorem says that the string has endpoints , , with
and includes every intermediate step. Append and repeat until no new weights appear. This terminates in finite dimension and supplies all weights; every nonhighest weight can be reached by simple-root lowering. A string can contain contributions from several sl2 summands, so the resulting set does not by itself determine weight multiplicities.
For the explicit calculation we use the following general facts: finite-dimensional representations of a complex semisimple Lie algebra are completely reducible by the Weyl complete reducibility theorem; the symmetric powers of the defining sln representation are irreducible of highest weight ; and weights in a tensor product of Lie algebra representations add with multiplicities multiplied. We also use the highest-weight representation classification: each finite-dimensional irreducible has a unique dominant integral highest weight, and a nonzero vector killed by all simple-root raising operators supplies an irreducible summand with that highest weight in a completely reducible module. For , the Weyl dimension formula specializes to
For , the defining fundamental representation has weights . Thus the A2 representation of highest weight (2,0) is , with the six distinct weights
Each has multiplicity one: these are the weights of the six quadratic monomials.
For the tensor square of the A2 representation of highest weight (2,0), add every ordered pair of elements of . To list the complete answer compactly, define four disjoint weight sets:
The tensor product has multiplicity one at each point of , two at each point of , three at each point of , and four at each point of . These fifteen distinct weights account for states.
We next identify the irreducible summands rather than just their dimensions. Split the tensor square of the six-dimensional space into its symmetric power and exterior power, of dimensions and . The square of a highest-weight vector in the symmetric part has highest weight , giving of dimension .
Let be vectors of weights and . In the exterior part has weight and is killed by both simple-root raising operators: raising along gives a multiple of , whose wedge with itself is zero, and the other raising actions vanish. Thus it is a highest-weight vector. The Weyl dimension formula gives , so the entire exterior part is this irreducible summand.
The remaining symmetric part has dimension six. To identify it, the fifteen weights of are exactly
each once. Subtract them from the unordered-pair weights of . The residual weights are , each once, with highest weight . They are the negatives of , so this six-dimensional summand is . Consequently
The corresponding dimensions are ; complete reducibility and the exhibited highest weights ensure that no summands are missing.
The full weight multiplicities in the A2 tensor square of highest weight (2,0) are summarized below. An entry is the multiplicity of each individual weight in that row's set:
Thus has all fifteen weights once, has the six weights once, and has its nine boundary weights once and its three interior weights twice. Only the three interior weights of are degenerate among the irreducible components.
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 .
Return to the mostly-minus Minkowski metric of Question 3, and write . The field is assumed real and nonzero wherever its inverse occurs. Under the usual Abelian gauge transformation , with inert, the electromagnetic field tensor is invariant but . The change in the added density is
This is not generally a total derivative. The action is not invariant under arbitrary gauge transformations. It retains residual Lorenz gauge symmetry for transformations satisfying , with the same boundary conditions imposed before and after the transformation. The action itself is undefined at ; that value can only be considered as a limiting gauge.
To vary the electromagnetic four-potential, use and . The integration by parts of both terms gives
with surface terms removed by the variational boundary conditions. Hence
For variable , the derivative must act on as well as on :
Since enters algebraically, its Euler-Lagrange equation is
For a real field this gives . Thus a dynamical gauge-fixing parameter imposes a constraint equation in field theory; it is not an ordinary propagating scalar. On configurations satisfying both equations, , , and therefore . There is no independent kinetic equation that determines .
For the momentum-space equation at a prescribed constant , use . Then , and the linear equation is
Equivalently, . If the separately varied equation is also imposed on a real classical solution, then and its nonzero modes lie on the massless mass shell. For constructing a full-field Green function, however, invert the fixed-background quadratic operator before imposing that on-shell constraint. Holding fixed and integrating over is a Gaussian functional integral; integrating over the original variable as well is a different constrained problem.
For , the Lorentzian versions of the transverse projector of a vector field and longitudinal projector of a vector field are
They satisfy , , and . The mixed-index operator is
Its inverse follows by inverting these two scalar eigenvalues. Define by . The positive-sign covariant gauge-fixing inverse is
This is the algebraic inverse of the kinetic operator. A vacuum photon propagator instead has the factor and a Feynman i-epsilon prescription for its simple and double poles. If the name is used for the vacuum two-point function, include that factor consistently in its defining source equation. A retarded Green function would use different boundary conditions at the same poles. The original plus sign corresponds to the usual covariant gauge parameter ; in particular, gives Feynman gauge and .
Contracting gives the longitudinal gauge propagator contraction
Thus the contraction is not identically zero as a function of four-momentum for any , and it is a nonzero vector at every nonzero non-null four-momentum. A particular component may vanish when . At , the displayed inverse has poles and must be interpreted using the chosen Green function prescription, rather than as a pointwise finite matrix. In the limiting covariant Landau gauge, , the longitudinal part vanishes. A covariant photon Green function may have a longitudinal component even though physical photon polarizations are transverse.
Use and . The free real scalar field has action
The canonical momentum is , and the Hamiltonian operator is obtained by the Legendre transform of the density:
Canonical quantization promotes and to Hermitian operator-valued fields and imposes the equal-time canonical commutation relations
Their Heisenberg equation of motion gives , , hence the Klein-Gordon equation .
Let and . The Hermitian field mode expansion is
The scalar field oscillator inversion extracts
and its adjoint obtained by Hermitian conjugation extracts . Substitute these expressions into the equal-time canonical commutation relation. The two mixed field-momentum terms give
For , the corresponding coefficient is a difference of those square roots and multiplies ; it vanishes because . Taking the adjoint gives . Thus these are bosonic annihilation operators and creation operators. The vacuum satisfies , and normal ordering gives , after removing the constant zero-point energy. A one-particle excitation has energy and spin zero.
The Feynman propagator is the vacuum expectation value of the time-ordered product of two field insertions. For , the field at creates a one-particle excitation from the vacuum and the field at annihilates it; the opposite time ordering reverses the roles. It is a propagation amplitude and correlation function of vacuum fluctuations, rather than a transition probability. From the oscillator expansion, only the - contraction survives, so with and ,
Here is the Heaviside step function, and changing to in the second term gives the last line.
For the Fourier transform convention , insert a positive damping factor and integrate the positive and negative half-lines separately:
The last equality is a distribution identity; the infinitesimals in the partial fractions need not have the same finite magnitude as the infinitesimal in the combined denominator. The Feynman i-epsilon prescription means that the positive-frequency pole is just below the real energy axis and the negative-frequency pole is just above it. Closing the contour integral below for , and above for , reproduces the oscillator result by the residue theorem. This prescription fixes which homogeneous solutions are added to the Green function. As an independent normalization check, has derivative jump at , so
It is the expectation-value convention for , including the numerator , that determines this source normalization.
The vacuum is a centered free Gaussian state. The Wick theorem expresses the four-field time-ordered product as the sum of all pair Wick contractions plus terms containing a normal-ordered product. The latter terms have zero vacuum expectation value. There are exactly three complete pairings, with no fermionic signs for this bosonic field. Thus the free scalar four-point function is
These formulas describe canonical quantization of a real scalar field; in particular, a real scalar field uses a single oscillator family rather than independent charged-particle and antiparticle families.
For this question use the mostly-plus Dirac convention: the Minkowski metric is and
This convention matches the printed plane-wave phase and final identity. It is related to the usual mostly-minus Dirac equation by reversing the metric and taking the negatives of the usual gamma matrices. In particular, the resulting Dirac action and its Dirac adjoint describe the same physical massive field. The Dirac gamma matrices are four complex matrices representing the spacetime Clifford algebra with quadratic form . The irreducible complex representation has dimension four. A convenient explicit choice is the negative of the standard Dirac representation of the gamma matrices:
where are the Pauli matrices. Their multiplication law verifies the displayed anticommutator.
In this representation the gamma matrix adjoint and transpose identities are
and
The invariant way to express the latter pattern uses the charge-conjugation matrix:
Individual transpose signs depend on the basis. More generally, a similarity transformation changes the Hermitizing matrix to and the charge-conjugation matrix to . Then and . Thus the simple formula with itself presumes a compatible Hermitian basis, rather than an arbitrary nonunitary similarity transformation.
Applying to the Dirac equation gives . Its mass shell is , so the frequencies are . The Dirac spinor transforms in the four-component Spinor representation of the Lorentz group. Under spatial rotations, the two upper and the two lower components each transform as a two-component spin- representation: the spin angular momentum matrices are . At rest the positive-energy equation selects the upper two components, giving two independent spin polarizations, and the negative-frequency equation selects the lower two.
In the quantum theory a mode expansion is
With the mostly-plus Dirac convention, is positive frequency. The negative-frequency coefficient obeys . The fermionic annihilation operators and satisfy the canonical anticommutation relations, with their respective fermionic creation operators. The excitations are particles; the excitations are antiparticles with the same positive energy, mass and spin- but opposite charge. After normal ordering, the Hamiltonian operator contains positive multiples of . Reinterpreting the negative-frequency part as antiparticle creation supplies a spectrum bounded below rather than a physical tower of negative-energy particles.
For the printed wave, . Substitution gives
The spin label indexes the two states of a spin- particle, rather than varying the particle's total spin. For real on-shell , Hermitian conjugation and give
These are right and left null-vector equations for the same on-shell matrix.
To obtain the Gordon identity, take both external Dirac spinors to have the same real mass . Their two equations imply
Define . The Clifford algebra relation yields
Therefore
Multiplying the previous null-vector equation by proves the required formula exactly:
For it can be solved for the vector-current matrix element, separating a momentum term from the antisymmetric Dirac spinor term. The identity before division also holds at . The signs depend jointly on the metric, Clifford relation, Dirac mass term and plane-wave phase. In the mostly-minus convention of Questions 1 and 3, the printed phase instead gives ; the corresponding identity uses in the antisymmetric term. Mixing that convention with the formula proved here would produce an apparent sign error.
Use units , the Minkowski metric , and the Fourier transform convention . Here gamma matrices satisfy , and is the Dirac adjoint. A single Dirac field describes both electrons and Positrons; these are the particle and antiparticle sectors of that field.
The free Maxwell Lagrangian and Dirac action, with a linear covariant gauge condition for the photon, give
Before gauge fixing, the Maxwell Lagrangian has zero modes in field theory along , so its quadratic operator cannot be inverted on all potentials. In the linear Lorenz gauge, the Faddeev-Popov determinant is . It is independent of and may be absorbed into the normalization; the corresponding Faddeev-Popov ghost fields have no interacting vertices in this Abelian linear gauge. A residual gauge symmetry is removed by the specified boundary conditions.
The free generating functional is
The Dirac field variables and their sources are independent Grassmann fields in this path integral. They anticommute; replacing them by ordinary commuting fields would give the wrong statistics and the wrong functional determinant. The bosonic Gaussian functional integral contributes an inverse square root of a determinant, and the Grassmann Gaussian integral contributes a determinant. If is the photon quadratic operator and , completing the square gives
In the last expression and are the photon propagator and Dirac propagator, with Feynman i-epsilon prescription. The products include the appropriate spacetime integrals and index contractions. Functional derivatives with respect to , and consistently ordered left or right Grassmann derivatives with respect to the fermionic sources, generate the time ordering of the corresponding fields. In Feynman gauge, , the momentum-space two-point functions are
The Feynman i-epsilon prescription specifies vacuum boundary conditions rather than an arbitrary inverse of the differential operator.
The covariant photon propagator uses four potential components. Its operator formalism counterpart is Gupta-Bleuler quantization: impose and take the Gupta-Bleuler null-state quotient. This leaves a positive physical state space with two transverse photon polarization vectors. The temporal and longitudinal oscillator components occur in intermediate covariant expressions; the Ward identity removes their dependence from physical amplitudes. The free Dirac field uses the canonical anticommutation relations, producing the same fermionic signs as its Grassmann fields in the path integral.
The operator-path-integral equivalence can be seen directly with a regulator. Divide time into small intervals and insert complete sets of field-coordinate states for bosons, and resolutions in fermionic coherent states for fermions. The bosonic matrix elements produce the phase-space factor ; integrating out the quadratic canonical momentum produces the bosonic action. The fermionic coherent state overlaps produce the first-order term and the Berezin integral measure. Multiplying the short-time kernels recovers the path integral. Projecting the remote endpoints onto the Fock vacuum with an infinitesimal damping selects the same Feynman propagators as the operator formalism. Field insertions become time-ordered products under this construction. Conversely, their quadratic generating functional obeys the canonical free-field equations and has precisely the oscillator two-point functions, so its higher free correlators agree by the Wick theorem. This establishes the equivalence for the regulated free theory and order by order in the perturbation series.
To couple the matter field electromagnetically, promote its global phase symmetry to the local transformation
The gauge covariant derivative obeys . Replacing by in the Dirac action therefore gives the invariant matter density
The electromagnetic field tensor is unchanged by the local transformation. Thus the unfixed quantum electrodynamics action is gauge-invariant. The Dirac current is conserved by the matter equations, and the electron and Positron excitations carry opposite charges. The added gauge fixing density selects a representative and is not itself invariant under arbitrary local transformations; it does not change gauge-invariant observables. At a free fermion vertex,
For external on-shell Dirac spinors the corresponding current contraction vanishes. The quantum extension is the Ward identity, which makes physical amplitudes insensitive to adding a multiple of the photon momentum to its polarization vector. A gauge-compatible regularization preserves this vector-current identity.
With , expand in powers of . A term of order contains spacetime integrations and . Applying the Wick theorem pairs the free fields: an - Wick contraction supplies a photon propagator, and a - Wick contraction supplies an oriented Dirac propagator. Each insertion supplies an interaction vertex. The permutations of contractions cancel the expansion factorials except for the Feynman-diagram symmetry factor. Interchanging Grassmann fields produces the fermionic sign, including a minus sign for every closed fermion loop. This is how Feynman diagrams arise from expectation values, rather than an extra dynamical assumption.
The normalized vacuum generating functional removes components with no external insertions. In the operator formalism, for an interacting-vacuum expectation value of an inserted product , the same cancellation appears as
Vacuum projection and the Feynman i-epsilon prescription are implicit. The linked-cluster theorem exponentiates all connected vacuum bubbles into the same factor in numerator and denominator, so it cancels. Normalize by to remove every vacuum component. This cancellation of vacuum bubbles still leaves products of disconnected diagrams that each contain external insertions. If only connected correlators are wanted, differentiate the connected generating functional .
The resulting momentum-space QED Feynman rules for the bare theory can be stated in Feynman gauge as follows:
Figure 1.
An oriented electron line meets a photon at the QED interaction vertex
. Details.
The illustrated interaction vertex has incoming fermion momentum , incoming photon momentum , and outgoing fermion momentum . Its solid-line arrows indicate fermion flow. The photon wavy line has no fermion-flow arrow. The propagators, the vertex , momentum conservation, and the fermionic signs determine the perturbative amplitudes.
Only routes with contribute to proportional fairness or to the weighted logarithmic utility; omit inactive routes from expressions with a rate in the denominator. Active routes have positive rates whenever a positive feasible allocation exists. For a feasible competitor , the elementary logarithm inequality gives
A zero competitor rate on an active route has utility and also cannot improve the objective. Therefore a proportionally fair allocation maximizes the logarithmic objective. Conversely, the feasible set is a convex set, and differentiating the objective along at shows that an optimizer satisfies the proportional fairness inequality. Strict concavity gives uniqueness on active coordinates; rates assigned to nonexistent flows are immaterial.
In the linear flow network, put and for active routes. A local route uses only resource . If and , increasing increases the objective without violating any other constraint. Thus each active local route saturates its resource:
Write and . For and , substitute into the objective. Apart from constants its dependence on is
Its derivative vanishes when , and its second derivative is negative. Hence the per-flow through-route rate is
If , the optimal through-route aggregate rate is one, so still holds. If , each active local route has , also given by the displayed local formula. When there are no flows and no departures. Inactive coordinates need not be assigned these undefined per-flow formulas.
Independent arrivals and exponential document sizes make this a flow-level network model. A document of type has residual-size hazard per unit of data transmitted; when its transmission speed is , its completion hazard per unit time is . Thus the continuous-time Markov chain of flow counts has transition intensities
For these departure intensities are for the through route and for an active local route. Total arrival intensity is constant and total departure intensity is bounded by , ensuring a nonexplosive Markov chain.
Set , the offered traffic, and define the balance function of a flow-level network
The binomial coefficients satisfy
These identities also cover states with only one kind of active route. They show that the weight satisfies
Thus detailed balance for a continuous-time Markov chain proves that this is a reversible Markov chain and reduces the stationary distribution calculation to normalization.
Sum over first. The negative binomial series gives, for fixed local counts and ,
All summands are nonnegative, so the Tonelli theorem permits exchanging the sums. The partition sum is therefore
It is finite exactly when for every , for . These are the resource-load conditions: resource receives the through-route offered traffic plus its local offered traffic. The normalized stationary distribution is
With positive arrival rates this is the unique stationary distribution of the irreducible feasible flow-count chain. Zero arrival rates restrict its closed class to the corresponding zero coordinates.
Summing out also shows that the local counts are independent, with geometric distributions on :
Hence their mean flow counts are
The binomial balance factor is essential: independent geometric counts for all routes would not give these departure rates or the correct resource-load normalization.
In congestion control, resource observes only its own aggregate load and generates the nonnegative feedback price . User receives the sum of prices along its route. Its desired increase competes with the congestion charge , while sets the adjustment speed. This is local information: a resource needs the rates passing through it, and a user needs the feedback along its own route, rather than the complete network state.
There is a hypothesis to make explicit before claiming global convergence. If “increasing” means nondecreasing, the printed assumptions allow , in which case and there is no equilibrium point. The intended theorem holds when every route contains at least one resource whose price is not identically zero, with nonempty routes and nonnegative, continuous, nondecreasing prices. Strictly increasing prices satisfy this condition automatically. We prove the theorem under this necessary qualification; without it the zero-price example disproves the literal claim.
Let . Each is a nonnegative convex function. For positive rates define the primal congestion potential
The weighted logarithmic utility is a strictly concave function, and subtracting the resource costs preserves strict concavity. Thus has at most one maximizer and at most one critical point on the positive orthant.
It also attains its maximum there. A nonzero nondecreasing price is bounded below by some positive constant at all sufficiently large loads; hence its primitive satisfies with . Choose at zero-price resources. The route coverage assumption gives , so
This bounds all superlevel sets of . Within a bounded set, approaching makes . Consequently every nonempty superlevel set is a compact set contained in the positive orthant. A maximizing sequence stays in one such set, giving a unique interior maximizer . Its critical-point equations are
The rate dynamics are the gradient flow with diagonal mobility . Along any positive trajectory,
with equality only at . Thus is a strict Lyapunov function. The initial superlevel set traps the trajectory away from both infinity and the boundary, ensuring global continuation. Positive initial rates remain positive: variation of constants in makes this explicit. Starting with finite nonnegative rates also gives positive rates at every later positive time.
For completeness, mere continuity of suffices for convergence; one need not silently assume differentiable prices. On the trapping compact set, both the vector field and are continuous and bounded. The trajectory satisfies a uniform Lipschitz condition in time, so is uniformly continuous. Also , since increases to a finite limit. The decay of a nonnegative uniformly continuous integrable function applies: otherwise disjoint intervals of a fixed positive width would each contribute a fixed positive amount. Every accumulation point therefore has and is . Compactness then proves the global convergence
This is the dissipation argument behind the LaSalle invariance principle. If uniqueness of trajectories is desired under continuous prices, put . The transformed equation is . The transformed potential is concave: it is a sum of positive multiples of , minus convex nondecreasing composed with nonnegative quadratic sums. Its gradient is monotone decreasing, so the squared distance between two solutions cannot increase. This proves uniqueness for positive initial data without a locally Lipschitz function hypothesis on .
For the alternative price dynamics, restrict first to positive prices on resources used by at least one route, and discard unused resources. Define the dual congestion potential
Its domain has and for every route. Strictly increasing make each strictly convex, and is convex. Thus is a strictly convex function. Each is eventually bounded below by a positive constant, so its integral grows at least linearly, dominating the negative logarithms as . If a route price tends to zero in a bounded set, . Therefore attains a unique minimum on its domain including the admissible boundary faces.
That minimum has every used-resource price positive. At a face , all route prices are still positive and the inward derivative is
Hence the minimum cannot lie on that face. At the unique interior minimum,
Since the price dynamics are , their positive equilibrium points are exactly these critical points. There is one equilibrium in the positive price domain. An unused resource instead has its only nonnegative equilibrium at zero.
The positive-domain qualification matters here even with strictly increasing . If zero prices are admitted, the multiplicative factor permits boundary equilibria of multiplicative price dynamics. Take one route using two resources, , and . Both and are equilibria, with , as is the positive equilibrium , with . Thus the literal assertion of uniqueness on the whole nonnegative orthant is false. A boundary equilibrium need not satisfy load equals supplied capacity at its zero-price resources.
The relationship between the two intended equilibria is inverse resource response. The first system has ; the positive equilibrium of the second has . If on the relevant ranges, these are the same resource equations, and both systems also impose . They therefore have the same rates and prices. For strictly increasing continuous with and unbounded range, the ordinary inverses satisfy all the stated conditions on . With arbitrary independently chosen and , the equilibria need not agree. Under inverse response, and are convex conjugates on the nonnegative half-line, and supplies the Lagrangian dual problem for maximizing the weighted logarithmic utility minus resource costs, up to constants independent of .
Use an ideal carrier-sense multiple access scheme on the interference graph. An active station finishes its transmission after an independent unit-rate exponential distribution waiting time. An inactive station has an independent attempt clock with an exponential distribution of rate ; an attempt succeeds only when all its neighbors are inactive. Attempts that are blocked do not change the state. Thus, on the independent sets represented by , the continuous-time Markov chain has transition rates
The empty independent set can be reached by successive deactivations, and any other independent set can be reached from it by successive activations. Hence this finite chain is an irreducible Markov chain. The weight satisfies
By detailed balance for a continuous-time Markov chain, its unique stationary law is
This is a finite exponential family. Its natural parameter of an exponential family is and its mean parameter of an exponential family is the vector of active fractions.
The throughput region of an interference graph is exactly . To see the possibly less immediate inclusion, suppose a random feasible schedule has mean . Retain each of its active vertices independently with probability , interpreting zero coordinates as always deleted. A subset of an independent set remains an independent set; the thinned schedule has mean exactly . Thus lies in the convex hull of . The opposite inclusion follows from the definition using equality. Moreover , so this convex hull has full dimension.
Now choose such that remains in the interior of . Use interior moment matching in a finite exponential family. Consider the convex function
There is a ball of radius around contained in . Maximizing a linear functional over the convex hull is the same as maximizing over its generating set, so, for every ,
The last inequality uses the point when . Hence is a coercive function and has a finite minimizer . Differentiating the finite normalizing sum gives
This covariance matrix is a positive-definite matrix: a linear functional constant on all states of positive weight must be constant on , so its coefficients vanish. Thus is a strictly convex function; its minimizer is unique. At that minimizer the desired strict service margins are
For a backlogged station that transmits at unit speed whenever active, the long-run throughput is , by the ergodic theorem for a finite continuous-time Markov chain. Therefore the ideal carrier-sense multiple access scheme can supply a strict service margin for every arrival vector in the interior of the throughput region of an interference graph. The local attempt rates can realize the whole interior capacity region in this sense. Boundary points may require parameters tending to infinity, and the argument gives no uniform delay or mixing-time bound near the boundary.
In a loss network with fixed routing, calls of type arrive as independent Poisson processes with rates . Every accepted call occupies units of resource throughout its holding time. The link-route incidence matrix has nonnegative integer entries, is the resource-capacity vector, counts calls currently present, and is the th coordinate unit vector. The feasible occupancy space is
The inequalities are coordinatewise. A call that would leave this space is rejected immediately, without queuing or changing . With independent unit-rate exponential distributions for holding times, the memoryless property makes a continuous-time Markov chain, whose nonzero off-diagonal transition rates are
There are independent clocks of rate one for the second transition. Rejected arrivals are not jumps and do not appear in the off-diagonal transition rates.
Let . For every feasible adjacent pair,
Thus detailed balance for a continuous-time Markov chain gives the product-form stationary distribution of a loss network:
In this convention is the reciprocal normalizing sum. If every route consumes some resource, finite capacities make finite. Even zero-resource routes cause no normalization difficulty: the sum is at most . With positive arrival rates the reachable feasible class is an irreducible Markov chain, since calls can depart to the empty state and any feasible occupancy can be built from it. The stationary distribution is therefore unique on that class.
The vector records the free units of each resource. Its probability distribution sums over all occupancies with the same free resources. The map from to generally loses information: different call mixtures may consume exactly the same resources.
For , the conditional expectation can be computed by removing one call. The factorial identity gives
Indeed, is a bijection from the occupancies in this sum with to occupancies using units. Conversely, adding one call to any such occupancy is feasible because its final resource use is . Consequently
and the conditional expectation is zero otherwise. Conditioning the identity and multiplying by now yields
Alternatively, multiply the preceding unnormalized factorial identity by and sum over directly; this proves the same formula even when , without dividing by a zero probability. This gives both the conditional expectation argument and the direct summation argument.
Use the standard risk-neutral quasilinear utility model: utility is value received minus payment. A bidder may abstain for utility zero, payments to the seller are nonnegative, and the zero-value type has utility zero. The last normalization is necessary for the requested revenue formula; if arbitrary subsidies were allowed, an additive payment constant would remain undetermined. The independent private values model is symmetric, and each bidder has a unit-demand valuation in the two-item part. Participation satisfies individual rationality.
Let be the interim probability of receiving an item and the interim expected payment of a type . Write . By mimicking the Bayesian Nash equilibrium bid of a type , a type could obtain utility . Equilibrium therefore gives, for ,
The lower inequality uses type 's incentive constraint, and the upper uses type 's. Since is continuous in these auctions, the inequalities give . With ,
This is the interim payment identity underlying revenue equivalence.
For one item, independence and the uniform distribution give : all other values must be below . Hence the expected payment from a bidder conditional on its value is
This is an unconditional-in-winning interim payment, not the amount paid conditional on winning. In the first-price sealed-bid auction, , so the Bayesian Nash equilibrium bid is
with . For , the seller's revenue is zero and a zero bid suffices under the stipulated allocation rule.
For two items and three unit-demand bidders, a type wins if at most one of the other two values exceeds it. Therefore
The interim payment identity gives . Dividing by the winning probability gives the symmetric Bayesian Nash equilibrium bid
To check that this is an Bayesian Nash equilibrium rather than just a necessary formula, its derivative is , positive for . A type mimicking a type receives utility , whose derivative in is . It is positive before and negative after it, so the truthful type-matching bid is globally optimal. Bids above the highest Bayesian Nash equilibrium bid can only increase payment without increasing the winning probability; the usual nonnegative bid range covers the lower boundary.
By symmetry and the law of total expectation, the seller's expected two-item revenue is
For one item and the same three bidders,
More generally the single-item revenue with bidders is . Allocating a second item lowers competition enough that it adds no expected revenue in this particular three-bidder uniform model.
The final mechanism is a direct revelation mechanism because the message submitted by bidder is its valuation report, in the same type space , and allocation and payment are explicit functions of those reports. It is the Clarke pivot mechanism for selecting two unit-demand winners. Truthful reporting is a dominant strategy: bidder 's utility equals its true allocation value plus the other bidders' reported allocation values, minus a term depending only on the others' reports. Reporting its true value makes the efficient allocation maximize the first two terms, while the last is unaffected by its report.
Let the ordered values be . For a winner , the maximum welfare achievable by the other two bidders is their combined value; in the actual allocation only the other winner receives an item. Thus the difference defining its payment is the excluded bidder's value . For the loser, both other bidders receive items already, so its payment is zero. Consequently both winners pay the lowest valuation, and
This equals the first-price sealed-bid auction revenue above. A conditional check gives the same interim payment identity: the minimum of the other two values has density , and bidder wins exactly when that minimum is below . Its conditional expected pivot payment is . The mechanisms have equal expected revenue, even though their realized payments need not coincide.
Let be a finite set of alternatives with , and let each agent report a strict total order on . A profile is the tuple of these orders. The domain is unrestricted: every tuple of orders is allowed. A deterministic social choice function selects one alternative from each profile. It is onto if every alternative is selected at some profile. It is strategyproof if no agent, holding all other reports fixed, can obtain an outcome strictly preferred according to its true order by reporting another order. A dictatorship in social choice means that one fixed agent's highest-ranked alternative is always selected, regardless of all other reports.
The Gibbard-Satterthwaite theorem says that every onto, deterministic strategyproof social choice function on this unrestricted domain is a dictatorship in social choice. Equivalently, with at least three possible alternatives an onto nondictatorial rule must permit manipulation. Both the number of alternatives and the unrestricted preference domain are essential hypotheses.
For the requested top-bottom decisiveness lemma, suppose , with top in and bottom in . Fix any with top. If , agent with true order could report and obtain its best outcome , contrary to strategyproofness. Hence . Now fix any . If , agent with true order could report and obtain , which is better than its bottom alternative . Therefore
Call this agent being decisive for . The same argument with agents interchanged applies to agent .
Here is a complete proof of the two-agent theorem. First, onto plus strategyproofness gives unanimity. If occurs at some profile, change agent to any order with top: a different outcome would allow that agent to obtain by returning to its old report. Then change agent to any order with top in the same way. Thus every profile with both agents ranking top selects .
We also need Pareto efficiency. A useful rank-raising monotonicity lemma follows from strategyproofness: if the current outcome is , and one agent changes its order without placing above any alternative previously below , the outcome remains . Otherwise an outcome would satisfy in the old order, since a profitable deviation is forbidden there, but in the new order, since reporting the old order is forbidden there. Those comparisons contradict the allowed change. If both agents prefer to a selected , change their orders one at a time to put first and second. These changes only raise relative to other alternatives, so the outcome remains , contradicting unanimity for . Therefore an alternative unanimously dominated by another cannot be selected.
Choose distinct . Give agent order and agent order . Pareto efficiency forces the outcome to be or . If it is , move to the bottom of agent 's order while keeping top. A switch to would be a profitable deviation for its old true order. Every other alternative is unanimously dominated by . Hence the outcome stays , and the top-bottom decisiveness lemma makes agent decisive for . If the outcome is , the symmetric argument makes agent decisive for . Consequently some agent is decisive for some alternative. Rename that agent and that alternative .
Both agents cannot be decisive for this same . To see this, choose distinct, with every remaining alternative below these three, and consider
At , agent can obtain by placing it top, so strategyproofness restricts the outcome to or . Both agents prefer to , so Pareto efficiency forces . At , agent still ranks top and can obtain it by reporting , so the outcome must again be . On the other hand, at , decisiveness of agent for restricts the outcome to or . Both agents prefer to , so it must be . Since is top in , agent can obtain it at by reporting , forcing outcome there. This contradiction proves that agent is not decisive for .
Now fix and any agent- order with first and second. At every , agent can force by placing it top, so the outcome must lie in . If occurs for even one report , changing agent to an order with first and second preserves , because it can return to to obtain its top choice. Lower to the bottom of agent 's order, keeping top. A switch to would be a profitable deviation under its old order, and any other outcome is unanimously dominated by . Thus remains selected at a profile where agent ranks it top and agent ranks it bottom. The top-bottom decisiveness lemma would make agent decisive for , a contradiction.
Therefore every with agent ranking first and second selects . Choose with bottom and apply the top-bottom decisiveness lemma once more: agent is decisive for in every order placing top. This holds for each , and it already holds for . Agent is a dictator in social choice, proving the two-agent theorem.
With three agents and only two alternatives, the two-alternative majority rule is onto and strategyproof and has no dictator in social choice. An agent whose vote is not pivotal cannot change the outcome. A pivotal agent obtains its preferred alternative by voting truthfully and its less preferred alternative by reversing its vote. No one is a dictator in social choice, since the other two agents can both oppose its preference. There is no tie with three agents. This does not contradict the theorem because its hypothesis fails.
Let be the row and column mixed strategies, so their entries are nonnegative and sum to one. The payoffs are and . A Nash equilibrium is a pair in which each strategy is a best response to the other: neither player can improve its expected payoff by a unilateral change of mixed strategy. Equivalently, every positive-probability pure strategy attains that player's maximum pure-strategy payoff against the opposing mixture.
For the complementarity construction of a symmetric Nash equilibrium put and . The equation gives . Nonnegativity and imply . Therefore every used pure strategy has payoff against , while all other pure strategies have payoff at most . The same vector of pure-strategy payoffs applies to the column player in this symmetric bimatrix game. Thus a symmetric Nash equilibrium is
For a genuine Lemke-Howson algorithm path, use two separate vectors, for the row player and for the column player, with slacks
Give labels to or , and labels to or . A nonzero completely labeled pair has and , and normalization yields mutual best responses. At the artificial pair all six labels are present.
Drop label by increasing . The two limiting rows of are and , so the minimum-ratio pivot stops at , where . Label is now duplicated, since also carries it. Increase to remove that duplicate. The limiting inequalities are and , so the next pivot stops at , where restores the dropped label . The endpoint is
It has all six labels and satisfies both complementarity conditions. After normalization, the Lemke-Howson algorithm returns
Against column strategy , row strategy pays , exceeding and . Against row strategy , column strategy pays , exceeding and . This verifies the endpoint directly.
To find every other Nash equilibrium, observe that row strategy strictly dominates row strategy : the payoff differences against the three columns are , all positive. By symmetry, column strategy is also strictly dominated. Neither can appear in an equilibrium. The reduced strategies have row payoff matrix
The two pure Nash equilibria are and . If the opponent uses strategy with probability , the payoffs of strategies are and . Indifference requires . The same computation applies to the other player. A player mixing both strategies forces this exact opposing mixture; a player playing a pure strategy has a unique opposing best response, producing one of the two pure equilibria. Hence there are exactly three Nash equilibria:
For the symmetric mixed equilibrium, the original complementarity construction can use and ; it gives payoff to each player after normalization.

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