A quadratic form on a finite-dimensional real vector space is a function for a symmetric bilinear form . Conversely recovers that bilinear form. Two quadratic forms are congruent if a linear isomorphism satisfies ; in coordinates this is matrix congruence, , with invertible.
Sylvester's law of inertia says that a real quadratic form admits coordinates in which
and the numbers of positive, negative and zero squares, , are independent of the coordinates. Here ; and are the maximal dimensions of subspaces on which the quadratic form is positive definite and negative definite, while is the dimension of its radical of a bilinear form. These numbers are the inertia of a bilinear form. The rank of a quadratic form is , and the signature of a quadratic form, in the signed-difference convention, is .
Completing squares gives
The change of coordinates is invertible, so the inertia is and the signature is . If signature is recorded as an ordered pair instead, that pair is .
The conjugacy class of is its orbit under the conjugation action, and its stabilizer is the centralizer . The orbit-stabilizer theorem gives
By Lagrange's theorem, the order of the centralizer divides , so the index is a power of . A conjugacy class has size one exactly when its element belongs to the center of a group.
Separate these singleton classes in the class equation:
where the sum takes one representative of each nonsingleton conjugacy class. Every summand is divisible by . Thus , and the identity ensures . Consequently . This is the nontrivial center of a finite p-group property.
For differentiable maps at and at , the chain rule asserts
Write with , and with . Since , substitution gives
Both remaining terms are , proving differentiability and the stated chain rule. The estimate for also holds when its argument is zero, by setting .
For the circle constraint take . The composite is constant, so the chain rule gives
Since , this is a nonzero row vector annihilating . Thus cannot be invertible: at every . Geometrically, the derivative of a map into a level set takes values in the tangent space to the circle.
Rouché's theorem states that if are holomorphic functions on a neighbourhood of a simple closed contour and its interior, and on the contour, then and have the same number of zeros inside, counted with multiplicity.
On , use : the other terms have absolute value at most . Hence there are two zeros inside the unit circle. On , use : its modulus is , whereas the other terms have total modulus at most . Hence there are seven zeros inside the larger circle. The strict inequalities also exclude zeros on either boundary. There are roots in the annulus, counted with multiplicity.
Put and . The chain rule turns the wave equation into . Integrating first in and then in gives the D'Alembert formula
At the left endpoint, for . At the right endpoint, , hence
Thus the travelling waves can be represented by , with and both -periodic. More precisely, the positive-time boundary conditions constrain only on and on ; their unused arguments may be filled in by this periodic extension. They do not constrain arbitrary pre-existing choices outside those ranges. This is periodic reflection for a fixed-end string.
Using , differentiation gives and . The cross terms in the wave energy cancel, so
This integrates a -periodic function over exactly one period. is constant. Equivalently, the wave equation gives , because the fixed endpoint values imply there.
Applying the angular momentum operator directly gives
For an eigenvalue , comparison with gives and . The first identity excludes ; differentiating it and using the second gives . No additive constant in is permitted. The possibilities are , , and , .
For , the polynomial is homogeneous of degree two and satisfies . Expanding the three squared orbital angular momentum operators gives, with ,
Here and . Therefore . This is the degree-two case of angular momentum of a homogeneous harmonic polynomial; its angular labels are , .
The grounded conducting plane supplies the induced charge needed for a uniform field between the plates and zero field above the upper plate. Gauss's law gives in the gap. With electric potential zero at the grounded plate,
Integrating the electrostatic energy density across the gap gives the capacitor energy per unit area
For an isolated upper plate, charge is fixed, so increasing to gives exactly , with its initial value. The positive increase equals the mechanical work done against attraction.
At fixed voltage, the new charge density is , and the energy becomes . Consequently . Charge per unit area flows back to the voltage source, which receives energy . The externally supplied mechanical work is still : the field loses half this returned electrical energy and the mechanical work supplies the other half. Thus the fixed-voltage capacitor energy balance includes both field and source energy.
For distinct nodes, define the divided difference recursively by
Only the function values at the nodes are needed. Induction in this recursion gives
For an interior index , the two terms in the recursive numerator combine using ; the endpoint terms give the same displayed denominators. This proves the formula, including its symmetry in the nodes.
The Lagrange interpolation polynomial on the first nodes is
Its leading coefficient is therefore . Meanwhile vanishes at and has degree at most . The factor theorem and the leading coefficient imply
Starting from and summing these identities proves the Newton interpolation polynomial formula
The same factor theorem proves uniqueness: the difference of two interpolants of degree at most has distinct zeros and must vanish.
For a Markov chain invariant measure, , and hence . The irreducible Markov chain property supplies, for each , an with . Nonnegativity gives . Every coordinate of a nonzero invariant measure is positive.
Start the Markov chain at , and let be its first return time. Each product in the series is the probability of a path with no intermediate visit to . Thus
This is the expected number of visits to in an excursion, including the return endpoint and excluding the starting point. Because the chain is recurrent Markov chain, almost surely, and exactly one visit to is counted: . Counting the starting point instead of the return endpoint gives the equivalent usual excursion occupation measure.
For the lower bound, let , , and . The stationarity equations on , with , are . Iterating and using nonnegativity yields
The th coordinate on the right is precisely the partial excursion series for . Taking its increasing limit gives ; for equality follows from . The iteration is valid also on a countable state space because all summands are nonnegative.
A matrix is in Jordan normal form if it is block diagonal with Jordan blocks , where has ones immediately above the diagonal and zeros elsewhere. For a Jordan normal form matrix , number its diagonal positions and put
Choose positive avoiding the finitely many values solving for . The matrix remains upper triangular and now has distinct eigenvalues, so it is diagonalizable. Its entries converge to those of . For arbitrary , use . This proves density of diagonalizable complex matrices.
If is diagonalizable with eigenvalues , conjugating by the same basis change conjugates to . On the four matrix units , this acts by . Thus, writing and , its characteristic polynomial is
The entries of depend linearly on those of , and the coefficients of its characteristic polynomial depend polynomially, hence continuously, on those entries. Apply the formula to the approximating and pass to the limit. The boxed formula therefore holds for every , including non-diagonalizable matrices. This is the two-by-two anticommutator characteristic polynomial.
For each , maximality implies a nontrivial relation
Here , since otherwise this would contradict the linear independence in a module of . Thus . Take , with empty product equal to one. Because is an integral domain, . Every satisfies , and this is also true for . Expressing any element of the finitely generated module as an -linear combination of now gives . This is clearing denominators relative to an independent module subset; it does not require to be a field.
The map , , is a module homomorphism, and it is injective because and is a torsion-free module. The linear independence in a module of makes the map sending the standard basis to an isomorphism. Thus is a finite free module, and . This proves embedding a finitely generated torsion-free module in a finite free module. No claim that the submodule itself is free over an arbitrary integral domain is needed.
The contraction mapping theorem states that a map of a nonempty complete metric space into itself, satisfying for some , has a unique fixed point. Iteration from any point converges to it; for example .
Assume is nonempty. Its boundedness makes finite. Symmetry, positivity and separation follow pointwise from , and taking the supremum of proves the triangle inequality. Hence is a uniform metric.
If is a Cauchy sequence in this uniform metric, each converges by completeness of ; denote its limit by . Given , choose so that for . Letting gives for all , so uniformly. To prove continuity, fix and use
Choose so the outside terms are small, then use continuity of for the middle term. Thus , proving completeness of the continuous-map space in the uniform metric.
The contraction subspace is not necessarily complete. On , , , are contraction mappings and converge to the identity by uniform convergence. Their only possible uniform limit is not a contraction, so this Cauchy sequence has no limit in .
Nevertheless the fixed point assignment is continuous. Fix with contraction constant , and put , . Then
Consequently . This proves continuity of the fixed-point assignment at without requiring one contraction constant valid for every .
Fix , and let be the union of all connected subsets containing . Their union is connected: a separation of the union would place on one side, and every connected member meeting that side would have to lie entirely there. The other side would be empty. By the defining equivalence relation this union is exactly the connected component of .
The closure of a connected set is connected as well. Indeed, if its closure had a separation into relatively open nonempty pieces, density would make both pieces meet the original set and give a separation of that connected set. Therefore is a connected subset containing , so maximality gives . The reverse inclusion is automatic. Every connected component is connected and closed.
Let and be the connected components of and . First, is connected in the product topology. For each , the connected slice meets the connected slice . Their union over is connected by the common-intersection argument, and is exactly .
Now let be the connected component of in . The coordinate projections are continuous, so their images of are connected and contain and . Maximality therefore gives . Conversely, the connected set contains , so it lies in . . This is connected components of a product space; it requires neither local connectedness nor path connectedness.
The inner circle has centre and radius . The pole of the Möbius transformation lies inside that removed disc, so the transformation is holomorphic on , with derivative .
For ,
On the outer boundary this is one. On the inner boundary, , and the ratio is four. More directly, inside the outer circle the numerator exceeds the denominator by , whereas outside the inner circle four times the denominator exceeds the numerator by . Thus the image is . The inverse transformation is , so this is a bijective conformal map onto that annulus.
A radial harmonic function on an annulus has form . The two boundary values give , . By conformal invariance of harmonicity,
It has the required boundary values, and the maximum principle for harmonic functions proves uniqueness among solutions continuous on the closed region.
Parametrize the surface of revolution by . The coordinate tangent vectors have squared lengths and , and inner product zero. Thus the first fundamental form of an arc-length surface of revolution is .
For an arc-length parameter , the geodesic equations are
These follow either from the metric's Christoffel symbols or from the Euler-Lagrange equation for . On a parallel , unit speed requires ; the first geodesic equation then holds exactly when . Thus geodesic parallels of a surface of revolution are precisely the critical points of the radius function.
To obtain any prescribed positive integer , set
The function is bounded and integrable. Choose so , and choose . Then , is smooth, and . The derivative vanishes at exactly . Also , so different meridian parameters give different heights. The resulting surface has exactly geodesic parallels.
For explicit sketches, use the following two radius functions, again with :
Here has only the zero , while has exactly the zeros . Both radii stay positive and both derivatives have absolute value below one. The highlighted rings are the geodesic parallels; the surfaces continue beyond the displayed window.
Figure 1.
Surfaces of revolution with exactly one and exactly two geodesic parallels
.
If every parallel is a geodesic, then everywhere, so is a positive constant. The arc-length condition gives ; smoothness forces a constant sign, hence . The surface is a circular cylinder of radius . It is a circular cylinder because the meridian is a straight line parallel to the axis.
For a variation preserving both endpoint values and slopes, at the endpoints. The first variation is
Integrate the last term twice and the middle term once. All boundary terms vanish, giving
The fundamental lemma of the calculus of variations yields the higher-order Euler-Lagrange equation
For the present functional this becomes . Its general solution is . The left endpoint gives and . The right endpoint then gives
The coefficient determinant is , so , . The stationary function is .
For any admissible perturbation , exact quadratic expansion, followed by the stationarity equation and integration by parts, gives
Apply the supplied Poincare inequality first to , then to , whose endpoint values also vanish:
Thus for every admissible perturbation, proving a global maximum through the clamped second-variation inequality.
Use the Fourier transform convention , with inverse factor . Splitting the inverse integral at zero gives
This is the Poisson kernel for the upper half-plane at height .
Take the Fourier transform in of the Laplace equation. The transformed boundary-value problem is
For the general solution is a linear combination of and ; the two conditions set their coefficients to zero and one respectively. At , the solution is the constant one. Inverting therefore gives
The upper boundary holds pointwise. At the lower boundary the Dirac delta function must be interpreted distributionally: the kernel has integral one and concentrates at zero, so for every continuous compactly supported test function , . This also specifies the solution in the assumed class admitting the stated Fourier transforms.
Irrotational flow permits , and incompressible flow imposes , hence . In the laboratory frame, the no-penetration condition at the translating sphere is .
For separation of variables, take the angular factor , which satisfies . The radial equation is
with solutions and . Rest at infinity excludes the term. The normal boundary condition fixes the remaining coefficient, giving the potential flow around a translating sphere
There is no azimuthal velocity. With fluid density , the kinetic energy is
The angular integral is , and the radial integral is , so . Since and , . Thus the added mass of a sphere is .
During a fall through , gravity does work and buoyancy does work . Starting from rest, conservation of energy gives
Consequently . The mass cancels: the reduced speed comes from both buoyancy and the fluid's added mass.
A sufficient statistic is one for which the conditional distribution of the full sample, given its value, is independent of the parameter. For independent observations the likelihood is , depending on the data only through the counts. The factorization criterion for sufficiency therefore makes sufficient. Directly, all ordered samples with given counts have the same probability, so their conditional distribution is uniform over the possible arrangements, independently of the .
The unrestricted maximum-likelihood estimator is . Thus the generalized likelihood-ratio test uses
with zero-count terms interpreted by continuity. Reject for small , equivalently large .
Write , so . A Taylor series expansion of gives . Summing cancels the linear terms, and yields
Under the null hypothesis, the multinomial central limit theorem places the standardized count deviations in the five-dimensional subspace with coordinate sum zero, with identity covariance on that subspace. Their squared norm consequently tends to the chi-squared distribution with five degrees of freedom. This gives the Pearson chi-squared goodness-of-fit test.
For , the asymptotic p-value is about . The 5% critical value of is approximately . Do not reject at the usual 5% level, or at 10%. A significance level is not specified in the paper, so an unconditional yes-or-no decision is not determined: using this approximation, rejection would require a chosen level at least about .
Write the top row as . The bottom row is then , and nonnegativity becomes
The feasible set is a hexagon in this plane. Its six vertices, hence all basic feasible solutions of this transportation problem, are
There are four independent constraints; each displayed support consists of four cells forming a transportation spanning tree, so each is a nondegenerate basic solution. Conversely, a basic feasible solution is a vertex, so the hexagon enumeration is exhaustive.
For any feasible , the proposed dual inequalities give
If equality holds on every cell with , this last quantity equals . Hence for every feasible . This is weak duality with complementary slackness.
The Northwest corner method first allocates three units to , then two to , one to and four to :
Choose , , . Equality holds on its four occupied cells. The other inequalities are and . Thus implies that minimizes .
The last printed clause changes from minimization to maximization. To answer that wording, use the transportation simplex algorithm for maximization, equivalently minimize the negative costs. There are only two possible entering cells at :
  • Entering increases and by , and decreases and by . The maximal feasible step is , reaching and increasing by .
  • Entering increases and , and decreases and . Here , reaching and changing by .
Put . On the feasible hexagon,
If , this expression is maximized by taking , so is a global maximizer. If , the feasible vertex has objective larger than , so is not a maximizer. Nor can ever be one: comparison with requires , while comparison with the vertex requires . Therefore one pivot to a maximizer is possible exactly when , by entering . Its reduced cost for maximization is ; the other reduced cost is , so the improving pivot is unambiguous.
If “transportation algorithm” is required to retain the preceding minimization objective, no such step can reach a maximizer: every minimizing step is nonincreasing, whereas the feasible point always has . If the final word was intended to be “minimizes”, the corresponding genuinely improving one-pivot condition would instead be ; at , is already optimal and a zero-cost pivot is possible. These distinctions preserve the printed maximization request without silently altering it.

Articles by others on the same topic (0)

There are currently no matching articles.