For a partition , write and for the upper Darboux sum and lower Darboux sum. The Riemann integrability criterion for bounded is that for every some partition satisfies . Thus if the gaps for tend to zero, the Riemann integrability criterion immediately proves that is Riemann integrable.
Conversely, suppose is Riemann integrable, and choose a fixed partition with . Let be the number of its interior division points and choose with . Call a cell of bad when its interior contains a division point of . There are at most bad cells, and their total length is at most .
Every other cell lies in a single cell of , so its oscillation is no larger than that of the containing cell. Summing the contributions of these good cells gives at most , while each bad cell has oscillation at most . Therefore the finite bad-cell estimate for Darboux sums gives
For large enough , the right-hand side is less than . This proves the uniform-mesh Darboux criterion
This argument does not assume that the partitions are nested; in general they are not.
For the composition, takes values in . Since is continuously differentiable, the extreme value theorem bounds both and on that interval. In particular, let . The mean value theorem states that a function continuous on the interval between and differentiable in its interior satisfies for some intermediate . Hence
On each partition cell, this bounds the oscillation of by times the oscillation of , whether or not the local extrema are attained. It follows that
The composition is bounded, so the proved uniform-mesh Darboux criterion applies. Thus is Riemann integrable. The reusable fact is Lipschitz composition preserves Riemann integrability; continuous differentiability supplies the required bound on the range of .
For any distinct nodes, the polynomial has degree , is nonnegative, and vanishes at every node. The quadrature rule sum for is zero, but because the weight is positive and is positive except at finitely many points. Therefore no such rule is exact for all polynomials of degree at most , irrespective of the chosen weights.
For the sine weight, its first four moments are . A monic degree-two orthogonal polynomial is
since direct use of these moments gives . Its roots lie in and are
The weights follow by requiring exactness for and : and , and the symmetric nodes imply both weights are one. To prove cubic exactness, divide any cubic as , with of degree at most one. The integral of is zero by orthogonality, and its nodal values vanish; the remaining linear polynomial is integrated exactly. This is the two-node Gaussian quadrature with sine weight; the argument proves its Gaussian quadrature property without assuming a general quadrature theorem.
Use the ideal long-solenoid approximation: negligible pitch and end effects, vacuum permeability , and negligible displacement current. By cylindrical symmetry the magnetic field is axial. An Ampère's law rectangular loop with one axial side inside and the other outside gives . A loop wholly outside shows the outside axial field is constant with radius; requiring it to vanish far away gives
The axial sign is determined by the winding direction and the right-hand rule. The small axial component of current from the spiral pitch is neglected in this idealization.
There are turns, and the magnetic flux through each is . The flux linkage is , so the self-inductance is
The induced electromotive force opposes increasing current by Faraday's law. Together with Ohm's law, the circuit equation is . Solving this first-order ordinary differential equation with gives
The time constant is , and the limiting current is .
For a normalized state and a self-adjoint operator with finite second moment, the quantum uncertainty is defined by . Since is real,
In an energy eigenstate of the quantum harmonic oscillator,
Discarding the nonnegative squared means proves the stated lower bound. The Heisenberg uncertainty principle is , following from . Applying the arithmetic-geometric mean inequality to the two variance contributions gives
Here is the oscillator frequency. The bound is the ground-state energy; equality requires zero means and the appropriate minimum-uncertainty width.
For an entire function, the Cauchy derivative formula on a positively oriented circle of radius about is
The resulting Cauchy estimate is , where is the maximum of on that circle.
The Liouville theorem says that a bounded entire function is constant. Indeed, if on the plane, the Cauchy estimate with gives . Sending to infinity gives at every point, hence is constant.
For the growth assumption, apply the Cauchy estimate on circles centred at zero. For every integer ,
All sufficiently high Taylor series vanish. Since the Taylor series of an entire function converges everywhere, is a polynomial, of degree at most when . If a negative finite exponent is interpreted for nonzero , the same estimate forces every coefficient to vanish, giving .
A contraction mapping on a metric space satisfies for all , with one constant . The contraction mapping theorem says that on a nonempty complete metric space such a map has a unique fixed point; successive iterates from any starting point converge to it. More precisely, if , then .
The Volterra integration operator maps continuous functions to continuous functions. In the uniform norm,
This constant cannot be decreased: for and , , and both uniform norms are one. Hence is not a contraction.
Changing the order of integration over the triangular region gives
Thus
is a contraction, with sharp constant . This is an example of an iterated contraction.
The group presentation gives the quotient group by the subgroup generated by the rows of
For the Smith normal form, the first determinantal divisor is the greatest common divisor of all entries, namely . The nonzero two-by-two matrix minors are , so the second determinantal divisor is . The third row is the second minus the first, and a nonzero minor shows the rank is exactly two. Consequently the nonzero invariant factors are and , with one free generator. The Fundamental theorem of finitely generated abelian groups gives
An element killed by has zero free coordinate, arbitrary coordinate in , and coordinate or in . There are nine such elements. Removing the identity leaves eight elements of order three.
On a directed flow network with capacities , choose flows satisfying inflow equals outflow at every vertex except source and sink , and maximize the net source outflow . For a cut of a flow network containing but not , its capacity is . The max-flow min-cut theorem states
Every feasible flow is bounded above by every cut capacity; equality for a feasible flow and a cut proves optimality.
The Ford-Fulkerson algorithm starts with a feasible flow, for instance zero. A forward edge has residual capacity and its reverse edge has residual capacity . Find a source-to-sink augmenting path in this residual network, and increase the flow along it by the minimum residual capacity on the path, reducing original-edge flows when reverse edges are used. Repeat until no such path exists. The vertices reachable from the source then define a saturated minimum cut of a flow network. With integer capacities and zero initial flow, all residual capacities and augmentations are integers. Each augmentation increases by at least one, while is bounded by the finite sum of source capacities, so termination takes finitely many steps.
For the original roads, a feasible maximizing flow is given below; every table entry is flow/capacity in vehicles per minute.
RoadBefore stormAfter storm
All road capacities are respected, and direct summation verifies flow conservation at each roundabout. The original flow value is . The cut separating from every other vertex consists of its two incoming roads and has capacity . Therefore the original maximum is 90 vehicles per minute.
To impose a vertex capacity, split into and . Send its incoming roads to and its outgoing roads from , and add a directed internal edge of capacity . Every unit passing through the roundabout must traverse this internal edge. This gives the standard maximum flow with vertex capacities construction.
Starting from zero, apply the Ford-Fulkerson algorithm with the following augmenting paths in order. First use : its residual capacities are , so augment by . Next use : the residual capacities are , so augment by . Finally use : the residual capacities at this stage are , so augment by . No reverse edge is needed in this valid run. The resulting original-road flows are precisely the after-storm column above, and the internal edge carries .
For termination and optimality, take the source-side set . Its outgoing edges are , and , of capacities . They are all saturated, and no positive-flow original edge enters this set. Consequently no residual path leaves the set, and its cut capacity equals the constructed flow value. The new maximum is therefore
Figure 1.
Optimal road flows before the storm and after splitting the flooded roundabout
. Details.
Linearity of the integral in each argument gives a bilinear form, and gives symmetry. Also . If a polynomial is nonzero somewhere on this interval, continuity makes strictly positive on a smaller interval, so the integral is positive. A polynomial vanishing on the whole interval is the zero polynomial. Thus the form is positive-definite and is an inner product.
Apply the Gram-Schmidt process to . Odd functions have zero integral, so is already orthogonal to , and the third orthogonal polynomial is . Their squared norms are
Therefore an orthonormal basis is
These are the first three normalized Legendre polynomials. Their distinct degrees also prove that they span the three-dimensional vector space.
For the normal linear model, differentiating the ordinary least squares objective gives . Full column rank makes invertible, so
The distribution follows because is a linear transformation of a multivariate normal distribution. Its expectation is , and direct multiplication gives the displayed covariance matrix.
Let , the orthogonal projection onto the design's column space. The residual sum of squares is . Since , symmetry and idempotence give . Thus
is an unbiased estimator.
For the two independent regressions choose . The first rows of the design matrix are and the last rows are . The centering conditions and distinct predictors give
It follows that
The two estimated slopes are independent normal random variables, as they depend on independent error blocks. Therefore
For these data use the pooled residual sum of squares
Its scaled value is and is independent of the slope estimates by the permitted normal-model result. Hence the standardized difference has a Student t-distribution with degrees of freedom, giving the exact 95 percent confidence interval
Here is the 0.975 quantile of that distribution. This is a confidence interval for the difference of independent regression slopes. As required by the original framework, this specialization needs . Distinct predictors alone allow , but then the fit is saturated, and there are no residual degrees of freedom to estimate the unknown variance or form this interval.
Apply mass conservation to a fixed horizontal region . The layer mass is and the outward horizontal flux is . The divergence theorem and arbitrary choice of give
This depth-integrated law retains free-surface motion; neglecting the vertical velocity in horizontal momentum is not the assumption that the depth cannot change.
Take the free-surface pressure to be constant. hydrostatic pressure gives , so the horizontal pressure forces are . Linearization about a resting layer gives the linearized shallow water equations
Taking the curl of the momentum equations yields . Combining with continuity gives the linearized shallow-water potential-vorticity anomaly
For , . Taking the divergence of momentum gives . Eliminate the divergence with continuity to obtain
For , substitution of gives the inertia-gravity wave dispersion relation
The associated purely oscillatory velocity field is
These formulas satisfy all three linearized equations and the zero-anomaly condition. A separately added spatially uniform inertial oscillation is not part of this monochromatic wave.
To first order in amplitude evaluate the wave at a particle's equilibrium coordinate , so . Integrating its velocity gives displacements relative to the orbit centre
These are particle ellipses for rotating shallow-water waves, with axis ratio . For the stipulated positive signs, the velocity at phases points respectively right, up, left, down, with magnitudes . The particle orbits are clockwise as time advances, since the phase decreases.
Figure 1.
Horizontal velocity directions and particle ellipse for a rotating shallow-water wave
. Details.

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