Alternating binomial moment Created 2026-10-06 Updated 2026-10-14
For nonnegative integers , the alternating binomial moment satisfies when and . Expand the polynomial in falling factorials and differentiate the binomial theorem to prove these identities. Equivalently, alternating binomial coefficients implement a finite difference that annihilates polynomials of degree less than .
Bernstein basis 2026-10-05
These nonnegative polynomials form a basis of polynomials of degree at most , and sum to one on . For ,where ratios for equal one and terms with vanish. The identity follows from and the binomial theorem. It gives explicit basis coefficients using the falling factorial.
Bernstein falling-factorial identity 2026-10-14
At the sampling point , the polynomial inside the Bernstein polynomial has value . The falling factorial identity and the binomial theorem prove the displayed formula. For fixed , both the input and its scalar factor tend uniformly to as grows. The supremum norm contraction of the Bernstein polynomial therefore gives for .
Bernstein monomial recurrence Created 2026-10-05 Updated 2026-10-14
For and , the Bernstein polynomial of the monomial satisfiesIt follows by applying and expanding with the binomial theorem. The coefficients sum to one; only the first tends to one as . Induction on proves uniform convergence of these monomial approximants, starting from .
Bézier curve 2026-10-14
A Bézier curve is a parametric curve specified by control points in a Euclidean space and the Bernstein basis:Here is a binomial coefficient. Each coordinate is a polynomial of polynomial degree at most ; special choices of control points can lower the polynomial degree. The ordered control points form the control polygon. A cubic Bézier curve uses four control points and has the explicit formThe curve passes through and ; the interior control points steer its shape and need not lie on it.[ref]
https://ocw.mit.edu/courses/6-837-computer-graphics-fall-2012/aba8735cf2cf7c71ca5d29b46873309a_MIT6_837F12_Lec01.pdf. MIT 6.837, Bézier Curves and Splines, slides 23–31 and 45–47, 2012
For a worked example, chooseSubstituting these control points givesHere , so neither interior control point, both at height , lies on the curve. De Casteljau's algorithm computes the same point using only successive linear interpolations.
The endpoint tangent vectors follow from the Bézier derivative control polygon:Thus the curve leaves toward and arrives at from . These nonzero derivatives determine the endpoint tangent lines; if an endpoint derivative vanishes, that formula alone does not determine its tangent direction. Endpoint handles are useful when arranging a parametric first-derivative join of Bézier curves.
The parameter is usually not arc length. For this example,Equal steps in therefore do not generally travel equal distances. Distance along the curve is instead the arc length, given by the integral ; its derivative is the norm of the tangent vector and measures the rate of travel.
Two geometric facts make Bézier curves especially convenient for design. First, the Bernstein basis weights are nonnegative and form a partition of unity, since the binomial theorem gives . Hence is a convex combination of the control points and lies in their convex hull.[ref]
https://groups.csail.mit.edu/graphics/classes/6.838/S98/meetings/m15/. MIT 6.838, Bézier Curve and B-Spline Curve, §1.4.1, 1998
The convex hull is the smallest convex set containing the control points, not their axis-aligned bounding box. Here it is a trapezoid, strictly smaller than : the box corner is outside the convex hull. The curve need not fill or touch every edge of either enclosure. The convex hull guarantee concerns ; outside that interval weights can be negative.Second, applying an affine map to every control point gives exactly the same result as applying it to the entire curve. For ,This is affine equivariance of a geometric basis: a translation, rotation or shear mapping can be performed on a handful of control points. For example, transforms the four control points to and transforms the midpoint to , also obtained from the same weights .
These editable handles explain the usefulness of Bézier curves in computer aided geometric design, vector graphics paths and outline fonts: a small collection of points controls an entire smooth stroke, and resizing the design preserves its mathematical shape. Cambridge's computer-graphics notes describe their use in graphic design, typography and PostScript outlines. The industrial context includes Pierre Bézier's work at Renault and Paul de Casteljau's work at Citroën.[ref]
https://www.cl.cam.ac.uk/teaching/1415/CompGraph/cgip.pdf. Neil A. Dodgson and Peter Robinson, Cambridge Computer Graphics and Image Processing, slides 183 and 226–228, 2014
// Target: analysis.bigb
Binomial coefficient Created 2026-09-24 Updated 2026-10-13
For nonnegative integers and , the binomial coefficientcounts the -element subsets of an -element set. To obtain the formula, first choose an ordered list of different members in ways. Each subset appears in exactly orders, so divide by that factorial. The cases and each have one selection, the empty set and the whole set. For integer outside , the combinatorial convention is .
For , , the calculation is . The left-hand panel lists all ten subsets of . Marking an included member with one and an excluded member with zero gives a bijection with length-five binary strings containing exactly two ones. More generally, this makes selection, binary encoding, and coefficients in a binomial theorem three descriptions of the same count.
For a uniformly chosen two-person team, a specified person belongs to four of the ten teams, so the probability of their inclusion is . Uniform selection of a -element subset similarly gives inclusion probability for each member when , as the double counting identity shows.
Binomial distribution Created 2026-09-24 Updated 2026-10-14
The binomial distribution counts successes in a fixed number of independent Bernoulli trials with common success probability . Equivalently,Here is a nonnegative integer and . The binomial coefficient counts placements of the successes; each particular arrangement has probability . The binomial theorem makes the masses sum to . At all mass is at zero, and at all mass is at ; these endpoint laws can be read directly without interpreting .
The linearity of expectation and addition of variances for independent random variables giveThe fixed trial count, common success probability, and joint independence are substantive model assumptions. Sampling uniformly without replacement from a finite population instead leads to a hypergeometric distribution. Independent trials with different success probabilities generally give a Poisson binomial distribution. Common marginal success probabilities alone are insufficient: if all ten indicators equal the same Bernoulli random variable with , their sum is zero with probability or ten with probability . Its mean is still three, but its variance is . The standard construction is given in Penn State STAT 504, binomial distribution.
For an exact constructed example, let each of ten independent trials choose uniformly from ten labelled tokens, with replacement, and mark three tokens as successes. Then and . Exactly three successes have probabilityThe mean is , the variance is , and the standard deviation is . Zero successes have probability , so at least one success has probability . A single count calculation replaces enumeration of all equally likely token sequences.
Binomial inversion Created 2026-10-14 Updated 2026-10-20
These two finite-sum transformations are inverses over any commutative ring. Substitute one sum into the other and use . The inner alternating sum is by the binomial theorem, so only survives. In a Mahler expansion, is the nth finite difference of the sampled values .
Binomial probability mass Created 2026-10-20 Updated 2026-11-05
The binomial probability mass at isfor . Each selected set of successes has probability by independence, and the binomial coefficient counts such subsets. For , the masses are . They sum to one by the binomial theorem. Endpoint laws and are concentrated at zero and , respectively.
In Boltzmann entropy of a two-box occupancy, impose an initial restriction that all labels are left. There is one allowed coarse microstate. Remove that restriction, allowing all occupancy values: the allowed set is now the union of every occupancy macrostate, containing strings. If the final description assigns equal probability to this whole set, its Boltzmann entropy change isThe counting identity is the binomial theorem. For twenty labels, . This final description fixes neither box occupancy; it is coarser than the particular macrostate , whose Boltzmann entropy is . The two counts answer different questions, so substituting the balanced macrostate for the full allowed set would change the calculation.
For four labels, the initial all-left string is
0000; removing the restriction makes all sixteen strings available. The column has only six strings. Accordingly, the whole allowed set has Boltzmann entropy , while the balanced macrostate has Boltzmann entropy .Sixteen configurations of four labeled particles grouped by left occupancy, compared with the all-left restriction
. Details. Removing a barrier changes the allowed set immediately, but it does not instantaneously randomize the actual probability distribution. Motion and equilibration must make those configurations accessible. The counting result illustrates the configurational contribution to free expansion; it does not describe the relaxation time or every contribution to the entropy of a real gas.
Commuting operators Created 2026-09-25 Updated 2026-11-05
Two linear operators and commute when , with all products taken on the stated operator domains. For finite matrices, or bounded linear operators on a Banach space, commutation impliesThe binomial theorem applies because the factors commute, and absolute convergence of the operator exponential series permits regrouping its terms. For unbounded operators, a formal equality on one common operator domain alone does not justify this exponential identity; the existence and commutation of the corresponding exponential operators require separate hypotheses.
European power put formula 2026-10-25
In the dividend-free Black-Scholes model, let , , , andThen the displayed finite sum prices the European option with power put option payoff. Here is the standard normal distribution function. Indeed, conditionally has a normal distribution with mean and variance . Expand by the binomial theorem on and apply the lower truncated lognormal moment to each term. Equivalently,This expectation representation proves monotonicity and convexity in . It also gives and as by the dominated convergence theorem. For positive the lognormal distribution smoothing makes the price smooth and strictly positive.
Even part of a polynomial Created 2026-10-06 Updated 2026-11-05
Over a field of characteristic different from two, the even part of a polynomial is . It retains exactly the terms whose exponents are even. Applied to the binomial theorem, it extracts sums of even-indexed binomial coefficients.
Existence of an Euler witness for every odd composite integer Created 2026-09-29 Updated 2026-11-05
If divides for a prime number , write with and . The Chinese remainder theorem chooses and . This base is a unit modulo and has Jacobi symbol , because it is one modulo every prime divisor. But with , the binomial theorem gives . Since , this is not one, so the Euler congruence fails.
If is squarefree, it has at least two distinct prime factors. Choose to be a quadratic nonresidue modulo one factor and one modulo every other factor, again by the Chinese remainder theorem. Then , while is one modulo a different prime factor. It therefore cannot equal the Jacobi symbol modulo .
Freshman's dream Created 2026-10-03 Updated 2026-11-05
In a commutative ring of prime characteristic , the freshman's dream identity is . The binomial theorem proves it because divides every intermediate binomial coefficient , . Iterating gives . For example, over , while over the real numbers the cross terms generally remain. Prime characteristic is essential to this ring-wide statement; an arbitrary positive composite characteristic is insufficient.
Generalized-eigenspace bracket lemma 2026-09-28
If is a derivation of a Lie algebra, then its generalized eigenspaces satisfyApply a sufficiently large power of and use the binomial theorem together with the derivation rule.
Inclusion-exclusion principle Created 2026-09-24 Updated 2026-10-13
For finite sets , the cardinality of their union isAdd the individual cardinalities, subtract pairwise intersection counts, add triple intersection counts, and continue alternating. This is useful whenever one object can satisfy several conditions: a search result can match several filters, or a permutation can have several forbidden fixed points.
Among the integers from 1 to 30, let contain the multiples of 2 and the multiples of 3. Then , , and , because their common multiples are the multiples of 6. The naive sum counts those five twice; the correct union size is . The regions contain ten in alone, five in both, five in alone, and ten in neither.
Subtracting overlap counts each selected integer once; a third divisibility condition requires adding the triple overlap back
. Details. Add a third set containing the multiples of 5. Its size is 6; the three pairwise intersections have sizes ; and the triple intersection contains only 30. The inclusion-exclusion principle gives integers divisible by at least one of 2, 3, and 5.
The alternating corrections have a local explanation. An object belonging to exactly of the sets is counted times, by the binomial theorem applied to . An object in none contributes zero. Thus overlapping descriptions are repaired without requiring the sets themselves to be disjoint. For probability, the same calculation applies to event probabilities in place of cardinalities, giving the inclusion-exclusion principle for probabilities.
Laplace transform of a Laguerre polynomial Created 2026-10-20 Updated 2026-10-31
For the ordinary Laguerre polynomial , apply the Laplace transform to each term, using for . The binomial theorem givesThis proves the formula for every nonnegative integer . In particular has transform .
Lifting a primitive root to odd prime powers Created 2026-09-24 Updated 2026-11-05
Let be an odd prime and a primitive root modulo . Then is a primitive root modulo every prime power if and only if it is a primitive root modulo . In that caseThe condition at says with . The odd-prime case of the lifting-the-exponent lemma, obtained here by repeated use of the binomial theorem and then raising to an exponent not divisible by , givesHere is the prime valuation. To see the induction step, the first term in has prime valuation , while every later term has strictly greater prime valuation when is odd and .
Mahler expansion of the parity function Created 2026-10-14 Updated 2026-11-05
The locally constant function equal to one on and minus one on its other coset has Mahler coefficients : at nonnegative integers its values are , so the forward difference operator multiplies it by . Since and the binomial polynomials have absolute value at most one on the 2-adic integers, the series converges uniformly. The binomial theorem verifies its values on the nonnegative integers, and continuity extends the identity to the entire domain.



