The conjugate group elements relation is when for some . It is reflexive by taking the identity, symmetric because , and transitive because and imply . Hence it is an equivalence relation.
For a finite group, the centralizer is a subgroup. The map has equal values at exactly when . Its fibers are therefore the left cosets of , giving
By Lagrange's theorem, this index divides . This is also the orbit-stabilizer theorem for the conjugation action, with the centralizer as stabilizer.
For curvature , the Poincare disc model has metric and area element
The given minimizing-diameter property makes the distance from zero to Euclidean radius equal to
Radial symmetry therefore identifies the whole hyperbolic circle in the Poincare disc. Integrating its enclosed hyperbolic area gives
For a geodesic hyperbolic triangle with angles , the Gauss-Bonnet theorem states , in particular , with strict inequality for ordinary finite vertices. Let be the distance of the interior point to the nearest side. The open disc of radius about is contained in the triangle: a path from to an exterior point must first cross the boundary at distance at least . A hyperbolic isometry carries its center to zero, so its area is the area already calculated. Consequently
This uses hyperbolic area bounds an inscribed disc and establishes the requested bound without assuming that is an incenter. A sharper universal triangle bound is possible, but is not needed here.
A function is a differentiable function at if there is a linear map with
The map is its derivative; equivalently for fixed constants. Since every such linear map is bounded, . This proves differentiability implies continuity, not merely continuity along each coordinate axis.
Put . Since , the nonzero-point expression satisfies
Thus the defining remainder condition for differentiability holds with the zero linear map:
The estimate controls every approach direction at once, which is stronger than merely finding the two zero partial derivatives.
On the nonzero axis the function equals one, whereas its assigned value at the origin is zero. Therefore does not tend to as . It is not a continuous function there, and differentiability implies continuity shows
Include the empty set, and take all unions of intervals with . These intervals cover the real line, and the intersection of two is either empty or . Distributing intersections over unions therefore makes finite intersections of open sets open; arbitrary unions are open by construction. The whole line is open, so the axioms of a topology hold. This is the lower limit topology, whose space is the Sorgenfrey line.
If , the neighborhoods and are disjoint. Hence .
For the identity into the cofinite topology, an inverse image is the same subset of . Let be finite and . If has a point greater than , choose to be its least such point; otherwise take . Then avoids every point of , including itself. Taking these intervals over all writes as a -open set. The inverse image of every cofinite open set, and of the empty set, is open. The identity map is continuous, because .
A real harmonic function on a planar open set is a twice continuously differentiable function satisfying . The ordered pair consists of harmonic conjugates when is holomorphic; the corresponding Cauchy-Riemann equations are and .
To prove composition of harmonic conjugate pairs, denote and , and assume the inner pair's image lies in the outer pair's domain. Their equations are , , and . The chain rule gives
Thus the composite satisfies the Cauchy-Riemann equations. Its components are , and differentiating gives and similarly . The composite pair is harmonic conjugate, including when the inner map has a critical point.
At a regular point of the constraint curve, . A constrained stationary point has zero on every tangent vector annihilated by , so its gradient is normal to the curve. The Lagrange multiplier equations are therefore together with . Singular constraint points require separate examination.
Assume . For the ellipse, the equations are
Neither coordinate can vanish at a stationary point, because the first two equations would then force both to vanish. Multiplication gives . Therefore , and the constraint gives , . The stationary values are
The compact ellipse has global extrema, all its points are regular, and these are all stationary points. Hence the first value is the global maximum and the second the global minimum.
For a state in the domain of the operator, its expectation value is
For a normalized state the denominator is one. Use an orthonormal energy eigenstate basis, choosing orthogonal vectors within degenerate eigenspaces. Inserting an expansion into the time-dependent Schrödinger equation gives . Consequently
The phases preserve normalization. Projection onto a specified basis eigenstate gives probability , independent of time. If the measurement distinguishes only the energy and is degenerate, sum over all with .
Using orthonormality to eliminate all cross terms,
This is time independent whenever the expectation is defined. The time-independent Hamiltonian changes only relative phases, not the energy probabilities.
Write and . The normal-sample likelihood is
Without the mean restriction, its maximum has and . Under the null, the maximizing variance is . Substituting them gives the generalized likelihood-ratio test statistic
where and . Assume ; almost surely for positive population variance.
The ratio decreases strictly as increases, so rejecting for small is equivalent to rejecting for large . Under , has Student's t-distribution with degrees of freedom. Therefore the exact size- rule is
This is the two-sided Student's t-test. Equivalently reject when . No large-sample chi-squared approximation is needed for this normal-mean likelihood ratio with unknown variance.
For a state , let and . If distinct states communicate, choose positive-probability paths and of lengths . Then is a return time to each. For every , concatenate , the -return loop, and to see that . Since divides this and , it divides . Thus , and interchanging the states gives . This proves period is constant on a communicating class.
Read the transition matrix from the original PDF; the converted TeX loses the location of the second row's final entry. The communicating classes are
Within the only internal cycle is . Return lengths are multiples of three, and length three has positive probability, so its period is three. This class is open because it has exits to other classes. The class is the closed deterministic two-cycle, of period two. The absorbing class is closed and has period one.
State 5 has outgoing transitions but no incoming transition at all, so it is an open singleton class and . For this return-free state in a Markov chain, the convention gives period zero; if period is defined only when positive return times exist, it is undefined instead. In particular, this singleton is not aperiodic: aperiodicity would require period one.
On the smooth-function space, the product rule gives while . Hence , and both maps preserve the stated smooth space.
For general operators with this commutator relation, use . Induction gives for . Since ,
Every displayed vector lies in , so is invariant under , as well as under . Iterating the lowering formula gives for , and zero for .
Suppose a nontrivial finite linear dependence has highest nonzero term . Applying kills all lower terms and yields . The field is real, , and , so this contradicts . Thus the entire sequence is linearly independent. This identity commutator cyclic ladder also proves that such a representation with a nonzero vector in the kernel of cannot be finite dimensional.
A nonzero primitive polynomial in has greatest common divisor of its coefficients equal to one. Suppose primitive polynomials had a product whose coefficients were all divisible by some prime . Their reductions in are both nonzero, because neither polynomial has every coefficient divisible by . A polynomial ring over a field is an integral domain, so their product is nonzero modulo , a contradiction. Hence the product of primitive polynomials is primitive.
To deduce unique factorization, write any nonzero integer polynomial as its positive polynomial content times a primitive polynomial, with its sign treated as a unit. The preceding result gives multiplicativity of content. Factor the primitive part over the Euclidean polynomial ring , and rescale every irreducible rational factor to a primitive integer polynomial. If with all polynomials primitive and in lowest terms, the equality has contents and . Thus , forcing . The rational factorization therefore lifts to an integer factorization.
A primitive integer polynomial is irreducible over exactly when it is irreducible over : an integer factorization gives a rational one, and a rational factorization lifts by the same primitive-content argument. Factor the content into integer primes. Existence and uniqueness over the integers and over now give existence and uniqueness of the resulting factorization into constant prime factors and primitive irreducible polynomial factors, up to order and signs. Therefore . This is the full lifting step in Gauss lemma for polynomials.
The polynomial satisfies the Eisenstein criterion at the prime two: every nonleading coefficient is even, the leading coefficient is not, and the constant term is not divisible by four. Hence it is irreducible over . Its ideal is maximal in ; explicitly, for any polynomial not divisible by , the Euclidean algorithm gives , furnishing the inverse of its residue class. Thus
For the integer quotient, division by the monic polynomial gives a unique remainder of degree below five with integer coefficients. If an integer polynomial becomes zero in the rational quotient, its integer remainder is still divisible by over , so must be zero. This gives an injective ring map , proving the monic irreducible integer-polynomial quotient is a domain.
The same unique-remainder argument makes the integer quotient a free abelian group with basis . The class of two is nonzero and cannot have an inverse: twice an integer remainder cannot equal the remainder one. Consequently
Project from the north pole along the line through a sphere point onto the equatorial plane , identified with . Parameterizing this line gives
The inverse stereographic projection is
Negating the three sphere coordinates consequently sends to , with interchanged. This proves the antipodal stereographic coordinate relation.
A nonidentity Möbius transformation has . For , its fixed points are the roots of , giving one or two distinct points. If and , there is one finite root and the fixed point infinity. If , , and , it is a translation and only infinity is fixed. The remaining case is the identity, already excluded. Thus the claim includes fixed points at infinity, not just finite solutions of the quadratic.
A nontrivial rotation of the sphere fixes exactly the two poles on its axis, which are antipodal. It therefore gives exactly two fixed stereographic points with . Here the nonzero rotation angle is understood modulo ; an angle that is a whole multiple of would be the identity.
Conversely, use a sphere rotation whose Möbius map sends the two antipodal fixed points to . The conjugate fixes both, hence equals for some . If , write ; the inverse stereographic formula shows that this rotates while leaving fixed. Conjugating back by the rotation gives a sphere rotation. If , for every finite . If , for every , in the sphere topology. Pulling these conclusions back proves the antipodal fixed-point classification of Möbius transformations: either the map is a sphere rotation or one fixed point attracts every point except the other fixed point.
For a homogeneous function, fix and differentiate at . The chain rule gives
Conversely, assume this derivative identity throughout . Along a positive ray define . The ray stays in by hypothesis, and linearity of the derivative gives
Therefore is constant on the connected interval and equals . Hence for every positive . This proves Euler differential identity characterizes homogeneity; no connectedness assumption on the whole domain is needed.
For a function holomorphic on and inside a positively oriented simple closed contour , the Cauchy integral formula gives
If an entire function is bounded by , apply the derivative formula on a radius- circle about any to obtain . Letting makes every derivative zero, so is constant. This proves Liouville theorem directly.
For the given meromorphic function, the growth bound excludes poles outside the bounding disc. Its poles inside are finite in number, since poles cannot accumulate at a finite point of a meromorphic function. Subtract all their finite principal parts:
The remainder is entire. The rational sum is at infinity. If , this makes ; the Cauchy estimates at zero give for , hence these derivatives vanish. Its Taylor series is a polynomial of degree at most . If , then at infinity, so it is bounded and equals zero by Liouville. In both cases, adding back the principal parts proves
This proof of polynomial growth forces a meromorphic function to be rational includes negative integers , not only the polynomial-growth case .
Write at the ordinary point zero. Substituting into the Legendre differential equation and comparing coefficients gives
The two arbitrary coefficients generate the even and odd series separately, convergent at least for . A nonzero polynomial of degree has top coefficient satisfying , so is necessary. For this value the recurrence in parity terminates at degree , while the other parity cannot terminate unless its initial coefficient is zero. Thus a polynomial solution exists and is unique up to scale, with .
For Orthogonality of Legendre polynomials, write the equation in self-adjoint form . Multiply it by , subtract the equation for multiplied by , and integrate. The boundary term is , because the functions are polynomials. For the eigenvalues differ, giving . For , the integral of the square is positive. Hence with .
Let . The supplied operator means , which equals . Expand in the given identity and use the Legendre equation. Each coefficient satisfies
whose solutions are . Regularity at removes . At , normalization and give , so . Thus
A rigorous justification for the expansion and operations is to begin with the Taylor series of in . It converges uniformly for , . Its coefficient is a degree- polynomial in , and the differential identity makes that coefficient solve the degree- Legendre equation. Its value at one is one, so it is exactly . This avoids assuming an unjustified endpoint convergence of an arbitrary orthogonal expansion.
Square the generating series and integrate, using uniform convergence and orthogonality:
Comparing coefficients proves the generating function and norm of Legendre polynomials result
For an axisymmetric potential, insert into the time-independent Schrödinger equation and divide by . The polar Laplacian separates the angular equation from
Single-valuedness under gives , with an angular eigenbasis . Linear combinations of the degenerate modes are also possible.
Inside the circular infinite quantum well, put . The equation becomes
The physical solution must be regular at the origin, behaving as for , or with finite value and zero radial derivative for . At the infinite wall impose . The printed question's boundary phrase uses capital ; it means the radial position , not a value imposed on the radial wavefunction. The singular Bessel function of the second kind is excluded; mere square-integrability of its logarithmic singularity would not put it in the ordinary finite-energy Hamiltonian domain.
For , multiply the equation by and insert . The coefficient of gives , and subsequent coefficients give
All odd coefficients vanish, , and . The regular solution is a multiple of the Bessel function of the first kind . Its requested fourth-order estimate is
Therefore the first positive zero of this truncation is , giving
The ground state is in the sector because nonzero angular modes add nonnegative centrifugal kinetic energy to the radial energy form. This quartic truncation of the Bessel function J0 is only a rough local-series estimate, not an exact eigenvalue or a certified variational bound; its double zero warns that the truncation does not reproduce the simple zero of the full function.
In vacuum without sources, Maxwell equations are , , and . For , , both divergences remain zero, and
This proves the quarter-turn electromagnetic duality transformation.
A perfect conductor has zero electric field in its bulk. Continuity of tangential electric field therefore gives at its surface. Faraday's law makes a nonzero-frequency magnetic field vanish in that bulk, and continuity of its normal component gives for the wave field. An independently trapped static magnetic flux is not excluded by perfect conductivity alone; the stated condition applies to the oscillating field under consideration.
For amplitudes with dependence , let and suppose . With and , define the transverse-magnetic family of scalar-potential conducting waveguide modes by
The electric divergence is ; the magnetic divergence is zero because the transverse field is a rotated gradient. Direct differentiation gives and , where longitudinal differentiation means multiplication by . Thus all vacuum equations hold, with .
On a wall parallel to , makes both and the boundary-tangential derivative of vanish. It also makes proportional to that tangential derivative, hence zero. This proves the Dirichlet boundary condition supplies both conductor conditions.
For a transverse-electric family, use duality and rescale the potential, or check directly that
satisfies the same equations. If is the cross-sectional wall tangent, then and . Consequently , a Neumann boundary condition, supplies both wall conditions. Duality exchanges the field constructions, but does not preserve electric-conductor boundary conditions without this new boundary test.
Differentiate the velocity potential in polar coordinates:
At the normal velocity is zero. At large radius these components tend to , the polar components of uniform flow in the positive direction. The circulation around any concentric circle is . Although the potential's circulation term is multivalued, its velocity is single-valued and irrotational away from the excluded axis.
For steady inviscid constant-density flow, Bernoulli equation gives . On the cylinder, , so
In the displayed force integral, every constant or term has zero cosine and sine first moments. The cross term in pressure is . Therefore, using exactly the positive-sign convention printed,
per unit axial length, since .
With the usual normal directed outward from the cylinder into the fluid, pressure exerts traction , so the physical force of the fluid on the cylinder is instead . The positive integral printed in the question has the opposite sign. This makes the convention explicit and is consistent with the Kutta–Joukowski theorem for positive counterclockwise circulation.
Split with , the negative unit subdiagonal and the positive unit superdiagonal. The Jacobi method uses , so
The Gauss-Seidel method uses , giving by forward substitution
Both iterations converge for every initial error exactly when their spectral radius is below one, since the error evolves as powers of the iteration matrix.
For Jacobi, the leading tridiagonal determinant recurrence is , with . Thus
Its roots are and . Expanding the Gauss-Seidel determinant gives
so its nonzero eigenvalues are . Therefore
The skew-tridiagonal Jacobi and Gauss-Seidel iterations consequently have the same convergence range:
Equality fails the every-start convergence condition, and larger magnitudes have unstable modes. The nonsymmetric matrix does not permit an unexamined positive-definite-matrix convergence argument.
Continue the simplex algorithm using dictionaries, with nonbasic variables zero at the current vertex. The given basis has payoff
Thus enters. Its positive row coefficients give ratios for and for ; the row does not restrict this increase. Therefore leaves. After that pivot,
Now enters. Only the row decreases along this move, and its ratio is , so leaves. The final dictionary is
All reduced payoff coefficients are nonpositive. Since the slacks must be nonnegative, , attained with . Hence . Direct substitution makes all three original constraints equalities. The final dictionary is the optimal tableau expressed with basic variables on the left, not just a proposed feasible vertex.
The dual linear program is
The negatives of the final slack payoff coefficients give . Its three dual constraints are equalities, and its objective is . Equality with the primal objective proves optimality by weak duality, independently of tableau sign conventions. It is also the complementary slackness certificate, with all primal variables and all dual variables strictly positive.
The dual constraints and objective coefficients on are unchanged, so remains dual feasible. Since every component of is positive, complementary slackness forces every constraint of any primal optimum paired with it to bind. Let be the original three-by-three constraint matrix and . It is invertible, and the only possible paired primal point is
If this point is nonnegative, it is primal feasible with zero slacks and , proving optimal. Conversely, if is optimal, linear programming duality supplies a paired primal optimum, and complementary slackness forces it to be exactly this point. This proves the strictly positive dual certificate and right-hand-side sensitivity criterion:
Non-strict inequalities are essential: boundary cases can be degenerate but retain the same optimal dual vector. This is the complete range, not just a small-perturbation sufficient condition for linear programming sensitivity within a fixed optimal basis.

Articles by others on the same topic (0)

There are currently no matching articles.