Let be a permutation of the finite set. Starting from , repeatedly apply . Some iterate repeats; because is invertible, the first repeat closes the sequence at . More explicitly, if with , applying gives . If is the least positive return time, the elements are distinct and form one permutation cycle. If the set is not exhausted, start again at an unused element. Two such sets cannot overlap: an overlap lets an inverse iterate express either starting point as an iterate of the other, making the sets identical. Thus this process partitions the set into disjoint permutation cycles. On each part its cycle acts exactly as and the other cycles fix the elements. Their product therefore equals . This proves existence of the cycle decomposition of a permutation, including one-cycles for fixed points.
Use the composition convention that the rightmost permutation acts first. For the specified product, the images are
Hence
The order of a group element here is the least positive exponent making every cycle return to the identity. It must be divisible by each cycle length, and any common multiple does make every cycle return. The least common multiple of is six.
A group isomorphism is a bijection satisfying for all . It sends the identity to the identity and satisfies . Applying its inverse shows that it preserves the order of a group element exactly.
The cyclic group has an element of order eight. Every element of the direct product of groups has fourth power equal to the identity, and a generator of the first factor paired with the identity of the second has order four. Every nonidentity element of has order two. Thus their maximum element orders are respectively , which an isomorphism would preserve. The three groups are pairwise nonisomorphic.
For a fourth example take the dihedral group of symmetries of a square. It consists of four rotations and four reflections, so has order eight. With a quarter-turn and a reflection, , showing . This group is nonabelian, whereas all three displayed direct products of groups are abelian groups. Since a group isomorphism preserves commutativity, the square's dihedral group is isomorphic to none of them. Its order is eight regardless of whether a notation convention calls it or .
For a regular differentiable curve , its speed is , where is arc length. The oriented unit tangent vector is . The curvature of a space curve is . Equivalently, for a twice differentiable regular curve,
For the helix, differentiation gives and speed . Consequently
Indeed has magnitude , and division by gives the result. This requires ; the excluded constant curve has no well-defined unit tangent vector. For the curve is a straight line with zero curvature of a space curve.
Write the surface as the level set . The gradient is normal to a regular level surface because differentiating along any surface curve gives for its tangent vector. At the specified point,
Thus a normal vector and a unit normal are and , respectively. The tangent-plane displacement is perpendicular to that normal, giving
Reversing the normal's sign gives the same plane.
Use suffix notation, with repeated indices summed from one to three. The cross product, divergence, and curl have components , , and . Here is the Levi-Civita symbol.
The product rule gives
Using the cyclic identity in the first term and in the second identifies these terms as and . Therefore
For the second identity, contract two Levi-Civita symbols, using :
The four component expressions translate into
Both derivations require only continuously differentiable vector fields; no additional divergence-free assumptions are used.
The order of a group element is the least positive integer with , or infinity if none exists. In a finite group, some two powers among coincide; cancellation then gives a positive power equal to , so exists. The generated cyclic group consists of the distinct elements and has size .
We now prove the needed divisibility directly by cosets. Multiplication by bijects with the left coset , so every left coset has elements. If and intersect, write with . Then , which implies . Thus distinct left cosets are disjoint, and every element of belongs to its own left coset. The finite set is partitioned into, say, such cosets. Hence and
This supplies the counting argument underlying Lagrange's theorem, rather than appealing to it or to an unproved orbit formula.
A divisor of need not occur as an element order. Use , of order eight, and . Every element has square equal to the identity, so there is no element of order four. Thus the proposed converse is false, even for an abelian group.
For the direct product of groups , let generate the factors. The least for which is the least common multiple of . If are coprime, this is , the size of the whole product, so generates every element. Conversely, for any pair its order is and divides . If , that bound is , so no element can generate the product. Therefore
This is the cyclicity of a product of two finite cyclic groups; the general pair-order criterion is the order of a direct-product element.
A subgroup is a normal subgroup of if for every , equivalently if for every . In the symmetric group , the subgroup is normal: conjugation relabels a three-cycle as a three-cycle, so preserves this set. By contrast, is not normal because conjugating by gives outside the subgroup.
If is normal, define a product on its left cosets by . To check that this quotient group operation is well-defined, take different representatives and , with . Their product is
Normality puts the last two factors in , so its coset is exactly . Associativity follows from that in , the identity coset is , and the inverse of is . Thus all the group axioms hold, and the projection is a group homomorphism.
Always true. Suppose . If is nontrivial, let be the least positive integer with . For any , divide with . Since , minimality forces . Hence is a cyclic group. The trivial subgroup is cyclic as well. Every coset in is , so the quotient group is generated by . This proves the subgroups and quotients of a cyclic group assertion.
Can be false. Take the Klein four-group and . It is a normal subgroup because is an abelian group. Both and have order two and are cyclic groups. But every nonidentity element of has order two, so none generates its four elements. Thus is not cyclic.
Always true. Elements of a subgroup commute when they are elements of an abelian group , so is abelian. In the quotient group, . Therefore is abelian too.
Can be false. Use and the normal subgroup from the root solution. The subgroup is cyclic of order three, hence an abelian group, and the quotient group has the two cosets and , so is cyclic of order two and abelian. Yet whereas , proving that is not abelian. An abelian kernel and an abelian quotient do not force all elements of the original group to commute.
Allow an eigenvector to have complex entries, since real matrices can initially have complex eigenvalues. Write for its conjugate transpose. Reality of gives ; symmetry then gives . Thus is a Hermitian matrix. The scalar equals its complex conjugate, because . If , then
since . This proves that all eigenvalues are real. The equality is precisely where reality was used; a complex symmetric matrix need not be Hermitian, as illustrates.
If and , then , but also . Consequently . Distinct eigenvalues force . For real eigenvectors this is ordinary Euclidean orthogonality. These arguments establish real symmetric spectral orthogonality without assuming a diagonalization in advance.
A real orthogonal matrix satisfies , equivalently . If is symmetric,
so orthogonal similarity preserves symmetry. An arbitrary real invertible change of basis need not do so. For example,
The final matrix is not symmetric. Orthogonal similarity preserves real symmetry; general similarity does not.
Take
Its characteristic polynomial is , whose roots are and . Thus this real matrix has no real eigenvalues.
Take the Jordan block
Its only eigenvalue is one. An eigenvector satisfies , so its second coordinate vanishes; the eigenspace is one-dimensional. A diagonalizable matrix of size two requires a basis of two independent eigenvectors, which this matrix lacks even over .
Use
It has independent complex eigenvectors and , with eigenvalues and . Taking these as columns gives an invertible complex matrix with , so is a diagonalizable matrix over . It cannot be diagonalized over , since a real diagonal matrix would have real eigenvalues, whereas similarity preserves the characteristic polynomial.
Take
The real eigenvalues are one and two, with eigenlines spanned by and respectively. These independent vectors form a real eigenbasis, so is a diagonalizable matrix over . Their inner product is one, and any two nonzero vectors on those eigenlines have nonzero inner product. Rescaling can normalize their lengths but cannot make them orthogonal. Hence no orthonormal eigenbasis exists.
Work on the Riemann sphere, including zero and infinity. For , two iterations give the identity and one does not, so . For , direct composition gives
Neither nor is the identity; in particular . Thus
To prove the Möbius conjugacy normal forms, write a Möbius transformation as with . A finite fixed point satisfies . If , this quadratic has two roots counting multiplicity, and infinity is not fixed. If , the transformation is affine, infinity is fixed, and there is one further finite fixed point unless its slope is one. A nonidentity slope-one affine map is a nonzero translation with only infinity fixed. Thus any nonidentity Möbius transformation has one or two distinct fixed points.
If there are two, say , choose a Möbius transformation taking them to zero and infinity. For finite one can use ; the cases involving infinity use an affine map or reciprocal. The conjugate fixes zero and infinity. Fixing infinity sets its denominator's linear coefficient to zero, and fixing zero sets its numerator's constant term to zero; hence it is with .
If there is only one fixed point, send it to infinity. The conjugate has the affine form . If , would be another fixed point, which is impossible; therefore . Conjugating this translation by yields . The identity is already the scaling . This proves the classification, and invertibility excludes .
Conjugation carries fixed-point sets bijectively. The translation has exactly one fixed point, infinity. A nonidentity scaling has the two fixed points zero and infinity, while the identity fixes every point. Therefore is not conjugate to any scaling.
Finally let have finite positive order . A nonzero translation has infinite order, since its th iterate is after normalization. Thus is conjugate to , where has multiplicative order exactly . For , zero and infinity each form a singleton orbit. At a finite nonzero , an iterate returns precisely when , equivalently ; the least positive return time is . Conjugacy preserves orbit sizes. Hence the finite-order Möbius orbit sizes are
For exactly two points have size-one orbits; every other point has orbit size .
A conservative vector field is the gradient of a single-valued differentiable scalar potential. Its line integral is path independent and equals the potential difference. If with a twice continuously differentiable potential, equality of mixed partial derivatives gives
The product rule then gives . Rearranging proves the integrating-factor equation for a planar vector field:
This argument does not require division by , so it remains valid even at its zeros. A nonvanishing integrating factor is normally sought when one wants to recover useful potential curves for the original field.
Assume are continuously differentiable on a neighbourhood of a bounded region with a positively oriented piecewise smooth simple boundary. To prove Green theorem, first take a region between the graphs and , , with . Counterclockwise orientation traverses the lower graph to the right and the upper graph to the left; vertical end pieces contribute nothing to . Thus the fundamental theorem of calculus gives
Likewise, for a region between graphs and , the right boundary is traversed upwards and the left one downwards. Horizontal end pieces contribute nothing to , so
For a polygonal region, triangulate its interior. Each triangle is of both graph types with piecewise linear bounds, so adding the formulae gives the result: the double integrals add and the integrals on internal edges cancel because the adjacent triangles traverse them in opposite directions. For a regular piecewise smooth simple boundary, choose inscribed simple polygonal approximations to its piecewise smooth parametrization. Their line integrals converge to the original line integral, since the parametrizations converge uniformly and their piecewise constant tangent vectors converge in the integral norm on each smooth arc. Their regions converge in area: the symmetric difference lies in a shrinking neighbourhood of the original boundary, which has planar measure zero. Boundedness of the continuous integrand then gives convergence of the area integrals. Passing to the limit proves the formula for the stated boundary class. Combining the two identities gives
Positive orientation is essential for the sign.
Choose and , for which . The boundary formula for planar area is
For the ellipse, take so the given increasing-angle parametrization is counterclockwise. Then and , so
If signed nonzero parameters are allowed, the unsigned area is , with orientation corrected accordingly.
The divergence of a cross product identity and the stated static field equations give
For an outward-oriented closed surface, the divergence theorem therefore gives the flux of the specified Poynting vector normalization:
No open-surface conclusion follows from this equation without including its closing pieces.
For the particular fields, direct calculation gives
The fields also have , , and , consistently with the required equations. Close the outward spherical patch by the two planar half-disks on and , forming the quarter unit ball . Its total closed flux is
where in this integral is cylindrical radius. The face has outward normal and zero flux because there. The face has outward normal , so its flux is
Subtracting these planar contributions from the closed flux gives the requested open-patch answer
As a direct check, on the unit sphere the outward normal is and . With spherical angles , , its surface integral is . The curved patch's vanishing flux is a cancellation, not an inference that its flux density vanishes everywhere.
For a real-valued function on a bounded regular region, apply the divergence theorem to . The product rule yields . The prescribed zero boundary values and Laplace equation therefore imply
The continuous nonnegative integrand must vanish everywhere. Hence is constant on each connected component, and its boundary value makes each constant zero. This proves zero-boundary harmonic uniqueness. If complex-valued functions are allowed, apply the same argument separately to their real and imaginary parts. If solve the same Poisson equation and Dirichlet boundary data, their difference is harmonic with zero boundary value, so is zero. Thus there is at most one solution. An exterior unbounded region would require an additional condition at infinity; the preceding bounded-domain proof does not assert uniqueness without one.
For the radial calculation use Cartesian coordinates with . The chain rule gives and
Differentiate again and sum the three coordinates:
This derives the radial Laplacian directly in Cartesian coordinates. For , set , so . Integrating twice gives , and consequently
If the solution must extend boundedly through the origin, . The remaining polynomial is smooth there.
The radial Laplace equation has solution . Boundedness at the origin requires , and the value at fixes . Thus
The radial Poisson equation with constant source one has . The boundary conditions give
Subtracting gives , then . Hence
Its radial Laplacian is one and both endpoint values are one. The prescribed values ensure continuity with the adjacent region solutions, but do not impose derivative continuity.
The exterior radial Laplace equation has . Decay at infinity forces and the value at forces . Therefore
Together the three solutions satisfy their separate regional equations and specified boundary values. Their radial derivatives jump at the interfaces, so they should not be asserted to solve one globally smooth Poisson equation with only the listed volume sources and no interface terms.
For a Cartesian second-rank tensor, write
The first term is a symmetric second-rank tensor and the second is an antisymmetric second-rank tensor. Taking the trace of the symmetric term and subtracting it gives the scalar, symmetric-traceless and axial tensor decomposition:
Here and . To check reconstruction of the antisymmetric part, contract the Levi-Civita symbols:
Thus , and the displayed contractions also prove uniqueness. The vector associated with the antisymmetric part is an axial vector under reflections, and an ordinary vector under proper rotations.
For the specified isotropic tensor law, contract the Kronecker deltas first:
Write , where and is symmetric and traceless. Transposition preserves its scalar and symmetric-traceless parts and reverses its antisymmetric part. Therefore
Uniqueness of the decomposition gives the isotropic elasticity on tensor components relations. Provided their respective coefficients are nonzero, the requested inverses are
If one coefficient vanishes, that strain component has zero stress response: the corresponding stress component must be zero for a solution to exist, and that strain component is not uniquely recoverable. Isotropy by itself does not guarantee invertibility.
If is symmetric then , hence and the stress is symmetric. Equivalently, direct transposition gives . Restricting to this symmetric-strain case gives
This final two-parameter expression uses the symmetry assumption from the preceding request. For a general nonsymmetric array, the transpose term cannot be absorbed into the same coefficient: it acts with on the symmetric-traceless part and with on the antisymmetric part. The stated coefficient is the coefficient of itself; if one instead writes the conventional elastic law with multiplying the strain, that shear-modulus convention is half this coefficient.

Articles by others on the same topic (0)

There are currently no matching articles.