The BV lattice inequality applied to two indicator functions gives the perimeter inequality. For smooth approximations, minima and maxima partition the two gradients; sequential lower semicontinuity passes the estimate to BV. It prevents a crossing of minimizers with strictly ordered set forcing.
Support function Created 2026-09-28 Updated 2026-11-05
The support function of a nonempty subset of a finite-dimensional real inner-product space is
It gives the largest value of a linear objective in direction , allowing when the set is unbounded in that direction. As a supremum of linear functions, it is convex and lower semicontinuous; it satisfies for and .
For the Euclidean unit ball, the Cauchy-Schwarz inequality gives , attained by when . For the probability simplex, the weighted-average bound gives , attained at a maximizing coordinate vector. Thus many familiar convex objectives are support functions.
Let be the indicator functional of a constraint set, equal to zero on and outside it. The convex conjugate definition gives . If is closed and convex, the Fenchel-Moreau theorem then gives . This uses the extended-real constraint indicator, rather than the zero-one indicator function used in measure theory.[ref]
The support-function subgradients as exposed faces identifies the maximizing vectors, linking sensitivity of the support function to the geometry of .
Tail probability Created 2026-10-03 Updated 2026-10-14
For a real random variable , an upper-tail probability has the form and a lower-tail probability has the form . Each is the probability of an event lying beyond a chosen threshold in one direction. A tail probability need not be small: the threshold determines how much of the probability distribution it includes. A concentration inequality bounds such probabilities, often for deviations from an expected value.
Endpoint conventions matter. Write for the cumulative distribution function and . The complement rule of probability gives four distinct formulas:
The strict upper-tail convention is the survival function . Its value differs from the inclusive upper tail probability by exactly the probability mass at the threshold:
A singleton with positive probability mass is an atom of a measure. Thus excludes an atom of a measure at , whereas includes it. These endpoint identities follow directly from the cumulative distribution function properties in Kyle Siegrist, Distribution and Quantile Functions: endpoint probabilities and right tails.
As the threshold increases, both upper tail probabilities are nonincreasing functions. The strict survival function is a right-continuous function; the inclusive upper tail probability takes the upper endpoint value at a downward jump, equal to the left limit of the survival function. Both tend to zero as for a real random variable, but the speed of that decay differs across probability distributions. The cumulative distribution function properties and their proof from continuity of probability measures are given in MIT 6.436J, Lecture 4: random variables and cumulative distribution function properties.
For a fair six-sided die , the discrete uniform distribution assigns probability mass to each of . At threshold four,
Between four and five, both upper tail probabilities equal . At the largest possible outcome the distinction is especially visible: , but . The diagram shows exact probabilities for this mathematical model; its dots specify which endpoints belong to each step function.
Figure 1.
Exact fair-die probabilities: including or excluding a threshold changes the tail by one atom
. Details.
If a probability distribution has a probability density function , then every singleton has zero probability mass and
For an exponential distribution of rate two, for and zero otherwise, so for and for . Hence . This tail probability is an integral of the probability density function, not its height . A mixed probability distribution retains endpoint jumps even with a smooth component: give zero probability mass and choose this exponential distribution with probability . Then , , and for .
A two-sided tail probability can measure the absolute value of displacement from a specified center . For , the two extreme events are disjoint events, so
For strict displacement , replace the last expression by . The condition prevents overlap; at adding inclusive tails double-counts any probability mass at . For a uniform distribution on , take and : the two tail probabilities are each and their sum is . Equal tails follow from this symmetric probability distribution, not from the phrase two-sided alone; for a uniform distribution on with , the two tail probabilities are zero and .
The tail-sum formula for expectation turns a whole curve of tail probabilities into an expected value. For any nonnegative random variable , without assuming a probability density function or a finite expected value,
For a proof outline, write pointwise and exchange the expected value and Lebesgue integral using Tonelli theorem; is an indicator function. The inclusive version has the same Lebesgue integral: positive probability masses occur at only a countable set of thresholds, which has Lebesgue measure zero. For a nonnegative integer-valued random variable , the tail-sum formula instead gives . The integer hypothesis is essential for these sums. The integral identity, its indicator function proof, and the integer version appear in Kyle Siegrist, Additional Properties of Expected Value: integration and summation of right tails.
For the fair die, this tail-sum formula yields , equal to the direct weighted arithmetic mean . For the rate-two exponential distribution, the area under the survival function is , its expected value. The first panel below shades an integral of the probability density function for a single threshold; the second shades an integral of the survival function across all nonnegative thresholds. These are analytical illustrations, with the displayed curves truncated at three; their exact total areas use an infinite integration range.
Figure 2.
Exponential model: one tail probability is density area, while expectation is total survival area
. Details.
Nonnegativity is essential to interpreting the upper tail probability area as : for a general real random variable that area equals the expected value of its positive part. An integrable random variable satisfies , subtracting the expected value of its negative part; infinite terms cannot be canceled. Even when is finite almost surely, its expected value can be infinite. For the shape-one Pareto distribution on , on and for , so the area is . The finite versus infinite expected value distinction is illustrated in Kyle Siegrist, Definitions and Basic Properties: exponential and Pareto expected values.
Why are tail probabilities useful? They answer threshold questions directly, and a concentration inequality can bound them without knowing the full probability distribution. For nonnegative with finite expected value, Markov inequality gives for : a large threshold relative to the expected value forces rarity. The quantile function reverses the question by choosing a threshold for a prescribed cumulative level. If with , then ; an atom of a measure may prevent equality. For the die, , with strict upper tail probability zero and inclusive upper tail probability .
A tail probability describes rarity under a specified probability distribution; it is not automatically a conditional probability after extra information. For with ,
because the threshold events are nested. Thus the die has but . Conditioning changes the sample space and renormalizes its probability measure; the same extreme outcomes can become common in that restricted population.
Tail-sum formula Created 2026-09-24 Updated 2026-10-18
The tail-sum formula expresses an expected value as the area under a survival function. For every nonnegative random variable ,
This Lebesgue integral and the expected value may both be ; a probability density function is unnecessary. For a random variable taking values in the nonnegative integers, the corresponding sum is
The events and coincide because takes integer values. Thus the strict sum starts at zero, while the inclusive sum starts at one.[ref]
For an original example, let the probability mass function of be
Its expected value computed directly is . The strict tail probabilities at thresholds are : their sum is again . There is no probability mass at two, yet the event still has probability . The survival function has heights on the successive intervals ; each interval has length one, so its integral is the same sum.
Figure 1.
The same expected value from probability masses and survival columns
. The exact constructed probability mass function assigns to . The contribution appears in one survival column, while the contribution appears in three. Filled endpoints give the strict survival function at its jumps; open endpoints show the preceding height. The shaded area is . Details.
The indexing matters numerically. Starting the inclusive sum at zero adds , giving for this example. Starting the strict sum at one omits , giving . For a general nonnegative random variable, replacing with inside the integral is harmless: the difference is , nonzero at only a countable set of thresholds. For each positive integer , at most thresholds can have probability mass at least ; their countable union contains all thresholds with positive probability mass and has Lebesgue measure zero. This reasoning concerns an integral, not equality of the two survival function conventions at every point.
For a continuous original example, take the uniform distribution on the interval . Its survival function is for and zero for . The area is a triangle of base four and height one:
Directly integrating against the probability density function gives the same expected value, . The integral of the probability density function alone is one; it is the survival function whose area is the expected value.
Figure 2.
A uniform density has total probability one and survival area two
. Exact curves for the uniform distribution on . The probability density function has integral one, while the survival function has integral two. Splitting the survival area at gives before the cap and beyond it, the expected values of and the positive part , respectively. Details.
The proof counts layers of each outcome. For a realized value , the indicator function equals one over an interval of length , so
Tonelli theorem permits the interchange because the indicator function is nonnegative; no finite expected value is assumed. Similarly, an outcome contributes one indicator random variable for each of the events that occur:
Again Tonelli theorem applies to the nonnegative sum, or equivalently the monotone convergence theorem applies to its partial sums. This exchanges counting layers within each outcome with averaging across outcomes. The existing integer-valued hypothesis in the tail-sum formula explains what changes when the values are not integers; the tail integral formula for moments weights the layers to obtain higher moments.
For an integrable random variable that can have either sign, apply the nonnegative formula separately to its positive part and negative part :
Integrability makes both integrals finite. More generally the difference defines an extended expected value when at least one is finite; if both are infinite, subtraction does not define an expected value.[ref]
Tail probabilities are often easier to measure or bound than a whole probability density function. For a device's survival time, the survival function records the probability of still operating at each threshold; its integral gives the mean operating time. A finite observation window naturally gives the expected value of a capped nonnegative random variable. For a mathematical bound, for all implies . The tail-sum formula turns control of a whole family of events into control of an average.
Term frequency 2026-11-05
The raw term frequency counts occurrences of term in one document , after the chosen indexing preprocessing. It records how often the term appears there. Document frequency instead counts how many documents contain the term.[ref]
For indexed terms , the indicator function gives
In red red boat, the raw term frequency of red is two and that of boat is one. The proportions and are normalized counts; they are not the raw counts in this convention.
Reordering the document to boat red red preserves both term frequencies but changes which phrase queries match. Counts therefore compress away ordering information. A positional index can retain the occurrence positions as well as the counts.[ref]
A retrieval score can use term frequency as evidence that a document discusses a query term, but repetition alone does not establish relevance. Nor must doubling a raw count double a score: a scoring rule can deliberately reduce the effect of repeated occurrences. Whenever a transformed or normalized quantity is called term frequency, its formula should be specified.
Translation continuity in Lp Created 2026-10-06 Updated 2026-10-14
For and , translations converge to in the Lp space norm. First prove this for continuous compactly supported functions, using uniform continuity and a common bounded support. Their density in Lp space, together with the norm-preserving translation map and the triangle inequality, proves the assertion for arbitrary . It implies convergence of averages over shrinking intervals, a basic approximate identity argument. The corresponding assertion fails for general functions, such as an indicator function with a jump.
Translating a Lebesgue measurable set by a real number preserves measurability and its Lebesgue measure. Translation invariance of Lebesgue outer measure and Carathéodory's criterion give the measurability assertion and equality. Applying the result to indicator functions, then simple functions, and finally increasing simple approximations gives for every nonnegative Lebesgue measurable function. For a Lebesgue integrable function, apply the identity to its positive part and negative part.
Triangle count Created 2026-10-05 Updated 2026-10-06
The triangle count of a finite simple graph is the number of unordered triples of vertices inducing a triangle in a graph. In a tripartite graph with parts and adjacency indicator functions , it equals , using uniform expectations on nonempty parts.
Let a tripartite graph have nonempty parts , pair edge density of a bipartite graph values on , and . If every has exactly neighbors in , its normalized triangle count obeys
The constant-degree assumption makes the contribution of the constant exactly . For each fixed , apply the bilinear correlation bound for the box norm to the indicator functions of its two vertex neighbourhoods. Their squared norms are and the relative -degree of . Average over and use the Cauchy-Schwarz inequality to bound the mean square root of that degree by .
Truncated normal distribution Created 2026-09-28 Updated 2026-11-05
A truncated normal distribution is a normal distribution conditioned on belonging to a retained measurable set of positive probability. If , , and , its density is
where is the standard normal density. The indicator is essential: the density is zero outside . For an interval , possibly with infinite endpoints,
The same expression holds for any endpoint inclusion convention because the original normal distribution has no atoms.
For a standard normal variable restricted to positive values, and the density is for . Its mean is : integrate using . Symmetry gives second moment one, hence variance . Truncation therefore changes the mean and variance; they are not generally the original parameters .
sign-truncated normal sampling uses inverse transform sampling to generate this conditional law directly. Rejection from the original normal is also exact but may be slow when the retained set has very small probability.
Typewriter sequence 2026-10-25
On , for and , the displayed indicator functions form a sequence that converges to zero in every finite Lp norm while failing to converge pointwise anywhere. Indeed, for ,
Every point belongs to exactly one interval in each dyadic block, and for it misses at least one other interval in that block. Thus every point sees infinitely many ones and infinitely many zeros. Half-open intervals specify the behaviour at dyadic endpoints. This separates norm convergence in an Lp space from pointwise convergence and convergence almost everywhere.
Uniform law of large numbers Created 2026-09-24 Updated 2026-11-05
Let be independent and identically distributed with probability law , and let be a class of measurable -integrable functions. Write and . A uniform law of large numbers concerns
with measurability of the supremum assumed. A uniform weak law uses convergence in probability; a uniform strong law uses almost sure convergence. The mode and sampling assumptions are part of the statement.
For a finite class, the strong law of large numbers for each function holds simultaneously and gives the uniform strong law. For infinite classes, pointwise convergence alone is insufficient. For example, let be the uniform distribution on and take indicators of all finite subsets. Each fixed function has expectation zero and empirical mean tending to zero almost surely. Yet for every sample the finite set belongs to the class and its empirical mean is one. The displayed supremum is therefore one for every .
Conditions such as finite bracketing of a function class at every positive width control this complexity. The Glivenko-Cantelli theorem gives the uniform strong law for indicators of half-lines, the class determining the empirical distribution function.
In a one-period complete market with deterministic initial holdings, two integrable positive pricing variables assigning the same prices to every traded asset are equal almost surely. Replicate indicator functions to obtain equality of their integrals on every event, then apply this to the event where one density exceeds the other.
Wald's equation Created 2026-10-03 Updated 2026-10-14
Wald's equation turns a random sum into a product of two expected values: the average contribution per step and the average number of steps. Its surprising feature is that the number of steps may depend on what has already happened. A procedure can stop on its first successful Bernoulli trial, for example, while the identity still accounts for its total cost. The crucial restriction is that the decision to take the next step cannot use that step's unobserved outcome.
Let be real independent and identically distributed random variables with , let , and put and . Suppose is a nonnegative integer-valued stopping time for the natural filtration , with . Then is an integrable random variable and
These hypotheses allow statistical dependence between and the increments; they do not allow access to future increments. The finite-expected value requirement is stronger than stopping almost surely.[ref]
For the proof idea, count step only on . This event is determined by the first observations, so its indicator function is independent of . The Proof of Wald's equation by stopping indicators combines this observation with the tail-sum formula for expectation. The same calculation with gives , which justifies interchanging the expected value and the infinite series. This is why the result survives a data-dependent end point without assuming an independent count.
The identity is useful in randomized algorithms and repeated sampling: one can translate an average amount of work into an average number of attempts, or conversely, without first finding the full probability distribution of the total. The examples below separate a permissible stopping rule from a rule that peeks ahead and from a valid rule whose average waiting time is infinite.
For finite subsets of a finite ambient set , the indicator function of their complement is . Expanding this finite product and summing it against any weight proves the weighted formula. The empty intersection is . Negative weights are allowed; finiteness removes every convergence issue.
Window function Created 2026-10-14 Updated 2026-10-18
A window function is a function that vanishes outside a chosen finite interval; multiplying an input by it selects and weights that part of the history before a Fourier transform. The rectangular window is the indicator function of . Applied to the weighted causal extension by zero of an input, it produces the finite-history integral used to approximate a Laplace transform.