An inverse function of is a function satisfying both
These are two-sided inverse identities. If , apply to get , so is injective. For every , the identity supplies a preimage, so is surjective. Thus is a bijection.
Conversely, if is a bijection, each has exactly one preimage. Define to be that preimage. Then and , giving both identities. Hence a function has a two-sided inverse exactly when it is a bijection. This also makes its inverse function unique.
Always true. If , injectivity of gives , and injectivity of gives . Thus the function composition is injective. For any , since is surjective, choose with . Since is surjective, choose with . Then , proving that the composition is surjective. Consequently is a bijection; its inverse function is .
Can be false. Take and define
Then , so their function composition is the identity function and hence a bijection. However, is not surjective, since zero has no preimage, while is not injective, since .
The valid implications are only that must be injective and must be surjective: equality of two values implies equality after composition, and every output of the composition is an output of . On a finite , either of these properties implies a bijection, so an infinite set is essential to this counterexample.
An equivalence relation is a binary relation that is simultaneously a reflexive relation, a symmetric relation and a transitive relation: ; implies ; and , imply . The equivalence class of is
Each equivalence class is nonempty by reflexivity, and every belongs to , so the classes cover . If , then the symmetric relation and transitive relation properties give . Every therefore satisfies , so ; the reverse inclusion follows similarly. Thus two classes are either identical or disjoint. The distinct equivalence classes consequently form a set partition of .
The divisibility-comparability relation is a reflexive relation and a symmetric relation, but is not an equivalence relation. Indeed, and , whereas neither nor , so transitivity fails.
For the requested four-class construction, partition the positive integers into
Define exactly when they lie in the same . Equality of the class label is an equivalence relation. Its four classes are the two finite singletons and the two infinite parity classes displayed above.
In a short time , the radius vector sweeps an oriented area . Thus
The constant is twice the oriented areal velocity, or the angular momentum per unit mass. Its constancy is Kepler's second law: equal areas are swept in equal times.
For a circular orbit of radius , set in the radial equation. The balance is
Hence a circular orbit exists for any with this nonzero . Its period gives Kepler's third law:
To check circular-orbit stability for a power-law central force directly, keep fixed and set . Expanding
about the balanced radius gives
The linear radial perturbation therefore obeys
It remains bounded and oscillates, proving stability under the stipulated small perturbations. Equivalently, the specific effective potential has a strict minimum at .
Write the standard Lorentz transformation as , , with Lorentz factor and . In the null coordinates in two-dimensional Minkowski spacetime, addition and subtraction give
Since both factors are positive,
Their product is one, so Lorentz invariance of the interval follows immediately:
Two successive collinear Lorentz boosts multiply the positive-coordinate factor by and the negative-coordinate factor by its reciprocal. Thus they have the same form with a velocity determined by
Cross multiplication yields the relativistic velocity-addition formula formula
For , the denominator is positive and
so is admissible. The positive square roots then verify the factor identity itself, not merely its square. In terms of rapidity , this same calculation is addition of rapidities because .
The greatest common divisor is the largest positive integer dividing both and . To prove Bezout identity without assuming unique factorization, let be the least positive member of
This set has positive members, for example , so well-ordering principle supplies . Divide by using Euclidean division: , . The remainder is another integer linear combination of . Minimality forces , so . The same argument gives . Every common divisor divides every integer linear combination, hence divides . Therefore is the greatest common divisor, and
This argument also proves that every common divisor divides the greatest common divisor.
The positive integers with the stated product-divisibility property are
The case is immediate. If is prime and , its only possible common positive divisor with is one. By Bezout identity, . Multiplying by shows that implies . This proves Euclid lemma directly. Conversely, if is not prime, it has a divisor with . Put ; then . Although , neither nor is divisible by , disproving the property for a composite .
Finally, suppose for four distinct primes. Then , so Euclid lemma gives or . A prime has no positive divisor other than one and itself, so this would mean or , a contradiction. Products of these two disjoint pairs cannot be equal. No form of the fundamental theorem of arithmetic was used: the required prime-divisibility fact was proved from Bezout identity.
Yes. A concrete example of nonunique factorization in a congruence submonoid is
The four factors are distinct and each is congruent to one modulo ten. The primes can be checked by trial division by two and three. Their elementary prime decompositions are
For any one of these products , where are the indicated distinct primes, its positive divisors are . This divisor assertion does not require unique factorization: if and , then by the Euclid lemma proved in (a), so and is either one or . If , write and obtain , giving or .
None of is congruent to one modulo ten. Consequently no listed product has a proper nonunit divisor in . Thus each is an irreducible element of a commutative monoid, and the displayed equality proves the claim. Ordinary prime decompositions and irreducibility relative to the smaller commutative monoid are different notions.
Fermat's little theorem states that for a prime and an integer ,
Wilson theorem states that for a prime ,
All the following modular congruences are taken modulo the indicated prime.
Suppose . Then , so Fermat's little theorem gives . But makes odd, and hence
Since this is odd, , a contradiction. There is no square root of minus one in this case.
Set . Pairing each of with its negative residue gives
Here makes even. By Wilson theorem,
satisfies . Its negative is the other root. This proves existence by an explicit factorial construction.
Write . A solution has , so Fermat's little theorem gives
Thus . If is odd, then is odd and . The remaining prime case has and as well. Since itself always satisfies the equation, the unique solution is .
Factor the equation as
For the nontrivial roots, the quadratic formula over residues gives
The supplied square root is , and . Therefore
Indeed , so is divisible by , and . The other nontrivial root is ; it satisfies . Together with , these are the three cube roots of minus one. The complex-number hint reflects the same quadratic factor: the two roots there are .
Define the binomial coefficient to be the number of -element subsets of an -element set. Counting ordered selections and dividing by the orders of each subset gives
Every subset has exactly one size, while each of the elements can independently be included or omitted. Hence the power set has members and
To prove the binomial theorem, expand the product of factors . A term results from choosing from precisely an -element subset of the factors and choosing one elsewhere. Its coefficient is therefore . This is a finite distributive expansion, valid for every real , and gives
Differentiate this polynomial identity and set :
A second derivative gives for . Since , it follows that
The formula also holds for , when its value is one; that case can be checked directly without differentiating twice.
For the squared binomial coefficients, compare the coefficient of in . On the left it is , and the binomial coefficient symmetry gives . Thus
Finally put and replace the index by . The same symmetry gives . Adding the two expressions and using the preceding identity yields
For any function , form the diagonal subset
If were surjective, some would satisfy . Then would hold exactly when , which is impossible. Thus no set surjects onto its power set, including the empty-set case. This is Cantor's theorem proved by the Cantor diagonal argument.
Use real-number pairing by separated digits for an explicit injection . First map a real number to by , and use its unique binary expansion that is not eventually all ones. If and , define
This places the two binary digit strings in alternating ternary positions. Such ternary strings, using only digits zero and one, are unique: at a first differing position , the difference exceeds the maximum tail . Thus the output recovers both digit strings and both inputs. The use of base three avoids any endpoint ambiguity caused by interleaving digits in base two.
For a fixed , the affine sections of a planar set are indexed by
There is an injection , for example by applying to each coordinate pair and then once more to those two results. Suppose every subset of were a section of . Define a function from to by assigning to the corresponding section, and assigning the empty set to every real outside . Injectivity of makes this definition unambiguous. It would be a surjection onto , contradicting the first argument. No planar set has every subset of the real line as a section. Allowing different parametrizations of the same line does not evade this obstruction.
For all countable sets, however, such a planar set does exist. To build one, first encode every real sequence by one real number. Let be the canonical binary digits of , and choose the explicit indexing
This is a bijection from positive integer pairs to positive integers. Define the coding of real sequences by ternary digits
The same first-differing-digit argument proves that is injective; all its values lie in . Now take
For every nonempty countable set , choose an enumeration of , repeating terms if is finite. On the vertical line with and , the section of is precisely : injective sequence coding means no other sequence can contribute extra values in this column. The empty set is the section on the line , since all code columns have first coordinate at most . This constructs the required universal planar set for countable real sections. No assertion about its other, nonvertical sections is needed.
Take the scalar product of Newton's second law with the velocity . The cross product is perpendicular to its first factor, so
Consequently
This is conservation of energy: the sum of kinetic energy and potential energy stays fixed. The magnetic-type Lorentz force does no work, because it is perpendicular to the instantaneous velocity. It may turn the trajectory but cannot directly change its speed, regardless of the spatial variation of .
For , the radial gradient gives
The force is radial and has no torque about the origin. For the remaining force, use the vector triple product:
Meanwhile the radial unit vector obeys
Since , these derivatives cancel. Thus the generalized angular momentum in a radial monopole field is
The argument applies away from , where the field is defined, for any radial . In contrast to ordinary angular momentum, this conserved vector has ; it fixes a cone rather than generally fixing a plane.
With , the angular momentum becomes and is constant. The identity confines the trajectory to the plane through the origin perpendicular to when . If , the velocity is radial and a central force preserves the radial line; this degenerate motion is also planar.
For the proposed Laplace-Runge-Lenz vector convention, differentiate . Since and is constant, the vector triple product gives
Therefore
It vanishes for general motion precisely when , giving
This is an inverse-square potential, attractive when and repulsive when ; is the free-particle case. An additive constant in leaves the force unchanged but would change this particular by a constant multiple of , so its definition requires the displayed choice of energy zero.
Apply the rotating-frame derivative formula first to position and then to its inertial velocity:
The angular velocity is constant, so there is no term involving . By Newton's second law in the inertial frame, the inertial acceleration is . Rearrangement gives the equation of motion in a rotating frame:
The two additional accelerations are the Coriolis acceleration and centrifugal acceleration.
At , use the local right-handed basis pointing east, north and vertically outward. The Earth's rotation vector has components
Initially in the rotating reference frame, so the Coriolis acceleration is zero. Evaluating the centrifugal acceleration gives
The gravitational acceleration is . Hence
The small angle from the downward vertical therefore satisfies
For the northern hemisphere, , this is the printed expression without absolute values. More generally, the printed signed meridional expression specifies the direction of the tilt; an unsigned angle uses its absolute value. The horizontal component is toward the equator and vanishes at both poles and at the equator.
Neglect the centrifugal acceleration, which is of order , and use the local flat-surface approximation. To zeroth order in , the height above and flight time are
Inserting this vertical velocity into the Coriolis acceleration gives the eastward component
With , two integrations yield
to first order. Horizontal velocity is already of order , so its effect on vertical acceleration is of order . Thus the flight time remains at this order. The Coriolis deflection of a vertical projectile at landing is
The displacement is westward, and its magnitude is . The horizontal speed remains westward during the flight: . This explains why the eastward acceleration on descent does not cancel the earlier displacement.
Let be the gas mass ejected in a short interval, and let be the stationary dust mass acquired. The rocket mass change is . Before the interval the momentum of the rocket and this dust is , because the incoming dust is at rest. Afterwards it is
to first order; changing the gas ejection speed by affects only second-order terms. Momentum conservation, with no external force, therefore gives
Dividing by the time interval produces the rocket equation with stationary mass accretion:
The incoming material's zero initial momentum is essential: accelerating it to the rocket's speed consumes part of the thrust.
Without dust collection, . The rocket equation reduces to
Integrating from , gives
This is the usual rocket equation with constant relative exhaust speed, valid while the mass remains positive and the prescribed ejection continues.
Now and , so
For , set . Then and . For , integration gives
Consequently
This solution of the rocket equation with stationary mass accretion covers increasing or decreasing rocket mass, as long as . For equal-rate rocket burning and accretion, in the case , the mass is constant and the linear equation instead gives
It is also the continuous equal-rate limit of the preceding expression when written in terms of .
For the no-accretion limit, expand the power as an exponential:
Substitution gives
recovering (a). At a fixed time with , the limiting mass is , so the same calculation recovers the time-dependent no-dust solution.
The relativistic energy of a particle of rest mass is , where the Lorentz factor is . Using the binomial series at small gives
The second term is the familiar Newtonian kinetic energy. The first is the rest energy, which remains when . Thus the new physical idea is mass-energy equivalence: a body's mass represents energy even at rest. The total energy is not merely energy due to motion.
The incident four-momentum has energy and spatial momentum , while the stationary target has energy and zero spatial momentum. By the relativistic energy-momentum relation, . For the fixed-target threshold for production of equal-mass particles, the squared total centre-of-momentum energy is
In the centre-of-momentum frame, each of the final particles has energy at least its rest energy . Four-momentum conservation therefore requires , and thus
For the physically relevant , this is equivalent to . The speed is an increasing function of , so
Consequently
Equality is the kinematic threshold at which all final particles are at rest in their common centre-of-momentum frame. It shows why a collision with a stationary target needs more incident energy than merely the additional rest energy: some laboratory energy must remain as collective motion. A one-particle final state of the specified mass, with no other outgoing energy, is impossible because its invariant energy would be , whereas the two-particle initial state has invariant energy at least .

Articles by others on the same topic (0)

There are currently no matching articles.