For a countable set , the polynomials of polynomial degree at most with coefficients in are described by coefficient tuples in . The finite Cartesian power of a countable set result makes this a countable set. Taking the union over shows there are only countably many such polynomials altogether; restricting to the nonzero polynomials preserves countability.
A nonzero polynomial of polynomial degree has at most distinct roots of a polynomial. To see the bound, a root gives the factorization by the factor theorem, and each other root is a root of , whose degree is ; induction starts with a nonzero constant, which has no roots. Thus is a countable union of countable sets, each of them finite, and is a countable set.
Starting with the given countable set , mathematical induction now shows that every is countable. A final application of the countable union of countable sets theorem gives
This countability argument does not require that the sequence of sets be increasing.
A set is countable if it admits an injection into the natural numbers; this includes finite sets and the empty set. Use for the enumeration. The Cantor pairing function
is a bijection . Indeed, on the diagonal , its values are the consecutive integers from through . These intervals are disjoint, and the next starts one beyond the preceding endpoint. Every nonnegative integer therefore determines exactly one diagonal , then exactly one , and finally . If one's convention starts the natural numbers at one, translate both coordinates by one. Thus is a countable set.
For countable sets , choose injections and . The map is an injection, proving their Cartesian product is countable. Repeating this proves that every finite Cartesian power of a countable set is countable.
For a sequence of countable sets , choose an injection for each . For , let be the least index containing . The map
is an injection: its value recovers and then . This proves the countable union of countable sets theorem. Selecting all uses the usual axiom of countable choice; if enumerations are already supplied, the construction itself needs no additional choices.
For positive integers, , establishing reflexivity. If , then , establishing symmetry. If also , then , establishing transitivity. Hence this is an equivalence relation.
Every positive integer can be written uniquely as , where is an integer and is an odd positive integer, its odd part of a positive integer. Existence follows by repeatedly dividing by two while the result is even; the process terminates because the positive integers strictly decrease. For uniqueness, with odd would make one of even if ; therefore and .
Multiplying by a power of two preserves the odd part of a positive integer, and two positive integers with the same odd part have ratio a power of two. The equivalence class indexed by odd is consequently . The required representative set is .
The equivalence class of is . By the reflexivity of the equivalence relation, , so every equivalence class is nonempty and their union is .
Suppose , and choose in this intersection. We have and . Symmetry and transitivity give . If , then , so ; interchanging proves the reverse inclusion. Thus two equivalence classes are either identical or disjoint. The distinct equivalence classes therefore form a set partition of . This also covers , whose family of equivalence classes is empty.
True. For each , the definition of preimage gives
Thus . Unlike the corresponding statement for images of a function, this intersection identity requires no injectivity.
False. Take , and the constant function . For the subsets and , the intersection is empty, so , whereas the intersection of their images of a function is . In general the inclusion holds, but a common image value can arise from different points of and .
True. The function composition is an injection: first implies by the injectivity of , then by the injectivity of . Fix one , using the given nonemptiness, and define
The first case is well defined because is an injection. For every , . Thus this left inverse satisfies , the identity function on .
False. Take and , with and . Then is an injection and is a surjection, but the function composition has image of a function , so it is not a surjection onto .
Use , , and . By the rotating-frame derivative formula, . Apply the product rule for the cross product and the same rotating-frame derivative formula again:
We have and , since . Therefore
Rearranging this identity into an equation of motion in a rotating frame produces the apparent Coriolis acceleration, Euler acceleration and centrifugal acceleration, with signs opposite to their corresponding terms on the right of this inertial acceleration identity. No translational term is needed because the two origins coincide.
Let be an orthonormal basis fixed in the rotating reference frame . A small rotation through changes each basis vector by , so its derivative in the inertial frame is
Write the arbitrary vector as . Differentiating the components and the moving basis separately gives
This proves the rotating-frame derivative formula, including when the angular velocity varies with time.
Choose the gravitational potential energy to vanish at infinity. The total mechanical energy is
Put and . From part (i), and . Consequently
and the angular terms cancel against the gravitational potential energy:
For a nonradial Kepler orbit, negative, zero and positive mechanical energy correspond respectively to , and .
Multiplying the tangential equation of motion by gives
Therefore is constant. It is the signed specific angular momentum; reverse the angular orientation if necessary to take for a nonradial orbit. Set and denote differentiation with respect to by a prime. Then
Substitution into the radial equation of motion and division by give the Binet equation
Its general solution is . Write and , where . This produces the Kepler orbit
Here is the orbital eccentricity, and points toward periapsis when . Only portions with describe positive radial distances. The expression assumes ; a zero-angular momentum trajectory is radial and must be treated separately.
The derivative matrix
is symmetric in . Contracting it with the antisymmetric Levi-Civita symbol gives the curl
Direct differentiation of the scalar potential gives
so . To identify the level sets, use the cross product identity
If , write relative to its direction. Then . Thus each negative level is a circular cylinder with axis and radius . The zero level is the axis itself; positive levels are empty. If , the scalar potential is identically zero, so its zero level is all of space and every other level is empty.
The vector triple product removes the nested cross products:
Since is constant, the divergence is
The cube has volume . With the outward unit normal, the divergence theorem therefore gives
The assertion is true over the complex numbers. It suffices to generate every nonzero scaling using translations and , since these together with scalings already generate the Möbius group.
For , compose the maps rightmost first. Away from the intermediate poles, the successive values are
Hence
For every , choose a complex square root with . This gives and proves Möbius scaling generated by translations and reciprocal inversion. Equality of the rational maps extends the identity to all points of the Riemann sphere, including the intermediate exceptional values.
The assertion is false. Let and . Their relations are
Moving each inversion to the right reduces every word to with or . Thus the subgroup generated by complex scalings and reciprocal inversion consists only of and . Of these, only the first form fixes zero.
The Möbius transformation
fixes zero but is not a scaling: it sends infinity to instead of infinity. It therefore cannot belong to the subgroup generated by scalings and reciprocal inversion.
The assertion is true. A Möbius map fixes infinity if and only if : if , its value there is the finite number . For , the decomposition above uses only a nonzero complex scaling and a translation. These maps form the Affine subgroup of the Möbius group.
Assume for a group homomorphism . For and ,
Thus . Apply the same inclusion with to obtain the reverse inclusion, giving . Hence every kernel is a normal subgroup, proving the reverse implication and the required equivalence.
Assume is a normal subgroup. Take the quotient group and the natural projection . The well-defined multiplication constructed above gives , so this is a group homomorphism. Its identity is the coset , and exactly when . Therefore
which proves the implication from normality to being the kernel of a group homomorphism.
Divide the velocity by the speed calculated above. The unit tangent vector is
Its derivative is
Because , the principal normal vector has the direction of , giving
This is a unit vector, and for every real . The curvature of a space curve is , so the principal normal vector is defined everywhere on this curve. The same perpendicularity follows from constant tangent component forces perpendicular principal normals: is constant, and differentiating this identity forces the normal component along to vanish.

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