The adapted process is bounded by , so every is an integrable random variable, indeed a square-integrable random variable. Independence of from and its continuous uniform distribution giveThis calculation with a random threshold is justified by conditioning on the -measurable value of : for a fixed , the Lebesgue integral equals . More formally, independence integrates the bounded Borel measurable function over its second coordinate. Thereforewhich verifies the martingale property for this filtration.
Since , the conditional expectation of the squared martingale difference isThe law of total expectation yields . In particular, for every .
For positive integers , let . This measurable set has finite measure, and . Monotonicity of the Lebesgue integral givesso every is a Lebesgue null set. The set where is the countable union of these sets over . Part (a) makes it null, henceThe bounded truncation ensures that only integrable indicator functions are used with the stated comparison rule.
False. Let be the indicator of the positive integers. It is measurable, bounded by one and zero almost everywhere, so its Lebesgue integral on is zero. Yet for every positive integer , so it does not tend to zero at infinity. Lebesgue integrability is unchanged by modifications on a null set, whereas a pointwise limit can change.
Use the nonnegative parts and , so . The zero-mean assumption gives . On the -th period, each of the positive and negative weighted integrals lies between and . Their difference therefore satisfies the stronger estimateThe sum of the absolute values of these block integrals converges, proving the existence of the finite limit of the integrals from to .
For genuine Lebesgue integrability we instead need the integral of the absolute value. Periodicity givesIf , summation diverges by the harmonic series. If , then almost everywhere and the function is integrable. ThusThe finite signed block limit therefore need not be a Lebesgue integral.
Prékopa–Leindler inequality Created 2026-10-06 Updated 2026-11-05
In the finite, nonzero normalization, let , let be nonnegative integrable functions on with , and let be a nonnegative measurable function. If they satisfy for all , then their Lebesgue integrals obeyThe quantile derivative identity and monotone substitution inequality prove the one-dimensional case; Tonelli theorem extends it by induction. It implies the Brunn–Minkowski inequality.
Signed area under a graph 2026-10-14
For and a real-valued function with a finite Riemann integral or Lebesgue integral on , the signed area under a graph is its definite integral: geometric area above the horizontal axis contributes positively, and geometric area below it contributes negatively. If these two nonnegative areas are and , thenThe second expression is the total geometric area under a graph. Taking the absolute value of the first expression does not usually give the second: cancellation has already removed information about how much area lies on each side.[ref]
For an exact example, take the polynomial function on . Its polynomial roots are and : it is negative between them and positive on the two outer intervals. An antiderivative is , so the fundamental theorem of calculus givesThus and . The signed area under a graph is , whereas the total geometric area under a graph is . To compute the latter with antiderivatives, split at each sign-changing polynomial root and reverse the sign of the negative contribution.
The polynomial x squared minus one has signed integral 4/3 and total geometric area 4 on the interval from minus two to two
. Details. Cancellation is useful information when the integrand represents a signed contribution. For the polynomial function on , the two triangular areas give , although . Zero net signed area therefore means balanced positive and negative contributions, rather than an empty region.
The short algebraic justification uses the positive part and negative part : and . Their integrals give and , and linearity of integration gives the difference and sum formulas. For Lebesgue integration, require both contributions to be finite to avoid the undefined subtraction .[ref]
Simple function Created 2026-09-29 Updated 2026-10-14
A simple function is a measurable function whose image is a finite set. Its value sets form a finite measurable partition. For nonnegative , its Lebesgue integral is , with the convention . The pieces need not be intervals, or even connected sets. See MIT lecture 10, Definitions 100 and 106.
For example, on let be on , on , and on . Its Lebesgue integral is . Its superlevel sets have Lebesgue measure for , for , and thereafter. The layer cake representation gives the same answer: . These two calculations are the building blocks of the general Lebesgue integral.
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.
If a probability distribution has a probability density function , then every singleton has zero probability mass andFor 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, soFor 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.
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 isThe events and coincide because takes integer values. Thus the strict sum starts at zero, while the inclusive sum starts at one.[ref]
Random: Probability, Mathematical Statistics, Stochastic Processes by Kyle Siegrist. Expected Value, §2 Additional Properties, Right Distribution Function: nonnegative tail integral and integer-valued tail sums
For an original example, let the probability mass function of beIts 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.
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.
The proof counts layers of each outcome. For a realized value , the indicator function equals one over an interval of length , soTonelli 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]
Random: Probability, Mathematical Statistics, Stochastic Processes by Kyle Siegrist. Expected Value, §2 Additional Properties, A General Definition: positive and negative parts and the condition on their expectations
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.
Volterra power-kernel integral 2026-10-31
For nonnegative Lebesgue measurable on , the displayed Volterra power-kernel integral is defined for every as a nonnegative extended Lebesgue integral. The factor is finite and continuous on the open integration interval , and an endpoint value can be assigned arbitrarily. The result may initially be infinite; for example makes every value infinite. At , it reduces to the ordinary Volterra operator.
For joint integration, use the integral kernel on and zero elsewhere. This piecewise prescription avoids the singular diagonal and never raises a negative number to a noninteger power. The L1 bound for a Volterra power-kernel integral gives an integrable output, finite almost everywhere, whenever is integrable.




