By positive unfolding of a cusp-form square, for . Choose . The Cauchy-Schwarz inequality bounds the absolute sum for the L-function of a cusp form by
Set , and define the estimator on zero-denominator events as part of the model. On , its error is at most . Centering and applying the Cauchy-Schwarz inequality gives the displayed bound, where is the expected error on . This controls a ratio estimator without falsely assuming that its numerator and denominator are independent.
Absolute Fourier convergence from a square-integrable derivative Created 2026-10-07 Updated 2026-10-14
For a periodic absolutely continuous function with derivative in , integration by parts gives . Bessel's inequality and the Cauchy-Schwarz inequality prove the displayed bound in the normalized circle norm. Adding the constant coefficient gives an absolutely and uniformly convergent Fourier series. Merely bounding individual coefficients by would not establish absolute convergence.
Additive energy Created 2026-09-24 Updated 2026-10-13
The additive energy of a finite set in an abelian group counts additive quadruples, with order and repeated members allowed:
At a fixed sum , independently choosing two of its ordered pairs gives additive quadruples. Thus additive energy weights heavily represented sums more strongly than the cardinality of the sumset does.
For and , the sumset representation functions give
The arithmetic progression has additional coincidences such as . The set still has coincidences forced by commutativity, including , so its additive energy is not merely the sixteen identical-pair comparisons.
The same additive energy can be counted using the difference set. Define . The identity is equivalent to , and the coordinate rearrangement is a bijection. Consequently
For , the difference counts from through are again . For , the zero difference has four representations and each of the twelve nonzero differences has one, giving . The sumset representation functions for sums and differences can look different while their squared totals agree.
For every nonempty finite set in an abelian group ,
The lower bound follows from the Cauchy-Schwarz inequality and the total sumset representation function count:
For the upper bound, any three members determine at most one fourth member of an additive quadruple. See Yufei Zhao's MIT lecture 25, pages 1-3, for representation counts and the energy bounds.
In the two integer examples, the lower bounds are and , and the upper bound is . For the subgroup of , each element of has three sum representations, so and both bounds are equalities.
For nonempty , dividing additive energy by gives a relative measure between and one. Small doubling constant therefore forces relatively large additive energy. A converse requires care: the Balog-Szemerédi-Gowers theorem extracts a large subset with small doubling constant, rather than asserting that all of has small doubling constant.
If a subset of a cyclic group has normalized additive energy at most , every nonconstant Fourier coefficient on a finite abelian group of its indicator has modulus at most . Expanding the count of gives the frequency product . The Cauchy-Schwarz inequality and Parseval identity on a finite group bound its nonconstant part by the displayed quantity. Character doubling has multiplicity , so no assumption that the modulus is odd is needed. The error is a normalized density error multiplied by .
Angle between vectors Created 2026-10-20 Updated 2026-10-25
For nonzero real vectors in a Euclidean space, their angle is determined by the displayed dot product formula. The Cauchy-Schwarz inequality puts the quotient in , so the inverse cosine is defined. Perpendicular vectors have angle , parallel vectors pointing the same way have angle zero, and those pointing in opposite directions have angle . A zero vector has no uniquely defined direction and hence no angle by this definition.
For a normalized spherical harmonic of degree , write and . Integration of the radial Poisson equation gives , where . Cauchy-Schwarz inequality and give the displayed bound on . For bounded density amplitudes with fixed radial support this decays as , giving a quantitative angular short-scale justification of the Cowling approximation.
Angular integral in the rational map approximation Created 2026-10-05 Updated 2026-11-05
For a degree- rational map, the angular Jacobian of a rational map has average , so the Cauchy-Schwarz inequality gives . In dimensionless Skyrme model units the radial energy within the rational-map ansatz is
First minimize over admissible maps, then minimize over profiles with , . This gives a restricted variational approximation and an upper bound on the unrestricted minimum in that topological sector, not an exact multi-Skyrmion solution. Houghton, Manton and Sutcliffe developed this construction in arxiv.org/abs/hep-th/9705151.
Apparent power 2026-11-05
Apparent power is the product of RMS terminal electric potential difference and electric current, conventionally expressed in volt-amperes:
For sinusoidal signals at one frequency, it equals the magnitude of complex electrical power and satisfies . It is not generally the average rate of net energy absorption, which is active power.[ref]
For an original example, a100V terminal pair carrying5A RMS has500VA of apparent power. If active power is400W, the power factor is0.8. In the sinusoidal case the magnitude of reactive power is reactive volt-amperes; the magnitude calculation alone does not determine whether the current leads or lags.
Magnitudes do not add like complex quantities. Consider two parallel sinusoidal loads at the same supply, with complex powers and in volt-amperes. Each has500VA of apparent power, but the combined terminal complex power is600VA with zero imaginary part. The source therefore sees600VA rather than the1000VA sum of individual magnitudes. Their internal branch currents and individual component requirements still exist; reactive cancellation at the source does not erase those branch conditions.
For nonsinusoidal waveforms, the product definition remains useful, but the simple equality with the magnitude of one fundamental-frequency complex power needs qualification. With and , RMS current is5A and apparent power is500VA. The fundamental-frequency complex electrical power is only300VA. The extra RMS current is not represented by that one complex number.
Thus record the waveform convention with an apparent power rating or measurement. Separately measuring RMS potential difference and current gives this product, while recovering active power requires the corresponding average product or adequate phase-resolved information. The Cauchy-Schwarz inequality guarantees without assuming a sinusoidal waveform.
Autocorrelation Created 2026-09-28 Updated 2026-10-14
The autocorrelation function of a real weakly stationary process with positive variance is its normalized autocovariance:
It is dimensionless, with , , and by the Cauchy-Schwarz inequality. It is unchanged by replacing with for fixed . This makes autocorrelation useful when comparing records measured on different scales. The ACF is a property of the model; the sample autocorrelation function estimates it and will generally not reproduce theoretical zeros exactly.
An AR(1) with coefficient has autocorrelations at lags one through three. With these become : the same diminishing magnitude, alternating in sign. An MA(1) with instead has lag-one autocorrelation and zero at every higher lag. Equal numerical coefficients in an autoregressive model and a moving-average model do not mean equal dependence. See Bartlett, lecture 3: theoretical ACFs and prediction.
Figure 1.
Theoretical autocorrelation: AR(1) with coefficients 0.7 and -0.7, compared with MA(1) with coefficient 0.7
. Details.
The bars show exact model autocorrelations, not estimates from the illustrated sample paths in time series. The AR(1) retains a diminishing trace of a disturbance at arbitrarily large lags; the MA(1) stops sharing driving noise after lag one. A zero autocorrelation means uncorrelated random variables, and does not generally imply independent random variables. For a Gaussian process it does imply independence of the two coordinates.
There is a direct prediction interpretation. Among affine predictions based on just , the best linear predictor of is , with mean squared prediction error . Thus negative autocorrelation is also useful predictive information. A prediction using the whole observed past can do better; best linear prediction from a finite past describes that problem. Interpreting the affine prediction as a conditional expectation requires additional assumptions, such as a joint normal distribution.
Autocorrelation of a square-integrable function Created 2026-10-18 Updated 2026-10-20
This deterministic, unnormalized cross-correlation of a function with itself exists for every shift when , by the Cauchy-Schwarz inequality. It satisfies and . With Fourier transform convention , its transform is , in the tempered distribution sense when the correlation is not integrable. Fourier inversion at zero gives the Parseval identity, first for Schwartz functions and then by approximation in L2 space. Unlike the normalized statistical autocorrelation, its value at zero is not generally one.
Averaged stationarity bound for stochastic gradient descent Created 2026-10-25 Updated 2026-11-05
Suppose a fixed-step size stochastic gradient descent iteration satisfies
and has a global minimizer . Taking expectations and forming a telescoping sum proves the displayed bound with and deterministic . The Cauchy-Schwarz inequality then bounds the averaged, or the best, expected gradient Euclidean norm by . This is a guarantee of stationarity in the indicated senses, rather than a last-iterate convergence assertion. The additive is a stochastic gradient noise floor.
Target: real-analysis.bigb, under Strongly convex function.
The beam shear correction coefficient adjusts a reduced beam model's shear response for the nonuniform shear stress over a material section. With shear modulus , area , transverse force resultant and generalized beam shear angle ,
where is effective beam shear rigidity. Bower's primary account calls this the Timoshenko shear coefficient and explains that its value depends on geometry, Poisson's ratio and how the approximate theory is matched to the underlying solid.[ref]
An original energy-matching derivation makes the correction precise for one approximation. Assume uniform and a chosen shear-stress field with resultant . The shear elastic energy per unit beam length and its reduced representation are
Thus
The Cauchy-Schwarz inequality gives , hence for this definition. Equality requires uniform stress. This bound belongs to the stated energy-matching definition rather than every convention called a shear correction coefficient.
For the parabolic rectangular stress approximation used in effective beam shear rigidity, the squared-stress integral is , giving . Choose , and . Then and radians. Omitting the correction gives , underestimating this generalized shear angle by one sixth.
The generalized angle also differs from the peak local shear strain. Under the same parabolic approximation, peak stress is , giving peak strain . The values describe different reductions of the same chosen stress field. Identifying from a bending test therefore requires the section model and displacement readout, not merely a material modulus. For a three-point bending test, the shear deflection contribution varies as , whereas bending varies as ; a span comparison can help separate them.
Bhattacharyya coefficient Created 2026-10-14 Updated 2026-10-24
For probability distributions on the same finite alphabet, the Bhattacharyya coefficient measures their square-root overlap:
The vectors and have unit Euclidean norm, so the Cauchy-Schwarz inequality gives . Equality holds exactly when the distributions agree; holds exactly when they assign positive probability to disjoint outcomes. For and , . This overlap is not the probability that two independent draws agree, which here is .
The fidelity of commuting mixed states reduces to this coefficient. More generally, the measurement characterization of quantum fidelity minimizes it over outcome distributions of a common quantum measurement, connecting classical overlap to the unsquared quantum fidelity.
Bilinear cancellation for badly approximable phases Created 2026-10-07 Updated 2026-10-14
Let be a badly approximable number, and sum with and . The Cauchy-Schwarz inequality, divisor-square summatory bound and geometric sums give . Separated rotations bound the last sum by , giving the displayed estimate. A hyperbolic cutoff remains valid because the allowed first-variable values after expansion form an interval.
Bilinear correlation bound for the box norm Created 2026-10-05 Updated 2026-11-05
For real-valued functions or complex functions on finite nonempty sets, with uniform expectations,
To keep the complex case valid, retain every complex conjugate. Apply the Cauchy-Schwarz inequality first in and write
A second Cauchy-Schwarz inequality in bounds the last expectation by . The final factor is , by the box norm definition. Taking square roots proves the result. For real-valued functions, the complex conjugates can be omitted.
Two applications of the Cauchy-Schwarz inequality give
The fourth moment exposes differences of squares that can be factored and estimated by one-dimensional geometric sums.
Bilinear sum Created 2026-09-28 Updated 2026-11-05
A bilinear sum has the form
where are finite index sets and the coefficient sequences can be controlled separately. It is a bilinear form in these two coefficient lists. In analytic number theory, the function often oscillates with the product , as in a Type II sum.
The Cauchy-Schwarz inequality eliminates one coefficient list and exposes correlations:
Useful cancellation comes from small off-diagonal correlations, not from the bilinear notation alone. For example, take and . Orthogonality of roots of unity makes the inner correlation for and zero otherwise, giving . The termwise triangle inequality only gives . This explains why Fourier analysis and large sieve estimates are effective tools for bilinear sums.
If a bipartite graph with parts has at least edges, then the number of ordered tuples for which every is an edge is at least
Indeed, if is the number of common neighbours of in , two applications of the Cauchy-Schwarz inequality give
For every there is a positive integer such that every finite bipartite graph has an -regular pair of partitions with at most cells on each side.
To prove this, give the uniform probability measure, let be the indicator function of the edge set, and for partitions define their energy by
This conditional expectation is an orthogonal projection, so . If the partitions are not -regular, choose witnesses and in every irregular cell pair and refine each by all its and each by all its . The refined energy exceeds the old energy by
On the absolute value function of the mean of the difference is greater than , while this rectangle occupies at least an fraction of . The Cauchy-Schwarz inequality therefore contributes more than from that cell pair. Irregular pairs have total weight greater than , so every refinement raises the energy by more than . The process stops after at most refinements. If the current cell counts are , the construction gives at most new cells, so a finite iterated bound depending only on supplies .