On the unit circle the two equations reduce to the same condition
since . Define . At either point it is strictly positive, and at either point it is strictly negative. On each of the four closed quarter-circle arcs, continuity and the intermediate value theorem give a zero in its interior. These four interiors are disjoint, so there are at least four distinct solutions, one in each open quadrant. No solution here lies on an axis because are strictly positive.
Let be the vertices opposite the corresponding sides, and let be their barycentric coordinates. We prove the equivalence by negating each assertion.
Suppose the closed covering sets have empty triple intersection. For put , and define similarly. At least one distance is positive, since cannot belong to all three sets, and at least one is zero, since they cover . Consequently
is continuous and lies in the boundary: one barycentric coordinate vanishes. On its first coefficient is zero because , so , and likewise for the other sides. This contradicts assertion (1), proving (1) implies (2).
Conversely, suppose such a boundary-valued map exists. Define closed subsets of by
They are closed because is compact and the coordinate functions are continuous. They cover because is boundary-valued; the side-preserving condition gives , , . Their triple intersection is empty because barycentric coordinates sum to one. Thus failure of (1) implies failure of (2), completing the equivalence.
In fact both assertions hold. If the map in (1) existed, let rotate the equilateral triangle through . Brouwer fixed-point theorem applied to gives a fixed point on the boundary. On any side containing , side preservation puts also on , so it is their common vertex. A side-preserving map fixes every vertex because that vertex lies on two sides. Therefore , impossible for a noncentral vertex. This also proves the covering-intersection assertion through the established equivalence.
The planar Brouwer fixed-point theorem states that every continuous map from a nonempty compact convex subset of to itself has a fixed point. In particular it applies to a closed disk or a closed triangle. Convexity and compactness are essential hypotheses in this formulation.
For a relativistic species at zero chemical potential, and , so its entropy density is proportional to . The Bose-Einstein distribution gives the bosonic normalization, while the fermionic thermal integral is of it. Species still in thermal equilibrium have ; freely streaming decoupled species can have another temperature and therefore contribute an extra factor when the total is expressed in units of . This gives the two terms and and their stated effective-degree-of-freedom weights.
After neutrino decoupling, the comoving entropy of the photon-electron-positron plasma is conserved separately from the neutrinos. Before electron-positron annihilation its effective entropy count is ; afterwards it is . Consequently
whereas stays equal to its pre-annihilation value. Hence
This is the instantaneous-decoupling, negligible residual-electron approximation used in the question. Heating of the still-coupled plasma, not cooling peculiar to neutrinos, creates the temperature difference.
Substitute in the Fermi-Dirac distribution energy integral. Then
The integral converges, is positive, and is independent of temperature. Thus , with equal to the displayed constant integral. The given normalization is for the specified degeneracy; further internal degrees of freedom multiply it.
The procedure in part (i) sometimes needs five tests, for items one or two. A binary decision tree of height has at most leaves, so distinguishing ten possibilities requires .
A prefix code attaining this worst-case bound is
Use the same subset-testing rule. The minimum worst-case number is four, so the expected-optimal procedure is not worst-case optimal. This four-test procedure has expectation , illustrating the small cost of imposing the smaller maximum depth.
There is a genuinely different optimal procedure. Exchange the codewords assigned to items three and four. Both have code length four, so each item's length, and hence the expected number of tests , remains unchanged. The first tested subset now contains item three instead of item four, so this changes the tested groups rather than merely reversing the names of the two test outcomes. The new prefix code still identifies every item uniquely and retains the minimum Huffman coding expectation.
Each test divides the current candidate set into a tested subset and its complement: failure places the defective item inside the subset, whereas success places it outside. A sequence of tests is therefore a binary decision tree, and minimizing its expected depth is the Huffman coding problem with weights .
Combine the smallest two current weights repeatedly. One choice of merges is , , , , , , , , . It gives this explicit prefix code:
At any node, test the candidate items whose next code digit is one. Assign failure to digit one and success to digit zero, and repeat until only a single codeword remains. This specifies every test, including the first subset . Huffman coding minimizes the weighted codeword lengths, so the optimal expected number is
The sum of the successive merged weights is another check on the numerator .
Let , , and define the high-frequency endpoint parameters
They obey (with equality of endpoints for a single high mode). Since is convex in and the endpoint modes are included, the exact high-frequency attenuation is
The minimax choice balances the endpoint values with opposite signs. If they were not balanced, moving toward their balancing point would lower the larger endpoint value. Thus
For odd , , giving and . For even , , giving
These give the exact finite-grid high-frequency Jacobi smoothing optimum, including complete annihilation when there is only one high-frequency mode. Their grid-independent limits are . Choosing damps every high mode by at most on every grid, while its low-mode factor remains . Thus high frequencies decay geometrically much faster. The familiar pair is the optimal uniform-in-grid smoother; it need not be the exact optimum on a particular finite sine-mode grid.
For a fixed , convergence for every initial error is equivalent to for all , where . Thus
A single parameter works for every finite precisely when : the largest tends to two as , so every eventually fails, whereas has all eigenvalues strictly between and one for each finite grid.
For such the lowest-frequency eigenvalue satisfies, using ,
An initial error proportional to retains exactly the factor . Hence the worst-case spectral radius cannot improve on a factor of the form , with independent of grid size, and reducing a slow-mode error by a fixed fraction takes order iterations. This is a worst-case rate assertion, not a lower bound for every individual initial error: a vector containing only faster modes, or the zero vector, need not exhibit the slow mode.
Subtracting the fixed-point equation for the exact solution gives
Here , so the supplied sine eigenvectors of are also eigenvectors of . Explicitly,
Their distinct eigenvalues for nonzero make them an eigenbasis; alternatively the discrete sine orthogonality gives a basis even when .
Assume the diagonal entries of are nonzero. The Relaxed Jacobi method simultaneously updates every component using the preceding iterate:
In matrix form, with , this is . The ordinary Jacobi method has .
Vertical hydrostatic balance with atmospheric pressure at gives to this order. Therefore and integrating the gradient from part (i), with on both sides, gives
For positive the upstream surface rises and the downstream surface falls. Thus the displacement scale is , and the flat-geometry consistency condition is
Indeed , so this scale controls the maximum, not only a typical value. Together with and , these conditions ensure a thin, weakly displaced, viscosity-dominated gap. The slope is smaller still, of order .
Here , so the geometric condition is . Let be the signed roller velocity near its top, with magnitude ; choose the rotation sense making positive in the direction. The small-inertia condition is
with understood for a reversed rotation. The roller's slope and change of tangential speed are small in the gap region. The liquid is Newtonian, the roller imposes no slip and the free surface is shear-free; surface tension is neglected as in the gravity-only model.
For the leading flat film geometry, use as the roller boundary and as the free surface. The lubrication approximation gives , , , hence
The corresponding vertical velocity is determined by incompressibility, for example , so that and by differentiating the constant-flux equation. This is the leading tangency condition at the roller. Steadiness makes independent of .
For the rotating roller under a nearly flat free surface, the excess pressure tends to zero in the outer fluid on both sides of the gap. Consequently
Set . The supplied recurrence gives and , so
The extension of the parabolic gap integrals to infinity is the usual matched thin-gap approximation; their dominant contribution comes from . Taking the surface flat refers to this leading geometry, not setting its small hydrostatic displacement identically to zero in the pressure balance. An exactly flat stress-free surface at exactly constant pressure could not sustain this variable pressure gradient; the displacement needed to do so is checked in part (ii).
Use signature , for which . With the Lorenz constraint in Proca theory, the Proca equation is . A static solution therefore satisfies .
For direct radial differentiation gives . At the origin its singularity contributes : integrating the Laplacian over a small sphere gives limiting outward flux , while the mass term's integral tends to zero. Thus obeys . Convolution proves the printed Yukawa potential solution
The integral requires suitable source decay, for example compact support. For conserved static sources, differentiating the convolution and integrating by parts gives as well; its spatial divergence is the convolution with .
For the usual nonnegative mass parameter this is the decaying static solution, and gives the Coulomb kernel with Lorenz gauge imposed. If the arbitrary real parameter is negative, the printed kernel still gives a particular solution for compact sources, but grows at infinity; the decaying boundary condition selects instead. Static sources also allow homogeneous time-dependent solutions, so this construction establishes a static solution, not that every solution is static.
Take of the Proca equation. Commuting partial derivatives and antisymmetry make , while current conservation gives . Thus . For , . This Lorenz constraint in Proca theory is a consequence of the massive equations, rather than a gauge choice.
The stated “arbitrary constant” includes a genuine exception at . Then the divergence condition is not implied: with and , solves the equations for any smooth , whereas need not vanish. In the massless theory the Lorenz condition can instead be imposed as a gauge fixing.
For compactly supported variations, antisymmetry of the electromagnetic field tensor gives . Integrate by parts in the action to obtain
Arbitrariness of the variation gives the Proca equation
together with the unchanged identity coming from . The signs follow from the source and mass terms as printed.
For the quadratic potential the characteristic curves are harmonic oscillations:
The inverse is , . Therefore the Liouville equation has solution
This formula works for smooth data or by transport for locally integrable data, and for measures by pushforward. Although the quadratic itself is not globally Lipschitz as in the initial sufficient hypotheses, its gradient is globally Lipschitz, which is the property actually needed for this global flow.
Formally the Jacobian determinant of the characteristic flow map satisfies , , so . Changing variables gives
Taking the th root proves for . Equivalently multiply the equation by and integrate the divergence term, with vanishing boundary terms. Volume preservation gives the result without needing such boundary decay for general integrable data.
Along a characteristic curve, the Liouville equation gives . Hence
Composition preserves nonnegativity, so . For locally integrable data this formula defines the transported weak solution, and the Lipschitz invertible flow preserves null sets locally. Thus the same assertion holds almost everywhere without requiring pointwise smooth data.

There are unlisted articles, also show them or only show them.