For , rescale the order parameter by . Write and introduce dimensionless scaling variables
Every term then has the common energy-density factor :
Minimizing over defines the tricritical crossover scaling functions
For the minimized potential, following the paper's notation , this proves
The exponent names here are unrelated to the couplings in question 2. The expression concerns the specified order-parameter polynomial; a general material can also have a smooth, field-independent background free-energy density. Such a background should be separated before writing a homogeneous singular scaling form. A potential at prescribed magnetization, instead of prescribed field, is a different Legendre transform and is not obtained by this minimization.
There is a needed qualification to the printed single and nonzero-value condition. At , the ordered branch has minimizers and , whereas the disordered branch has minimizer zero and . Thus
For example, , gives an identically zero minimized polynomial, contradicting a nonzero on that side. The valid scaling statement uses separate sign branches, or restricts the asserted nonzero value to approach from the ordered side. At the displayed coordinates are singular; the critical isotherm is obtained as a limit or directly from the equation of state.
Compute the coupling flow at zero magnetic field, or assume the source has support only in retained Fourier modes, so that the shell Gaussian measure is centered. First justify the shell propagator. For a positive quadratic kernel on the shell, the Gaussian functional integral gives covariance equal to the inverse kernel,
with both momenta restricted to . Inserting the Fourier transforms and using the Dirac delta function yields the Gaussian shell covariance
Changing to gives the negative-exponent convention as well. The dependence is on the separation, as required by translation invariance. The printed numerator uses alone: it is correct only if that symbol means the separation or if . For example at , the covariance must equal the constant coincident value , while the literal printed integral generally depends on . Thus the missing separation is a real source qualification, not a change of Fourier-sign convention.
Integrating out the shell gives , up to a field-independent constant. At first order in , the cumulant expansion of a coarse-grained free energy retains . Odd moments of the centered Gaussian measure vanish and Wick theorem gives . Writing ,
The last term affects only the constant; the second is a momentum-independent tadpole diagram correction. Before rescaling it changes to , leaves the quartic coefficient at , and produces no gradient correction. Combining with part (a) gives the leading coupling recursion
This is one-loop shell mass renormalization in scalar quartic theory. Here . The shell Gaussian is well defined if there; near this follows from . A negative slow-mode mass may be stabilized by the retained quartic term and does not require pretending that the full unconstrained quadratic measure at negative mass is normalizable.
Linearizing about gives
Its mass and quartic eigenvalues are and . The off-diagonal term is an additive critical-mass shift: setting the bare is not generally the critical tuning when . The mass remains relevant for every ; at the two linear eigenvalues coincide and the matrix can have a Jordan block, but both perturbations are still relevant.
For , the quartic interaction is an irrelevant operator, and the Gaussian fixed point attracts weak quartic perturbations after the mass and magnetic field have been tuned. The quartic can nevertheless be a dangerously irrelevant coupling: its positive value stabilizes the ordered phase. For , it is a relevant operator, so the Gaussian description is unstable toward interactions. At it is a marginal operator; first-order perturbation theory alone does not decide its fate.
To settle that borderline case, retain the leading quartic contribution from the second cumulant, at zero external momentum in the local expansion. The two-fast-field part of is . Since , its connected second cumulant contributes
Keeping the local quartic term and using Parseval identity gives , where . Thus the one-loop shell quartic renormalization is
The coefficient follows from multiplying the quartic density correction by . This local, zero-external-momentum coupling extraction is not a claim that the exact finite-shell effective action retains only its original polynomial; further operators are generated.
More explicitly, for a thin shell , let , and . With increasing length scale , the leading flow is
This convention has the opposite scale direction to a renormalization-group beta function defined using increasing momentum. On the tuned critical surface at , and , so weak positive is marginally irrelevant, tending to zero with logarithmic corrections rather than remaining an exactly marginal parameter. Just below four dimensions, with , the same calculation yields the Wilson-Fisher fixed point , . It does not justify extrapolating a small- expansion to every lower dimension. The ordinary scalar quartic upper critical dimension is therefore
Again use and distribution dual pairings with complex bilinearity. The Malgrange–Ehrenpreis theorem asserts that every nonzero constant-coefficient differential operator defined by a polynomial has a fundamental solution of a linear differential operator:
If is constant, take . For positive degree , write for the highest homogeneous part. A nonzero polynomial cannot vanish on all of , so choose a real unit vector with . A change of coordinates by an orthogonal matrix makes it the last coordinate direction. In these coordinates,
Crucially the leading coefficient is constant and never vanishes as varies.
The finite-height polynomial root avoidance construction gives the needed Hörmander staircase. Set for . For each fixed , the fundamental theorem of algebra supplies roots , with multiplicity. A root's imaginary part can be within distance strictly less than one of at most one candidate height, since those heights are separated by three. The pigeonhole principle therefore leaves at least one height with for all roots. At that height, for every real ,
No continuous labelling of the roots is required. To select the heights measurably, define
Each is closed, since the coefficients are continuous in . Continuity in makes the rational test equivalent to the bound for all . The are therefore disjoint Borel sets covering . The union of horizontal fibres
is a Hörmander staircase, with bounded imaginary height and a uniform nonzero denominator. For , the transverse space has one point, and this is simply the choice of one horizontal line.
For example, has roots . One may select for , and for . Then the first region has , while in the second each root is at least two units from the chosen height. The figure shows the height projection of these horizontal fibres, rather than additional connecting contours.
Figure 1. . Blue segments select horizontal integration lines away from all root heights. The dotted vertical markers indicate jumps in the transverse parameter and are not integration segments. Grey bands indicate excluded height distances less than one. Details.
Define a linear functional on test functions by
To establish that this is a distribution, fix a compact set containing the support of , inside a radius- ball. The Fourier decay in a bounded complex strip estimate follows by applying to :
The finite bound on the heights absorbs all exponential factors and powers of into . Taking and using proves absolute convergence and the required finite-order continuity on each fixed support set. Hence .
Now the formal transpose identity and the Fourier derivative identity give
The polynomial denominator cancels in the pairing for . For each fixed real , the remaining function of is entire and rapidly decreasing in its real part throughout . The Cauchy integral theorem therefore allows each horizontal fibre to be shifted to the real axis; its truncated vertical end integrals tend to zero. Absolute convergence justifies Fubini's theorem and the finite sum over the measurable partition. Thus
The last equality is Fourier inversion. Transforming back from the orthogonal coordinates preserves and gives the required fundamental solution of a linear differential operator for the original operator. The staircase is allowed to jump: after cancellation the shift is performed on each one-dimensional fibre, so no assertion that is a smooth contour is used. This construction proves a distributional fundamental solution, without claiming a tempered-growth estimate.
For , use the smoothing convolution with a test function
Indeed is a smooth function, with . On each compact set of values, all translated test functions have supports in one fixed compact set, so differentiation is justified by the continuity of the distribution. Compact support of makes the convolution well defined even when is not tempered. It does not imply compact support of .
Finally the affine solution space of a linear equation is
If every homogeneous solution is represented by a smooth function, so is every . Conversely, if every solution for this fixed is represented by a smooth function, then for any homogeneous solution , the solution is smooth, and subtracting the smooth shows that is smooth. Hence All inhomogeneous solutions are smooth functions exactly when all homogeneous solutions are smooth functions. This is a global statement on for the stated data; no additional local regularity theorem is being assumed.
Use the characteristic polynomial in the convention :
For fixed with , all three limiting eigenvalues are simple. Expanding this polynomial at each root, or applying first-order perturbation of a simple eigenvalue, gives
These are fixed- asymptotic expansions, not uniform through . At the displayed correction to vanishes because is an exact root for every ; there is no second nonzero term for that branch.
The two roots near interact when the correction is comparable to their unperturbed gap . Thus the distinguished limit is , with bounded real . Set and . The polynomial becomes
At orders and ,
With , the two interacting eigenvalues are
The correction to the pair is included to resolve the next perturbative term as well as the leading splitting. In particular the previously excluded fixed case is :
The half-integer powers reflect square-root splitting of a defective double eigenvalue: the limiting matrix has a nontrivial Jordan block at .
For matching, write and take the overlap . For , , , while , . Consequently the distinguished branches reduce to
The regular coefficient satisfies , proving agreement. For the labels and exchange roles and the same matching holds. The isolated negative branch also matches because . As a spectral check, positive diagonal symmetrization of a matrix transforms this tridiagonal matrix to a real symmetric matrix with off-diagonal entries and ; its eigenvalues are real for positive .
On the unit circle, , so
Thus the trigonometric polynomial is nonnegative, with a zero at , and
Equivalently, writing gives . The factor has polynomial degree one as required. Multiplication of by any constant of modulus one leaves the factorization unchanged; uniqueness of is not claimed.
This is the simplest instance of the Fejér–Riesz theorem, where nonnegativity of a trigonometric polynomial on the unit circle admits a polynomial modulus-square factorization.
For , the coefficient symmetry yields
Thus equals its reversed-conjugate polynomial. If is a root of a polynomial, with , this identity gives , proving
The reciprocal-conjugate root pairing also preserves the multiplicity of a root: reversal and complex conjugation take each factor associated with to the corresponding factor associated with , with the same exponent.
Since , no zero root of a polynomial occurs, so the reciprocal operation is always defined on the roots of a polynomial. Roots off the unit circle are paired on opposite sides of it; roots of a polynomial on the unit circle are fixed by this operation. Pairing alone does not force even multiplicity at those fixed roots of a polynomial; that extra fact uses nonnegativity.
Since is real on the unit circle,
Multiply the difference by . It is an ordinary polynomial of polynomial degree at most vanishing at every point of the unit circle. A nonzero polynomial has only finitely many roots of a polynomial, so all its coefficients vanish. This proves the conjugate symmetry of trigonometric polynomial coefficients:
For arbitrary nonzero complex , coefficient substitution now gives precisely
Equivalently . The complex conjugation on the right applies to the whole value, including the coefficients; it cannot simply be discarded away from the circle.
The PDF additionally assumes . Then , so the ensuing polynomial has polynomial degree exactly and nonzero constant term. These clauses and this subpart are absent from the damaged TeX, but present in the PDF.
Use localization and cancellation of the assumed interval-adapted wavelet basis: at scale , every detail wavelet has support diameter at most , L1 norm at most , and annihilates polynomials of degree less than . These bounds also apply to the modified boundary wavelets; a restriction of an arbitrary whole-line wavelet without the cancellation-preserving boundary construction would not suffice. The finitely many coarse scaling functions can be treated separately.
Write with as above. Because , we have . Choose in the support of a function of , and let be the degree- Taylor polynomial of . The Hölder-Taylor remainder bound gives
For this is the Hölder seminorm bound. For , the integral Taylor remainder is bounded using , whose magnitude is at most .
The vanishing moments remove from the inner product. Applying the remainder estimate and the L1 norm bound on the localized support yields the wavelet coefficient decay for Hölder functions
Thus
Here depends on the fixed wavelet family, the exponent and boundary construction, but not on . The proof uses the assumed regularity and moments; it does not identify the minimal Daubechies wavelet order with its differentiability order, which need not coincide.
The Lagrange interpolation polynomials at and are
Their integrals give
Thus the coefficients are exactly those of a collocation Runge-Kutta method. More explicitly, with stage slopes , the degree-two polynomial
satisfies , , and . These are the collocation Runge-Kutta method equations, and . For an implicit Runge-Kutta method, the nearby stages exist uniquely for sufficiently small under Lipschitz continuity; see stage solvability of an implicit Runge-Kutta method.
Write , , and interpret powers of componentwise. The Butcher order conditions through degree three are verified directly:
For the last equality, . However, the necessary degree-four Butcher order condition fails:
Consequently, for sufficiently smooth ordinary differential equations, the local truncation error is and the order of a Runge-Kutta method is exactly
This is the two-stage Radau IIA method; the conclusion follows from the explicit calculations rather than its name.
On the Dahlquist test equation, , so the amplification polynomial of a multistep method becomes
Both roots of a polynomial, including the parasitic one, must satisfy the root condition for a multistep method.
For , multiply by seven and set . The polynomial is . The complex quadratic Schur criterion says that its roots of a polynomial are strictly in the unit disk if
Here is a direct verification on the entire left half-plane. Put , , , and . Then
and expansion of the squared inequality gives
Every term is nonnegative, and at least one is positive unless . Since , taking square roots proves the strict complex quadratic Schur criterion for . At , the roots of a polynomial are the simple values and . The leading coefficient cannot vanish because . Thus the method at is A-stable. Its order three is compatible with the Second Dahlquist barrier: that barrier concerns first-derivative linear multistep methods, whereas this method uses a second derivative.
For , choose , strictly in the left half-plane. The amplification polynomial of a multistep method reduces to
One root of a polynomial has modulus . Thus the method at is not A-stable.
A Runge-Kutta method advances through stages
The Butcher tableau records , normally with . Linear absolute stability tests the amplification of a linear decay mode; nonlinear B-stability compares distances between two solutions of a dissipative vector field. Both describe propagation of perturbations, but they impose different conditions.
For the Dahlquist test equation, elimination of stages gives
The linear stability domain consists of for which the step is defined and . Poles or singular stage systems must be excluded, even if an output formula has a formal cancellation. For a scalar test equation, the proof is : the powers are bounded exactly when . For , the update is . If is a normal matrix, unitary diagonalization of a normal matrix makes the operator norm equal to the largest scalar amplification modulus. For a diagonalizable matrix, powers are bounded by the condition number of the eigenvector matrix times the maximal scalar power. These constants must remain uniform for mesh-dependent systems. A defective unit-modulus eigenvalue can instead produce a growing Jordan block; the scalar spectral test alone does not control a general matrix.
An A-stable method accepts the entire closed left half-plane. The Explicit Euler method has and a disk of stability , so it is not A-stable. No nonconstant polynomial stability function can be A-stable, since it is unbounded on the negative real axis; this excludes all consistent explicit Runge-Kutta methods. The Backward Euler method has , and when , proving A-stability. It is also L-stable, because for large left-half-plane .
The implicit midpoint rule and the trapezoidal rule have the same scalar stability function,
The identity proves A-stability. On the imaginary axis their amplification has unit modulus, and along the negative real axis it tends to . Thus neither is L-stable; very stiff decay can persist as alternating numerical values. In contrast, the two-stage Radau IIA method has , with the explicit nonnegative modulus-gap proof in question 1, and is L-stable. This illustrates why L-stability matters beyond A-stability for a stiff differential equation.
For nonlinear problems, assume a real or complex Euclidean inner product and the dissipativity hypothesis
for all relevant states at each common time. Exact solutions satisfy
A B-stable Runge-Kutta method reproduces this nonexpansion of distances whenever its stages exist. Put , , and . Then . Expansion of the output squared norm, followed by substituting in its linear terms, proves the Runge-Kutta contractivity identity
If and is a positive semidefinite matrix, the first sum is nonpositive by dissipativity, and the second is nonnegative: expand each coordinate of the stage vectors to express it as a sum of nonnegative quadratic forms. These are exactly the conditions for algebraic stability of a Runge-Kutta method. Hence algebraic stability implies B-stability. Applying B-stability to the linear dissipative problem , or its two-dimensional real form, also proves A-stability whenever stages are well defined.
The Backward Euler method has , hence ; the implicit midpoint rule has , , hence . Both are algebraically stable and B-stable. For the two-stage Radau IIA method,
a positive semidefinite matrix, while both weights are positive. It therefore combines third-order accuracy, B-stability, and L-stability. The distinction between stability and solvability is essential: for Lipschitz continuous , the stage map is a contraction when , so the contraction mapping theorem proves small-step unique solvability. The preceding algebraic stability proof is an estimate for existing stages; it is not a theorem asserting stage existence for arbitrary step sizes and domains.
Linear A-stability is insufficient for nonlinear B-stability. The trapezoidal rule fails B-stability, even though its scalar stability function is identical to that of the B-stable implicit midpoint rule. Its Runge-Kutta method coefficients are
Failure of this sufficient algebraic stability test alone would not prove failure of B-stability. An actual counterexample does: take and . Dissipativity follows from
The unique step map obeys , because the left-hand side is strictly increasing and onto. At , , and implicit differentiation gives
Nearby initial states expand in distance. This proves a true nonlinear failure rather than merely failure of a coefficient criterion.
Finally, stability of a numerical method on finite intervals connects these contractivity properties to accuracy. If a one-step map is nonexpansive and its exact one-step defect has norm at most , then the error satisfies , hence for . A Lipschitz step bound gives the same order using the discrete Gronwall inequality. For a stiff differential equation, the value of B-stability is that the propagation estimate need not grow with a large negative dissipative rate. The accuracy constant still needs appropriate smoothness and uniform derivative bounds; stability alone does not establish a mesh-uniform error order.
Take the current to be dilute, vertically well mixed and Boussinesq approximation, with constant channel width , a horizontal absorbing bed, negligible ambient fluid entrainment, negligible bed friction, and no resuspension. The shallow-water approximation neglects vertical inertia and gives hydrostatic pressure. Particle loss alters reduced gravity but does not alter the leading-order carrier-fluid volume or inertia; otherwise additional mass and momentum terms would be necessary. The current occupies depth , has depth-uniform speed , and has particle volume fraction , with and constant .
Volume conservation of a short channel segment gives . Its suspended particle amount per unit bed area is , and the downward particle deposition flux is . Thus , which becomes on multiplying by .
At vertical coordinate above the bed, excess hydrostatic pressure divided by reference mass density is . Integrating across the depth gives the depth-integrated force flux . The horizontal momentum per unit bed area is and the advected kinematic momentum flux is . The resulting variable-buoyancy shallow water equations are
The derivative of the pressure term acts on both and ; treating reduced gravity as horizontally constant while particles settle would lose part of the force.
For a steady interior, let denote volume flux per unit width. Then the particle balance is a first-order linear differential equation,
Here , is constant, and deposited particles are not returned to the current. In particular the decay length is for , and the cancellation of depth follows from : dilution and transit time compensate in the deposition balance.
The steady momentum equation also gives
The inlet depth selects . Depth and speed at every downstream position are determined by the continuous positive root of a polynomial in
This implicit expression also makes clear why the inlet condition is needed: there are generally two possible positive depths.
The depth branches of a steady depositing gravity current are distinguished by the Froude number . Differentiating the momentum invariant, and using the exponential decay of reduced gravity, gives
For , supercritical flow has and decreasing depth, with and as . Subcritical flow has and increasing depth, with . This indefinitely deepening branch eventually violates the assumed shallow or confined-channel geometry. Hence the depth does not universally decrease: that conclusion needs a supercritical inlet.
For fixed , has its unique minimum at , with . The two positive roots when lie below and above . Since decreases downstream while is constant, an initially strict branch remains separate from the other branch and cannot cross a critical point. A critical inlet with has no finite depth derivative: at the first differentiated equation would equate zero to a positive value. It requires a singular entrance adjustment or physics beyond this steady model. If , both reduced gravity and the continuous depth branch are constant. These steady solutions describe the supplied current interior, not a moving finite-release front.
For two particle populations, write and , allowing different constant particle-density conversion factors. The bidisperse particle-laden gravity current equations are
For the steady case,
Thus the depth is obtained from the same cubic polynomial invariant with the sum of the two exponentially decreasing reduced gravity contributions.
The local deposit consists of the two particle deposition fluxes and . For a positive total deposition rate, the bidisperse gravity-current deposition fraction by particle volume is
If the particles have a common material density, this is also their local mass fraction. If they have common , it can be written in the source's buoyancy notation as
For unequal replace each by . The exponent sign matters: with both populations present and , the faster-settling population has decreasing local deposit fraction downstream, since . Equal positive settling speeds give a constant fraction. A nonsettling population contributes no deposit; if the entire local deposition rate is zero the deposit fraction is undefined.
If “fraction of particles” means number fraction rather than particle-volume or mass fraction, let be a single particle's volume in population . The correct weights are then , so
Settling speeds alone do not determine without particle properties and a drag law. Finally, if the intended deposit is cumulative over the bed from to , rather than local at , integrating particle deposition flux gives the species volumes per unit channel width . The cumulative particle-volume fraction is
For both , its limit at infinity is the incoming particle-volume fraction, whereas its limit as is the local deposition fraction at the inlet. Local sorting and the cumulative inventory are different observables.
For any vector , use its Hamming weight . The stated product identity also follows directly by summing each coordinate independently:
For , interchange the two finite sums with . Character orthogonality evaluates the inner sum over codewords, whereas the product identity evaluates the sum over all binary vectors. Thus
Multiply by to obtain the MacWilliams identity in the paper's weight-enumerator convention:
Both sides are polynomials, so equality for extends to as well; the intermediate quotient is not a restriction on the final identity.
A linear code of length and rank is a -dimensional linear subspace of . The Hamming weight of a vector counts its nonzero coordinates. Thus the sum of the coefficients of the weight enumerator is the number of codewords:
Since the zero vector is the unique word of weight zero, . Symmetry of the enumerator therefore implies . Conversely means that the all-one vector belongs to . Translation is then a bijection of which replaces weight by , proving the polynomial symmetry. For length zero the same conclusion holds with the unique empty vector.
The dual code is , using the standard bilinear form over . If , each summand of the character sum equals one. Otherwise choose with ; replacing by permutes the summands and reverses their sign. The sum equals its own negative and must be zero. Consequently
This is character orthogonality for the additive group of the code.
A splitting field of a nonzero polynomial over is an extension in which splits into linear factors and which is generated over by all its roots. For a constant nonzero polynomial the splitting field is ; the zero polynomial does not have a root-generated splitting field in this standard definition.
Given two splitting fields , enumerate the roots generating and extend a -embedding one root at a time. If an embedding is defined on , the minimal polynomial of the next root divides over that field. Its image under the embedding therefore divides over the corresponding subfield of , and has a root in . The quotient construction extends the embedding to that root. The polynomial need not be a separable polynomial.
At the end this gives a -embedding . It sends the distinct roots of injectively to its roots, hence permutes the finite set of distinct roots and contains every root in its image. Since these generate , the embedding is onto. Thus the splitting field is unique up to a (K)-isomorphism.