How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Independent sums via characteristic functions
Example
Assume AC. A sum of mutually independent Bernoulli variables, , has Binomial law. Independent Poisson and Poisson variables, , sum to Poisson. A finite independent family with laws , , has sum law . Empty sums are zero.
Facts & Assumptions
Given: The hypotheses and conventions in the example.
Mutual independence gives the product rule, and affine maps give phase and frequency scaling. Characteristic functions under affine maps and independent sums.
Under AC equal characteristic functions give equal laws. Uniqueness of a law from its characteristic function.
AC covers uniqueness and normal normalization/integration. The Axiom of Choice.
The finite binomial theorem evaluates discrete transforms. The binomial theorem over the complex field.
The complex exponential series is absolutely convergent. The complex exponential series converges absolutely for every complex argument.
Exponential multiplication adds the arguments. , and the complex exponential extends the real exponential.
The standard normal density has mass one under AC. The standard normal density has total mass one.
A general normal law is an affine image of the standard normal. Standard normal and normal laws.
Dominated sequences have convergent integrals. Dominated convergence.
Compact integration by parts applies with integrable derivatives. If are differentiable on with integrable, then .
Countable choice supplies the compact integral bridge. A bounded Riemann integrable function on a closed bounded interval is Lebesgue measurable and has the same integral.
A primitive evaluates the integral of its integrable derivative. The second fundamental theorem: if is differentiable on with and is integrable, then .
Exponential differentiates to itself. The exponential function is smooth and .
For real arguments, and . The derivatives of sine and cosine are cosine and minus sine.
Differentiation of a composition uses the product of derivatives. The chain rule, in one line from Carathéodory: if is differentiable at and is differentiable at , then is differentiable at with .
Zero real derivative on the real interval implies constancy. A function continuous on an interval whose derivative vanishes at every interior point of is constant on ; consequently two such functions with the same derivative differ by a constant.
Nonnegative truncations recover a full integral. Monotone convergence for the integral.
For nonnegative measurable test functions, integration against a density is integration of the product. Integrating against a density agrees with integrating the product.
Finite first absolute moment gives the first transform derivative. Moments give derivatives of the characteristic function.
Nonnegative weighted sums construct the discrete laws. Nonnegative scalar multiples and countable weighted sums of measures are measures.
Dirac masses are probability measures. A Dirac set function is a probability measure.
For real , and . , , and .
Real derivatives obey the sum, scalar-multiple and product rules. Sums, scalar multiples, products and quotients: , , , and when .
Verification
The Bernoulli transform is . Binomial weights are nonnegative and sum to one by the binomial theorem; they define a weighted Dirac probability, and the same finite expansion gives transform . Here every zeroth power means the empty product one, including parameter endpoints. The product rule for the given independent variables yields exactly this transform for their sum, so uniqueness gives its binomial law.
By [F22], for real . For , the weights sum to and define a probability. Truncating its exponential integrand to the integers gives bounded functions of modulus at most one converging almost everywhere, so DCT identifies the transform with the absolutely convergent series Multiplying the transforms at a=lambda and a=eta gives , the transform of the constructed Poisson law. Independence and uniqueness establish the claim, also when either parameter is zero.
For the normal calculation set , which has mass one. Its derivative is . On each half of , FTC gives . The bridge and monotone convergence prove the first absolute moment finite. If a complex test satisfies , apply [F18] to the four nonnegative functions and reassemble the finite integrals componentwise; hence . Applying this first to and then to , whose absolute values are and , the moments lemma gives . For fixed real , [F22] writes ; [F14, F15, F23] therefore give , also for . Compact integration by parts in both real components gives Both differentiated functions have continuous derivatives on the compact interval. The boundary is bounded by , while and g dominate the integrands; DCT yields . The real and imaginary derivatives of are therefore zero by the product and chain rules, so both components are constant. Since , .
The normal definition and affine identity now give transform for each input. Its product is , exactly the transform of ; the nonnegative square root of the variance sum is the scale in that definition. Uniqueness proves the result. If all variances vanish, each input is constant and the result is the corresponding Dirac law; empty sums give , and one-term sums return the original law. Bernoulli p=0 and p=1 similarly give deterministic zero and n. AC is inherited from Fourier uniqueness and from normal normalization and the compact integral bridge; no companion example is a supplier.
Depends on
- Characteristic functions under affine maps and independent sums
- Uniqueness of a law from its characteristic function
- The Axiom of Choice
- The binomial theorem over the complex field
- The complex exponential series converges absolutely for every complex argument
- $\exp(z+w)=\exp z\,\exp w$, and the complex exponential extends the real exponential
- The standard normal density has total mass one
- Standard normal and normal laws
- Dominated convergence
- If $u,v$ are differentiable on $[a,b]$ with $u',v'$ integrable, then $\int_a^b u v' = u(b)v(b)-u(a)v(a) - \int_a^b u'v$
- A bounded Riemann integrable function on a closed bounded interval is Lebesgue measurable and has the same integral
- The second fundamental theorem: if $G$ is differentiable on $[a,b]$ with $G' = f$ and $f$ is integrable, then $\int_a^b f = G(b)-G(a)$
- The exponential function is smooth and $(\exp)'=\exp$
- The derivatives of sine and cosine are cosine and minus sine
- The chain rule, in one line from Carathéodory: if $g$ is differentiable at $c$ and $f$ is differentiable at $g(c)$, then $f \circ g$ is differentiable at $c$ with $(f \circ g)'(c) = f'(g(c))\,g'(c)$
- A function continuous on an interval $I$ whose derivative vanishes at every interior point of $I$ is constant on $I$; consequently two such functions with the same derivative differ by a constant
- Monotone convergence for the integral
- Integrating against a density agrees with integrating the product
- Moments give derivatives of the characteristic function
- Nonnegative scalar multiples and countable weighted sums of measures are measures
- A Dirac set function is a probability measure
- $\exp(x+iy)=e^x(\cos y+i\sin y)$, $|\exp(x+iy)|=e^x$, and $e^{i\pi}+1=0$
- Sums, scalar multiples, products and quotients: $(f+g)'(c) = f'(c) + g'(c)$, $(\alpha f)'(c) = \alpha f'(c)$, $(fg)'(c) = f'(c)g(c) + f(c)g'(c)$, and $(f/g)'(c) = \bigl(f'(c)g(c) - f(c)g'(c)\bigr)/g(c)^{2}$ when $g(c) \ne 0$
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
120 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Durrett, Probability: Theory and Examples, fifth edition (standard reference, not scraped)
- Norris, Probability and Measure (standard reference, not scraped)