If the three vectors lie in one plane through the origin and are independent, their cross product is a normal vector to that plane, so its dot product with is zero. If are dependent, their cross product is already zero. Thus coplanarity always forces the scalar triple product to vanish.
Taking the contrapositive proves that a nonzero scalar triple product rules out coplanarity. Geometrically its absolute value is the nonzero volume of the spanned parallelepiped.
The difference quotient at zero is
If , its absolute value is at most , so is differentiable at zero with derivative .
To exclude , use and . The difference quotient equals along the first sequence, and along the second. For the first value is , while for it is unbounded. Hence a common finite limit is impossible. Therefore
The required range is
Near , the ratio tends to , so it causes no convergence problem. Near , one useful identity is
For , this bounds its absolute value by , which is integrable on . It also supplies the domination used in part (i).
For , the integrand is negative and behaves as near zero; its improper integral diverges. For its negative singularity is even stronger, and comparison with that same divergent integral again rules out convergence. Thus the original finite real-valued definition of has precisely the stated domain.
Integrating first over multiplies by . Split at to handle the absolute value correctly:
Integration by parts gives antiderivatives and for these two inner integrands. Their contributions are
respectively. Thus
For the remaining integrals,
and
Combining them yields
The upper bound is , as in the original PDF; an additional truncated version in the OCR must not be used.
Here , so the absolute value equals . The volume integral, evaluated in Cartesian coordinates, is
The integrand is constant with respect to , giving
The difference quotient at zero is
For , its absolute value is at most . Given , set . Then makes the difference quotient have absolute value below . Thus .
Conversely, along the second sequence the difference quotient is exactly zero. Any finite derivative would consequently have to be zero. Along the first positive sequence, however, the difference quotient equals . It is one for and tends to for . In both cases it stays outside the neighbourhood of zero for arbitrarily small positive increments. Thus no finite derivative exists. We obtain
In particular, gives continuity without differentiability.
For , the triangle inequality gives
Taking the supremum proves . Hence convergence for implies convergence for .
The converse is false. For , take and . Its supremum norm is , whereas the binomial theorem gives
The alternating coefficients cancel on ; the polynomial coefficient sum norm measures their absolute values before any cancellation.
Extend the coefficient lists of each polynomial by zeros. Then is finite because only finitely many terms are nonzero. It is nonnegative and symmetric. Moreover, holds exactly when every coefficient agrees, which by uniqueness of polynomial coefficients is equivalent to .
If , the triangle inequality for the absolute value gives
Thus satisfies all the metric axioms. It is the metric induced by the polynomial coefficient sum norm.
First verify that is a vector space. Sums and scalar multiples preserve continuity and the condition at zero. For every partition of an interval , the triangle inequality and absolute homogeneity of a norm of the absolute value imply
Taking suprema yields
For the second equality follows directly from . In particular, finite variation is preserved, so is closed under these operations.
Nonnegativity is immediate. For any , use the partition of an interval , omitting repeated endpoints if necessary, to get
Thus forces , and conversely has zero total variation of a function. These observations prove that is a norm on .
Applying the same bound to gives
Therefore convergence in the anchored variation norm implies uniform convergence on . The anchoring condition removes the nonzero constant functions which otherwise have zero total variation of a function.
For , integrate
along the contour consisting of and the upper semicircle, with positive orientation of a contour and . Its enclosed simple poles are and , with residues
On the upper semicircle, . The reverse triangle inequality gives and , so the estimation lemma gives
The integral along the real axis is absolutely convergent: the denominator stays nonzero on bounded real intervals, and the integrand is at infinity. The residue theorem therefore gives
Take real parts. The real integrand is an even function, so
To include , fix and let . For , the absolute value of the integrand is bounded by
an integrable function on . The dominated convergence theorem justifies passing the limit under the integral. If , then , and
Hence
For the real logistic map, factors as
There is always the fixed point . If there is also , distinct from zero unless . At the map is constant and zero is its only fixed point. Negative must be retained because the paper specifies .
Since , the fixed-point multipliers are
The fixed point stability for an iteration criterion gives attracting for , and attracting for . The respective fixed points are repelling when and . At the unit-modulus boundaries the linear criterion needs a nonlinear supplement.
At , the two fixed point branches meet and exchange stability: this is a transcritical bifurcation. Explicitly, with ,
which has the required nonzero parameter and quadratic terms. At the critical value itself, attracts small positive points and pushes negative points away, so the merged fixed point is not stable from both sides.
At the origin’s fixed-point multiplier crosses , while at the nonzero fixed-point multiplier crosses . Both are period-doubling bifurcations. To check existence and stability of the new periodic orbit, factor the second iteration of a map:
The two non-fixed roots are
They form a real period-two orbit for or . Its periodic-orbit multiplier is
It is less than one in absolute value just below and just above , respectively. Thus these are supercritical bifurcations in the direction where the parent fixed point loses stability. At the critical values the fixed points themselves are weakly attracting: at , ; at , setting gives after two steps. Both shrink sufficiently small nonzero absolute values. The bifurcation values for finite fixed points are therefore
The disappearance of the formula for at corresponds to that branch going to infinity, not a local bifurcation at a finite fixed point.
At leading order in QED, the electron exchanges one spacelike virtual photon with a charged parton inside the proton.
The two Feynman vertices contribute and , while the photon propagator contributes . Hence the scattering amplitude scales as and its squared absolute value as . Since the fine-structure constant is , the electromagnetic coupling dependence is . The numerical in the stated differential scattering cross-section additionally uses the flux, Lorentz-invariant phase space, azimuthal integration and the convention defining the deep-inelastic structure function; it cannot be deduced from the propagator alone.
For each measured bin form the reduced quantity
Plot this against at several fixed values, normally using a logarithmic axis. Bjorken scaling predicts an approximately horizontal curve at each , or equivalently collapse of different- data onto one curve. Raw cross sections do not collapse because their explicit kinematic factors vary. QCD predicts logarithmic scaling violations, so exact independence is only the ideal parton model limit. The stated extraction also assumes negligible longitudinal deep-inelastic structure function, as in the leading massless spin-half parton approximation.
Starting with the electron neutrino state in a, the survival probability amplitude is
Taking its squared absolute value gives
This derives the supplied survival probability from the evolution operator rather than from a Hamiltonian entry. It also shows why the two written forms agree. For the stipulated phase and , , so at ,
The phase decreases monotonically from to over the open interval . Differentiating gives . The interior maxima occur at and the interior minima at . Enumerating those phases gives
The minimum just above must not be lost by rounding the lower endpoint. Neither excluded endpoint is an additional extremum.
Figure 1.
Reactor survival extrema and the unresolved solar vacuum-oscillation envelope
. Details.
For solar neutrinos propagating in the same vacuum model, the vastly longer baseline makes the oscillations extremely fine in energy, with the same bounds and . The figure uses a deliberately schematic enlargement of the oscillation spacing to show those bounds. A detector energy resolution averages very many periods, so and
The detector averages event rates weighted by source spectrum, interaction cross section and response; the displayed constant follows when these vary slowly across each tiny oscillation period. Reactor production physically gives electron antineutrinos. In this two-flavor vacuum approximation their survival probability is identical; the positive matter-potential discussion in d concerns solar neutrinos.
Let be the angle between the coil's area normal and the magnetic field. Its magnetic flux linkage is . Consequently Faraday's law of induction gives
The sign refers to the winding orientation used to define the normal. The initial phase depends on the chosen time origin; one can set it to zero when the normal first points along . The minimum absolute value is zero, attained at : the coil's normal is parallel or antiparallel to the -axis, and the plane of the coil is perpendicular to that axis. At this orientation the magnetic flux is extremal and its derivative with respect to time vanishes.
Since , the previous part and closure under addition prove measurability of the absolute value.
The converse fails. Choose a nonmeasurable subset of and define on , on its complement. Then is measurable, whereas is not. Thus measurability of does not imply measurability of .
For integers not both zero, replace them first by their absolute values, then repeat integer division:
while b != 0:
    (a,b) := (b, a mod b)
return a
This is the Euclidean algorithm. Its loop invariant is that equals the original greatest common divisor. When , the new remainder lies in , so is a strictly decreasing nonnegative loop variant. At termination, , proving correctness, including the case where one original input is zero.