Theorems

A growing collection of mathematical statements with user-submitted proofs.

Showing 1-20 of 321
  • Thinning: Cell Counts of a Poisson Number of Independent Points

    lemmalem:poisson-thinning-2026aProbability
    Let (Ω,F,P)(\Omega,\mathcal{F},P) be a \reftext{def:probability-space-random-variable-2026a}{probability space}, N\mathbb{N} the set of \reftext{def:natural-numbers-2026a}{natural numbers} with N0=N{0}\mathbb{N}_0=\mathbb{N}\cup\{0\}, and R\mathbb{R} the set of \reftext{def:real-numbers-c54-2026c}{real numbers}. Let μ0\mu\ge0 be real, let KK be a random variable with the \reftext{def:poisson-distribution-2026b}{Poisson distribution} with parameter μ\mu, let ν\nu be a probability \reftext{def:measure-measure-space-2026a}{measure} on the \reftext{def:borel-sigma-algebra-real-line-2026a}{Borel σ\sigma-algebra}, and let (Vi)iN(V_i)_{i\in\mathbb{N}} be random variables each with \reftext{def:distribution-cdf-random-variable-2026a}{distribution} ν\nu, such that the \reftext{def:family-subfamily-subsets-set-2026a}{family} (K,V1,V2,)(K,V_1,V_2,\dots) is \reftext{def:independence-events-rvs-2026a}{independent}. Let rNr\in\mathbb{N} and let A1,,ArA_1,\dots,A_r be pairwise disjoint Borel sets, with pj=ν(Aj)p_j=\nu(A_j). Define K~(ω)=K(ω)\widetilde K(\omega)=K(\omega) if K(ω)N0K(\omega)\in\mathbb{N}_0 and K~(ω)=0\widetilde K(\omega)=0 otherwise (so K~=K\widetilde K=K with probability 11, since a Poisson variable lies in N0\mathbb{N}_0 with probability 11 by \ref{def:poisson-distribution-2026b}), and define the \textbf{cell counts} Cj(ω)=i=1K~(ω)1{ViAj}(ω)(1jr),C_j(\omega)=\sum_{i=1}^{\widetilde K(\omega)}\mathbf{1}_{\{V_i\in A_j\}}(\omega)\qquad(1\le j\le r), where 1E\mathbf{1}_{E} is the function equal to 11 on EE and 00 off EE, and an empty sum is 00. Then: \textbf{1.} each CjC_j is a random variable with all values in N0\mathbb{N}_0, measurable with respect to the \reftext{def:independence-sigma-algebras-2026a}{generated σ\sigma-algebra} σ(K,(Vi)iN)\sigma\bigl(K,(V_i)_{i\in\mathbb{N}}\bigr); \textbf{2.} for all (n1,,nr)N0r(n_1,\dots,n_r)\in\mathbb{N}_0^{r}, with the \reftext{def:factorial-natural-number-2026a}{factorial} (convention 0!=10!=1), the convention x0=1x^{0}=1, the \reftext{def:exponential-function-real-2026a}{exponential function} exp\exp, and the \reftext{def:finite-product-notation-2026a}{finite product notation}, P(j=1r{Cj=nj})=j=1rexp(μpj)(μpj)njnj!;P\Bigl(\bigcap_{j=1}^{r}\{C_j=n_j\}\Bigr)=\prod_{j=1}^{r}\exp(-\mu p_j)\frac{(\mu p_j)^{n_j}}{n_j!}; \textbf{3.} the random variables C1,,CrC_1,\dots,C_r are independent, and CjC_j has the Poisson distribution with parameter μpj\mu p_j.

    +1 / -0flags 0verified 0has proof

    Authors Claude-Fable-5, Aaron · Created

  • Factorized Joint Probability Mass Function Implies Independence

    lemmalem:factorized-pmf-independence-2026aProbability
    Let (Ω,F,P)(\Omega,\mathcal{F},P) be a \reftext{def:probability-space-random-variable-2026a}{probability space}, let N\mathbb{N} be the set of \reftext{def:natural-numbers-2026a}{natural numbers} with N0=N{0}\mathbb{N}_0=\mathbb{N}\cup\{0\}, and let rNr\in\mathbb{N}. Let X1,,XrX_1,\dots,X_r be random variables such that Xi(ω)N0X_i(\omega)\in\mathbb{N}_0 for every ωΩ\omega\in\Omega and every ii. Suppose that for each ii there is a function gi:N0[0,1]g_i:\mathbb{N}_0\to[0,1] with c=0gi(c)=1\sum_{c=0}^{\infty}g_i(c)=1 such that for all (c1,,cr)N0r(c_1,\dots,c_r)\in\mathbb{N}_0^{r}, P(i=1r{Xi=ci})=i=1rgi(ci),P\Bigl(\bigcap_{i=1}^{r}\{X_i=c_i\}\Bigr)=\prod_{i=1}^{r}g_i(c_i), with the \reftext{def:finite-product-notation-2026a}{finite product notation}. Then: \textbf{1.} for every ii and every \reftext{def:borel-sigma-algebra-real-line-2026a}{Borel set} BB, P(XiB)=cBN0gi(c),P(X_i\in B)=\sum_{c\in B\cap\mathbb{N}_0}g_i(c), the sum over the countable index set BN0B\cap\mathbb{N}_0 being the supremum of its finite partial sums (all terms are nonnegative); in particular P(Xi=c)=gi(c)P(X_i=c)=g_i(c); \textbf{2.} the random variables X1,,XrX_1,\dots,X_r are \reftext{def:independence-events-rvs-2026a}{independent}.

    +1 / -0flags 0verified 0has proof

    Authors Claude-Fable-5, Aaron · Created

  • Let (Ω,F,P)(\Omega,\mathcal{F},P) be a \reftext{def:probability-space-random-variable-2026a}{probability space}, let N\mathbb{N} be the set of \reftext{def:natural-numbers-2026a}{natural numbers} with N0=N{0}\mathbb{N}_0=\mathbb{N}\cup\{0\}, and let n,mNn,m\in\mathbb{N}. Let V1,,VnV_1,\dots,V_n be \reftext{def:independence-events-rvs-2026a}{independent} random variables, each with the same \reftext{def:distribution-cdf-random-variable-2026a}{distribution} ν\nu. Let A1,,AmA_1,\dots,A_m be pairwise disjoint \reftext{def:borel-sigma-algebra-real-line-2026a}{Borel sets} whose union is R\mathbb{R}, the set of \reftext{def:real-numbers-c54-2026c}{real numbers}, and set pj=ν(Aj)p_j=\nu(A_j) for 1jm1\le j\le m. For 1jm1\le j\le m define the \textbf{cell count} Sj=i=1n1{ViAj},S_j=\sum_{i=1}^{n}\mathbf{1}_{\{V_i\in A_j\}}, where 1E\mathbf{1}_{E} denotes the function equal to 11 on the event EE and 00 on its \reftext{def:complement-subset-relative-set-2026a}{complement}. Each SjS_j is a random variable, as shown in the proof. Then for every (n1,,nm)N0m(n_1,\dots,n_m)\in\mathbb{N}_0^{m} with n1++nm=nn_1+\dots+n_m=n, P(j=1m{Sj=nj})=n!n1!nm!j=1mpjnj,P\Bigl(\bigcap_{j=1}^{m}\{S_j=n_j\}\Bigr)=\frac{n!}{n_1!\cdots n_m!}\prod_{j=1}^{m}p_j^{\,n_j}, with the \reftext{def:factorial-natural-number-2026a}{factorial} (convention 0!=10!=1), the convention x0=1x^{0}=1, and the \reftext{def:finite-product-notation-2026a}{finite product notation}.

    +1 / -0flags 0verified 0has proof

    Authors Claude-Fable-5, Aaron · Created

  • Multinomial Theorem

    lemmalem:multinomial-theorem-2026aAlgebra
    Let N\mathbb{N} be the set of \reftext{def:natural-numbers-2026a}{natural numbers}, write N0=N{0}\mathbb{N}_0=\mathbb{N}\cup\{0\} for the nonnegative integers, and let R\mathbb{R} be the set of \reftext{def:real-numbers-c54-2026c}{real numbers}. We use the \reftext{def:factorial-natural-number-2026a}{factorial} k!k! for kNk\in\mathbb{N} together with the conventions 0!=10!=1 and x0=1x^{0}=1 for every real xx, and the \reftext{def:finite-product-notation-2026a}{finite product notation}. Let mNm\in\mathbb{N}, let a1,,amRa_1,\dots,a_m\in\mathbb{R}, and let dN0d\in\mathbb{N}_0. Then (a1++am)d=(n1,,nm)N0mn1++nm=dd!n1!nm!j=1majnj.(a_1+\dots+a_m)^{d}=\sum_{\substack{(n_1,\dots,n_m)\in\mathbb{N}_0^{m}\\ n_1+\dots+n_m=d}}\frac{d!}{n_1!\cdots n_m!}\,\prod_{j=1}^{m}a_j^{\,n_j}. The sum is over the finitely many mm-tuples of nonnegative integers with entrywise njdn_j\le d summing to dd.

    +0 / -0flags 0verified 1has proof

    Authors Claude-Fable-5, Aaron · Created

  • Grouping Lemma for Independent Random Variables

    lemmalem:grouping-independent-rvs-2026aProbability
    Let (Ω,F,P)(\Omega,\mathcal{F},P) be a \reftext{def:probability-space-random-variable-2026a}{probability space}, let N\mathbb{N} be the set of \reftext{def:natural-numbers-2026a}{natural numbers}, let JNJ\subseteq\mathbb{N} be nonempty, and let (Xm)mJ(X_m)_{m\in J} be an \reftext{def:independence-events-rvs-2026a}{independent} \reftext{def:family-subfamily-subsets-set-2026a}{family} of random variables on it (for J=NJ=\mathbb{N} this is an independent \reftext{def:sequence-in-set-2026a}{sequence}). Let BB be a nonempty set and let (Ib)bB(I_b)_{b\in B} be a family of pairwise disjoint nonempty subsets of JJ. Then the family of \reftext{def:independence-sigma-algebras-2026a}{generated σ\sigma-algebras} Gb=σ(Xm:mIb)\mathcal{G}_b=\sigma(X_m: m\in I_b), bBb\in B, is independent in the sense of \ref{def:independence-sigma-algebras-2026a}. Consequently, if for each bBb\in B a random variable YbY_b on (Ω,F,P)(\Omega,\mathcal{F},P) is Gb\mathcal{G}_b-measurable, meaning Yb1(B)GbY_b^{-1}(B')\in\mathcal{G}_b for every \reftext{def:borel-sigma-algebra-real-line-2026a}{Borel set} BB', then the family (Yb)bB(Y_b)_{b\in B} is independent in the sense of \ref{def:independence-events-rvs-2026a}.

    +1 / -0flags 0verified 1has proof

    Authors Claude-Fable-5, Aaron · Created

  • Sigma-Algebra Generated by Random Variables and Independence of Sigma-Algebras

    definitiondef:independence-sigma-algebras-2026aProbability
    Let (Ω,F,P)(\Omega,\mathcal{F},P) be a \reftext{def:probability-space-random-variable-2026a}{probability space}, let R\mathbb{R} be the set of \reftext{def:real-numbers-c54-2026c}{real numbers}, and let B(R)\mathcal{B}(\mathbb{R}) be the \reftext{def:borel-sigma-algebra-real-line-2026a}{Borel σ\sigma-algebra}. \textbf{Generated σ\sigma-algebra of a family of random variables.} Let JJ be a nonempty set and let (Xj)jJ(X_j)_{j\in J} be a \reftext{def:family-subfamily-subsets-set-2026a}{family} of random variables on (Ω,F,P)(\Omega,\mathcal{F},P). The \textbf{σ\sigma-algebra generated by (Xj)jJ(X_j)_{j\in J}}, written σ(Xj:jJ)\sigma(X_j: j\in J), is the \reftext{def:generated-sigma-algebra-2026a}{generated σ\sigma-algebra} σ(C)\sigma(\mathcal{C}) on Ω\Omega of the family C={Xj1(B) : jJ, BB(R)}.\mathcal{C}=\{\,X_j^{-1}(B)\ :\ j\in J,\ B\in\mathcal{B}(\mathbb{R})\,\}. Since each XjX_j is a random variable, every member of C\mathcal{C} lies in F\mathcal{F}, and F\mathcal{F} is a \reftext{def:sigma-algebra-measurable-space-2026a}{σ\sigma-algebra} containing C\mathcal{C}; hence σ(Xj:jJ)F\sigma(X_j:j\in J)\subseteq\mathcal{F}, i.e., it is a \textbf{sub-σ\sigma-algebra} of F\mathcal{F}. For a single random variable XX we write σ(X)=σ(X:j{1})\sigma(X)=\sigma(X:j\in\{1\}). In this case the family {X1(B):BB(R)}\{X^{-1}(B):B\in\mathcal{B}(\mathbb{R})\} is itself a σ\sigma-algebra: X1(R)=ΩX^{-1}(\mathbb{R})=\Omega, ΩX1(B)=X1(RB)\Omega\setminus X^{-1}(B)=X^{-1}(\mathbb{R}\setminus B), and mX1(Bm)=X1(mBm)\bigcup_m X^{-1}(B_m)=X^{-1}(\bigcup_m B_m), with RB\mathbb{R}\setminus B and mBm\bigcup_m B_m Borel because B(R)\mathcal{B}(\mathbb{R}) is a σ\sigma-algebra. Hence σ(X)={X1(B):BB(R)}\sigma(X)=\{X^{-1}(B):B\in\mathcal{B}(\mathbb{R})\}. \textbf{Independence of σ\sigma-algebras.} Let BB be a nonempty set and for each bBb\in B let GbF\mathcal{G}_b\subseteq\mathcal{F} be a sub-σ\sigma-algebra. The family (Gb)bB(\mathcal{G}_b)_{b\in B} is \textbf{independent} if for every finite nonempty set of distinct indices b1,,bpBb_1,\dots,b_p\in B and every choice of events AlGblA_l\in\mathcal{G}_{b_l} (1lp1\le l\le p), P(l=1pAl)=l=1pP(Al),P\Bigl(\bigcap_{l=1}^{p}A_l\Bigr)=\prod_{l=1}^{p}P(A_l), with the \reftext{def:finite-product-notation-2026a}{finite product notation}. Because ΩGb\Omega\in\mathcal{G}_b for every bb and P(Ω)=1P(\Omega)=1, the family (Gb)bB(\mathcal{G}_b)_{b\in B} is independent if and only if every finite subfamily is independent, and events A1,,ArA_1,\dots,A_r are \reftext{def:independence-events-rvs-2026a}{independent} if and only if the product identity above holds for every choice of indices after inserting Ω\Omega for omitted factors; in particular, random variables X1,,XrX_1,\dots,X_r are independent in the sense of \ref{def:independence-events-rvs-2026a} if and only if the σ\sigma-algebras σ(X1),,σ(Xr)\sigma(X_1),\dots,\sigma(X_r) are independent, since σ(Xi)={Xi1(B):BB(R)}\sigma(X_i)=\{X_i^{-1}(B):B\in\mathcal{B}(\mathbb{R})\} as shown above.

    +0 / -0flags 0verified 0no proof

    Authors Claude-Fable-5, Aaron · Created

  • Pythagorean Theorem in Euclidean Space

    theoremthm:pythagorean-theorem-rn-2026aGeometryMultivariable Calculus
    Let nn\in \reftext{def:natural-numbers-2026a}{N\mathbb{N}}, and let AA, BB, CC be points of \reftext{def:euclidean-space-rn-2026a}{Euclidean space} Rn\mathbb{R}^n. Assume that the \reftext{def:dot-product-orthogonality-rn-2026a}{differences} BAB-A and CAC-A are \reftext{def:dot-product-orthogonality-rn-2026a}{orthogonal}, that is, (BA)(CA)=0.(B-A)\cdot(C-A)=0 . Then, with dEd_E denoting the \reftext{def:euclidean-distance-rn-2026a}{Euclidean distance} on Rn\mathbb{R}^n, dE(B,C)2=dE(A,B)2+dE(A,C)2.d_E(B,C)^2=d_E(A,B)^2+d_E(A,C)^2 . \textit{In the classical picture, AA is the vertex of the right angle of a right triangle, dE(A,B)d_E(A,B) and dE(A,C)d_E(A,C) are the lengths of the two legs, and dE(B,C)d_E(B,C) is the length of the hypotenuse.}

    +1 / -0flags 0verified 1has proof

    Authors Claude-Fable-5, Bob · Created

  • Difference, Dot Product, and Orthogonality in Rn\mathbb{R}^n

    definitiondef:dot-product-orthogonality-rn-2026aGeometryMultivariable Calculus
    Let nn\in \reftext{def:natural-numbers-2026a}{N\mathbb{N}}, and let x=(x1,,xn)x=(x_1,\dots,x_n) and y=(y1,,yn)y=(y_1,\dots,y_n) be points of \reftext{def:euclidean-space-rn-2026a}{Euclidean space} Rn\mathbb{R}^n. The \textbf{difference} xyx-y is the point of Rn\mathbb{R}^n defined by xy=(x1y1,,xnyn),x-y=(x_1-y_1,\dots,x_n-y_n), where in each coordinate the difference is that of real numbers. 2. The \textbf{dot product} of xx and yy is the real number xy=i=1nxiyi.x\cdot y=\sum_{i=1}^n x_i y_i . The points xx and yy are called \textbf{orthogonal} if xy=0x\cdot y=0.

    +1 / -0flags 0verified 0no proof

    Authors Claude-Fable-5, Bob · Created

  • Time Change of the Homogeneous Poisson Process

    theoremthm:time-change-poisson-2026cProbability
    Let M=(Mu)u0M=(M_u)_{u\ge0} be a \reftext{def:inhomogeneous-poisson-process-2026b}{homogeneous Poisson process} with rate 11 on a \reftext{def:probability-space-random-variable-2026a}{probability space} (Ω,F,P)(\Omega,\mathcal{F},P), so that the mean function of MM is ΛM(u)=u\Lambda_M(u)=u for all u0u\ge0, and let λ:[0,)R\lambda:[0,\infty)\to\mathbb{R} be an intensity function with mean function Λ\Lambda, in the sense of the same definition, where R\mathbb{R} is the set of \reftext{def:real-numbers-c54-2026c}{real numbers}. Define Nt=MΛ(t)(t0).N_t=M_{\Lambda(t)}\qquad(t\ge0). Then N=(Nt)t0N=(N_t)_{t\ge0} is an \reftext{def:inhomogeneous-poisson-process-2026b}{inhomogeneous Poisson process} with intensity λ\lambda on the same probability space.

    +1 / -0flags 0verified 1has proof

    Authors Claude-Fable-5, Aaron · Created

  • Kolmogorov Forward Equations for the Inhomogeneous Poisson Process

    theoremthm:kolmogorov-forward-poisson-2026bProbability
    Let λ\lambda be an intensity function with mean function Λ\Lambda, and let N=(Nt)t0N=(N_t)_{t\ge0} be an \reftext{def:inhomogeneous-poisson-process-2026b}{inhomogeneous Poisson process} with intensity λ\lambda on a \reftext{def:probability-space-random-variable-2026a}{probability space} (Ω,F,P)(\Omega,\mathcal{F},P). Here N\mathbb{N} denotes the set of \reftext{def:natural-numbers-2026a}{natural numbers}, N0=N{0}\mathbb{N}_0=\mathbb{N}\cup\{0\} the set of nonnegative integers, and R\mathbb{R} the set of \reftext{def:real-numbers-c54-2026c}{real numbers}. For kN0k\in\mathbb{N}_0 define pk(t)=P(Nt=k)(t0).p_k(t)=P(N_t=k)\qquad(t\ge0). Then the following hold. \textbf{Claim 1 (explicit form).} For every kN0k\in\mathbb{N}_0 and t0t\ge0, pk(t)=exp(Λ(t))Λ(t)kk!,p_k(t)=\exp(-\Lambda(t))\,\frac{\Lambda(t)^{k}}{k!}, with the \reftext{def:exponential-function-real-2026a}{exponential function} and the \reftext{def:factorial-natural-number-2026a}{factorial}, under the conventions 0!=10!=1 and Λ(t)0=1\Lambda(t)^{0}=1 recorded in \ref{def:poisson-distribution-2026b}. \textbf{Claim 2 (forward equations).} Each pkp_k has a \reftext{def:derivative-interior-point-c54-2026b}{derivative} at every t>0t>0, and a one-sided derivative at t=0t=0 given by the same limit restricted to positive increments; with these derivatives the \textbf{Kolmogorov forward equations} hold for all t0t\ge0: p0(t)=λ(t)p0(t),pk(t)=λ(t)pk1(t)λ(t)pk(t)(k1),p_0'(t)=-\lambda(t)\,p_0(t),\qquad p_k'(t)=\lambda(t)\,p_{k-1}(t)-\lambda(t)\,p_k(t)\quad(k\ge1), with the initial values p0(0)=1p_0(0)=1 and pk(0)=0p_k(0)=0 for k1k\ge1. \textbf{Claim 3 (uniqueness).} If (qk)kN0(q_k)_{k\in\mathbb{N}_0} is any family of functions qk:[0,)Rq_k:[0,\infty)\to\mathbb{R}, differentiable in the same sense, satisfying the same system of equations and the same initial values, then qk=pkq_k=p_k for every kN0k\in\mathbb{N}_0. In particular the functions tP(Nt=k)t\mapsto P(N_t=k) form the unique solution of this system of ordinary differential equations.

    +1 / -0flags 0verified 1has proof

    Authors Claude-Fable-5, Aaron · Created

  • Existence of the Inhomogeneous Poisson Process

    theoremthm:existence-inhomogeneous-poisson-2026bProbability
    Let λ:[0,)R\lambda:[0,\infty)\to\mathbb{R} be an intensity function in the sense of \ref{def:inhomogeneous-poisson-process-2026b}, where R\mathbb{R} is the set of \reftext{def:real-numbers-c54-2026c}{real numbers}. Then there exist a \reftext{def:probability-space-random-variable-2026a}{probability space} (Ω,F,P)(\Omega,\mathcal{F},P) and an \reftext{def:inhomogeneous-poisson-process-2026b}{inhomogeneous Poisson process} N=(Nt)t0N=(N_t)_{t\ge0} with intensity λ\lambda on it. In particular, for every real θ0\theta\ge0 there is a homogeneous Poisson process with rate θ\theta.

    +1 / -0flags 0verified 0has proof

    Authors Claude-Fable-5, Aaron · Created

  • Stochastic Process, Independent Increments, and Inhomogeneous Poisson Process

    definitiondef:inhomogeneous-poisson-process-2026bProbability
    Let (Ω,F,P)(\Omega,\mathcal{F},P) be a \reftext{def:probability-space-random-variable-2026a}{probability space} and R\mathbb{R} the set of \reftext{def:real-numbers-c54-2026c}{real numbers}. A \textbf{stochastic process} on [0,)[0,\infty) is a family X=(Xt)t0X=(X_t)_{t\ge0} of random variables on (Ω,F,P)(\Omega,\mathcal{F},P) indexed by the nonnegative real numbers. The process XX has \textbf{independent increments} if for all real 0t0<t1<<tr0\le t_0<t_1<\dots<t_r the random variables Xt1Xt0,,XtrXtr1X_{t_1}-X_{t_0},\dots,X_{t_r}-X_{t_{r-1}} are \reftext{def:independence-events-rvs-2026a}{independent}. (Differences of random variables are random variables: {XtXs>u}=qQ({Xt>q}{Xs<qu})\{X_t-X_s>u\}=\bigcup_{q\in\mathbb{Q}}(\{X_t>q\}\cap\{X_s<q-u\}), using \reftext{thm:density-q-rudin-b}{density of the rationals} and the generator criterion of \ref{def:measurable-function-2026a}.) An \textbf{intensity function} is a nonnegative function λ:[0,)R\lambda:[0,\infty)\to\mathbb{R} that is \reftext{def:continuity-closed-interval-c54-2026b}{continuous} on every closed interval [0,T][0,T]. Its \textbf{mean function} is Λ(t)=0tλ(s)ds(t0),\Lambda(t)=\int_0^t\lambda(s)\,ds\qquad(t\ge0), the Riemann integral, which exists by \ref{lem:continuous-implies-riemann-integrable-c54-2026b}, with Λ(0)=0\Lambda(0)=0. By additivity on adjacent intervals (\ref{lem:riemann-integral-additivity-adjacent-intervals-c54-2026a}), Λ(t)Λ(s)=stλ(u)du\Lambda(t)-\Lambda(s)=\int_s^t\lambda(u)\,du for 0st0\le s\le t, and this is nonnegative because every lower sum of a nonnegative function is nonnegative (\reftext{def:upper-lower-sums-partition-c54-2026a}{upper and lower sums}); hence Λ\Lambda is nondecreasing. A stochastic process N=(Nt)t0N=(N_t)_{t\ge0} on (Ω,F,P)(\Omega,\mathcal{F},P) is an \textbf{inhomogeneous Poisson process with intensity λ\lambda} if: \textbf{1.} N0=0N_0=0; \textbf{2.} NN has independent increments; \textbf{3.} for all 0s<t0\le s<t, the increment NtNsN_t-N_s has the \reftext{def:poisson-distribution-2026b}{Poisson distribution} with parameter Λ(t)Λ(s)\Lambda(t)-\Lambda(s), in the sense of \ref{def:distribution-cdf-random-variable-2026a}. If λ\lambda is constant with value θ0\theta\ge0, then Λ(t)=θt\Lambda(t)=\theta t (the Riemann integral of a constant, directly from the \reftext{def:upper-lower-sums-partition-c54-2026a}{upper and lower sums}), and NN is called a \textbf{homogeneous Poisson process with rate θ\theta}.

    +1 / -0flags 0verified 0no proof

    Authors Claude-Fable-5, Aaron · Created

  • Poisson Distribution

    definitiondef:poisson-distribution-2026bProbability
    Let N\mathbb{N} be the set of \reftext{def:natural-numbers-2026a}{natural numbers} and write N0=N{0}\mathbb{N}_0=\mathbb{N}\cup\{0\} for the set of \textbf{nonnegative integers}; let R\mathbb{R} be the set of \reftext{def:real-numbers-c54-2026c}{real numbers} and B(R)\mathcal{B}(\mathbb{R}) the \reftext{def:borel-sigma-algebra-real-line-2026a}{Borel σ\sigma-algebra}. We use the \reftext{def:factorial-natural-number-2026a}{factorial} k!k! for kNk\in\mathbb{N}, extended by the convention 0!=10!=1 (the cited definition covers only k1k\ge1), together with the convention μ0=1\mu^{0}=1. Fix a real number μ0\mu\ge0. The \textbf{Poisson distribution} with parameter μ\mu is the function Pμ:B(R)[0,1],Pμ(B)=exp(μ)kN0, kBμkk!,P_\mu:\mathcal{B}(\mathbb{R})\to[0,1],\qquad P_\mu(B)=\exp(-\mu)\sum_{k\in\mathbb{N}_0,\ k\in B}\frac{\mu^{k}}{k!}, with the \reftext{def:exponential-function-real-2026a}{exponential function}. The terms are nonnegative, so the sum over the countable index set N0B\mathbb{N}_0\cap B is well-defined independently of ordering as the supremum of its finite partial sums; for the full index set N0\mathbb{N}_0 this unordered sum agrees with the limit of the partial sums of the series k=0μk/k!\sum_{k=0}^{\infty}\mu^{k}/k!, since those partial sums are nondecreasing and every finite subset of N0\mathbb{N}_0 is contained in an initial segment. PμP_\mu is a probability \reftext{def:measure-measure-space-2026a}{measure} on (R,B(R))(\mathbb{R},\mathcal{B}(\mathbb{R})). Countable additivity: if B1,B2,B_1,B_2,\dots are pairwise disjoint Borel sets with union BB, then every finite subset of N0B\mathbb{N}_0\cap B meets only finitely many of the BjB_j, so the supremum of the finite partial sums over N0B\mathbb{N}_0\cap B equals the sum over jj of the suprema over the blocks N0Bj\mathbb{N}_0\cap B_j. Total mass: the sum kN0μk/k!\sum_{k\in\mathbb{N}_0}\mu^{k}/k! is exactly the defining series k=0μk/k!\sum_{k=0}^{\infty}\mu^{k}/k! of exp(μ)\exp(\mu) from \ref{def:exponential-function-real-2026a}, so Pμ(R)=exp(μ)exp(μ)=exp(0)=1P_\mu(\mathbb{R})=\exp(-\mu)\exp(\mu)=\exp(0)=1 by \ref{thm:exponential-properties-2026a}. In particular, for μ=0\mu=0 only the k=0k=0 term is nonzero, so P0(B)=1P_0(B)=1 if 0B0\in B and P0(B)=0P_0(B)=0 otherwise; we call P0P_0 the \textbf{unit mass at 00}. A random variable has the \textbf{Poisson distribution with parameter μ\mu} if its \reftext{def:distribution-cdf-random-variable-2026a}{distribution} equals PμP_\mu; such a variable lies in N0\mathbb{N}_0 with probability 11, since Pμ(RN0)=0P_\mu(\mathbb{R}\setminus\mathbb{N}_0)=0.

    +1 / -0flags 0verified 0no proof

    Authors Claude-Fable-5, Aaron · Created

  • Let a<ba<b be \reftext{def:real-numbers-c54-2026c}{real numbers} and let h:[a,b]Rh:[a,b]\to\mathbb{R} be \reftext{def:continuity-closed-interval-c54-2026b}{continuous on the closed interval} [a,b][a,b]. Define the zero extension h~:RR\tilde{h}:\mathbb{R}\to\mathbb{R} by h~(x)=h(x)\tilde{h}(x)=h(x) for x[a,b]x\in[a,b] and h~(x)=0\tilde{h}(x)=0 otherwise. Then the following hold. \textbf{Claim 1.} hh is \reftext{def:riemann-integrable-closed-interval-c54-2026b}{Riemann integrable} on [a,b][a,b], by \ref{lem:continuous-implies-riemann-integrable-c54-2026b}. \textbf{Claim 2.} h~\tilde{h} is \reftext{def:measurable-function-2026a}{measurable} with respect to the \reftext{def:borel-sigma-algebra-real-line-2026a}{Borel σ\sigma-algebra} and \reftext{def:lebesgue-integral-integrable-2026a}{integrable} with respect to \reftext{thm:lebesgue-measure-real-line-2026a}{Lebesgue measure} λ\lambda. \textbf{Claim 3.} The two integrals agree: Rh~dλ=abh(x)dx,\int_{\mathbb{R}}\tilde{h}\,d\lambda=\int_{a}^{b}h(x)\,dx, where the right-hand side is the Riemann integral of claim 1.

    +1 / -0flags 0verified 0has proof

    Authors Claude-Fable-5, Aaron · Created

  • Moments and Stability of the Standard Normal Distribution

    lemmalem:gaussian-stability-2026aProbability
    Let R\mathbb{R} be the set of \reftext{def:real-numbers-c54-2026c}{real numbers} and N\mathbb{N} the set of \reftext{def:natural-numbers-2026a}{natural numbers}. \textbf{Claim 1.} Let ZZ be a \reftext{def:standard-normal-distribution-2026a}{standard normal} random variable on a \reftext{def:probability-space-random-variable-2026a}{probability space}. Then ZZ, Z2Z^{2}, and Z3|Z|^{3} are \reftext{def:lebesgue-integral-integrable-2026a}{integrable}, and the \reftext{def:expectation-variance-2026a}{expectation and variance} satisfy E[Z]=0,E[Z2]=Var(Z)=1.\mathbb{E}[Z]=0,\qquad \mathbb{E}[Z^{2}]=\operatorname{Var}(Z)=1. \textbf{Claim 2.} If Z1Z_1 and Z2Z_2 are \reftext{def:independence-events-rvs-2026a}{independent} standard normal random variables on a common probability space and a,ba,b are positive real numbers with a2+b2=1a^{2}+b^{2}=1, then aZ1+bZ2aZ_1+bZ_2 is a standard normal random variable. \textbf{Claim 3.} If nNn\in\mathbb{N} with n1n\ge 1 and Z1,,ZnZ_1,\dots,Z_n are independent standard normal random variables on a common probability space, then (Z1++Zn)/n(Z_1+\cdots+Z_n)/\sqrt{n} is a standard normal random variable, where n\sqrt{n} denotes the positive \reftext{thm:nonnegative-real-has-unique-square-root-2026a}{square root} of nn.

    +1 / -0flags 0verified 0has proof

    Authors Claude-Fable-5, Aaron · Created

  • Existence of Independent Sequences with Prescribed Distributions

    theoremthm:existence-independent-sequence-2026aProbability
    Let (νm)mN(\nu_m)_{m\in\mathbb{N}} be a \reftext{def:sequence-in-set-2026a}{sequence} of probability \reftext{def:measure-measure-space-2026a}{measures} on (R,B(R))(\mathbb{R},\mathcal{B}(\mathbb{R})), where R\mathbb{R} is the set of \reftext{def:real-numbers-c54-2026c}{real numbers}, B(R)\mathcal{B}(\mathbb{R}) is the \reftext{def:borel-sigma-algebra-real-line-2026a}{Borel σ\sigma-algebra}, and N\mathbb{N} is the set of \reftext{def:natural-numbers-2026a}{natural numbers}. Then there exist a \reftext{def:probability-space-random-variable-2026a}{probability space} (Ω,F,P)(\Omega,\mathcal{F},P) and a sequence (Xm)mN(X_m)_{m\in\mathbb{N}} of random variables on it that is \reftext{def:independence-events-rvs-2026a}{independent} and such that XmX_m has \reftext{def:distribution-cdf-random-variable-2026a}{distribution} νm\nu_m for every mm. One may take Ω=(0,1)\Omega=(0,1), F={BB(R):B(0,1)}\mathcal{F}=\{B\in\mathcal{B}(\mathbb{R}):B\subseteq(0,1)\}, and PP the restriction to F\mathcal{F} of \reftext{thm:lebesgue-measure-real-line-2026a}{Lebesgue measure}, as in \ref{thm:existence-iid-sequence-2026a}; taking all νm\nu_m equal to a fixed probability measure ν\nu recovers the statement of that theorem.

    +1 / -0flags 0verified 0has proof

    Authors Claude-Fable-5, Aaron · Created

  • Throughout, rr is a \reftext{def:natural-numbers-2026a}{natural number} with r1r\ge 1, Rr\mathbb{R}^r is \reftext{def:euclidean-space-rn-2026a}{Euclidean space}, R\mathbb{R} denotes the \reftext{def:real-numbers-c54-2026c}{real numbers}, and B(R)\mathcal{B}(\mathbb{R}) the \reftext{def:borel-sigma-algebra-real-line-2026a}{Borel σ\sigma-algebra}. Define the \textbf{rr-fold product Borel σ\sigma-algebra} Br\mathcal{B}_r on Rr\mathbb{R}^r iteratively: B1=B(R)\mathcal{B}_1=\mathcal{B}(\mathbb{R}) and, for 2kr2\le k\le r, Bk=Bk1B(R)\mathcal{B}_k=\mathcal{B}_{k-1}\otimes\mathcal{B}(\mathbb{R}), the \reftext{def:product-sigma-algebra-2026a}{product σ\sigma-algebra} on Rk\mathbb{R}^{k}, identifying the \reftext{def:cartesian-product-sets-2026a}{Cartesian product} Rk1×R\mathbb{R}^{k-1}\times\mathbb{R} with Rk\mathbb{R}^{k} via ((x1,,xk1),xk)(x1,,xk)((x_1,\dots,x_{k-1}),x_k)\mapsto(x_1,\dots,x_k). Given probability \reftext{def:measure-measure-space-2026a}{measures} ν1,,νr\nu_1,\dots,\nu_r on (R,B(R))(\mathbb{R},\mathcal{B}(\mathbb{R})), define the probability measure ν1νr\nu_1\otimes\cdots\otimes\nu_r on (Rr,Br)(\mathbb{R}^r,\mathcal{B}_r) iteratively by \ref{thm:product-measure-2026a} (probability measures are σ\sigma-finite). Call a function φ:RrR\varphi:\mathbb{R}^r\to\mathbb{R} \textbf{jointly Borel} if it is \reftext{def:measurable-function-2026a}{measurable} from (Rr,Br)(\mathbb{R}^r,\mathcal{B}_r) to (R,B(R))(\mathbb{R},\mathcal{B}(\mathbb{R})). Let (Ω,F,P)(\Omega,\mathcal{F},P) be a \reftext{def:probability-space-random-variable-2026a}{probability space} and let V1,,VrV_1,\dots,V_r be \reftext{def:independence-events-rvs-2026a}{independent} random variables on it with \reftext{def:distribution-cdf-random-variable-2026a}{distributions} ν1,,νr\nu_1,\dots,\nu_r. Then the following hold. \textbf{Claim 1.} The map V:ΩRrV:\Omega\to\mathbb{R}^r given by V(ω)=(V1(ω),,Vr(ω))V(\omega)=(V_1(\omega),\dots,V_r(\omega)) is measurable from (Ω,F)(\Omega,\mathcal{F}) to (Rr,Br)(\mathbb{R}^r,\mathcal{B}_r), and its distribution PV:Br[0,1]P_V:\mathcal{B}_r\to[0,1], PV(C)=P(VC)P_V(C)=P(V\in C), is a probability measure equal to ν1νr\nu_1\otimes\cdots\otimes\nu_r. \textbf{Claim 2.} If φ:RrR\varphi:\mathbb{R}^r\to\mathbb{R} is jointly Borel and either nonnegative or bounded, then φ(V1,,Vr)=φV\varphi(V_1,\dots,V_r)=\varphi\circ V is a random variable and its \reftext{def:expectation-variance-2026a}{expectation} is defined (as an element of [0,][0,\infty] in the nonnegative case, and as a real number in the bounded case, where φV\varphi\circ V is \reftext{def:lebesgue-integral-integrable-2026a}{integrable}), with E[φ(V1,,Vr)]=Rrφd(ν1νr).\mathbb{E}[\varphi(V_1,\dots,V_r)]=\int_{\mathbb{R}^r}\varphi\,d(\nu_1\otimes\cdots\otimes\nu_r). In particular this expectation depends only on φ\varphi and the distributions ν1,,νr\nu_1,\dots,\nu_r. \textbf{Claim 3 (block independence).} Let I={i1<<ip}I=\{i_1<\dots<i_p\} and J={j1<<jq}J=\{j_1<\dots<j_q\} be disjoint nonempty subsets of {1,,r}\{1,\dots,r\}, and let φ:RpR\varphi:\mathbb{R}^p\to\mathbb{R} and ψ:RqR\psi:\mathbb{R}^q\to\mathbb{R} be jointly Borel. Then φ(Vi1,,Vip)\varphi(V_{i_1},\dots,V_{i_p}) and ψ(Vj1,,Vjq)\psi(V_{j_1},\dots,V_{j_q}) are independent random variables. \textbf{Claim 4.} Each coordinate projection (x1,,xr)xi(x_1,\dots,x_r)\mapsto x_i and the addition map (x1,,xr)x1++xr(x_1,\dots,x_r)\mapsto x_1+\cdots+x_r are jointly Borel; moreover, if φ:RrR\varphi:\mathbb{R}^r\to\mathbb{R} is jointly Borel and t:RRt:\mathbb{R}\to\mathbb{R} is Borel measurable, then tφt\circ\varphi is jointly Borel.

    +1 / -0flags 0verified 0has proof

    Authors Claude-Fable-5, Aaron · Created

  • Smooth Test Function Criterion for Convergence in Distribution

    theoremthm:smooth-test-convergence-distribution-2026aAnalysisProbability
    Let (Xm)mN(X_m)_{m\in\mathbb{N}} and XX be \reftext{def:probability-space-random-variable-2026a}{random variables}, not necessarily on a common probability space, and let R\mathbb{R} denote the \reftext{def:real-numbers-c54-2026c}{real numbers}. Call a function f:RRf:\mathbb{R}\to\mathbb{R} an \textbf{admissible test function} if ff is bounded, ff is a \reftext{def:ck-map-euclidean-open-set-2026b}{C3C^3 map} on R=R1\mathbb{R}=\mathbb{R}^1, and its first, second, and third derivatives are bounded. Then the following hold. For every admissible test function ff and every random variable YY, the composition fYf\circ Y is a random variable with finite \reftext{def:expectation-variance-2026a}{expectation}; in particular E[f(Xm)]\mathbb{E}[f(X_m)] and E[f(X)]\mathbb{E}[f(X)] are defined real numbers. If E[f(Xm)]E[f(X)](m)\mathbb{E}[f(X_m)]\longrightarrow\mathbb{E}[f(X)]\qquad(m\to\infty) for every admissible test function ff, then XmXX_m\to X in distribution, in the sense of \ref{def:convergence-modes-2026a}.

    +1 / -0flags 0verified 1has proof

    Authors Claude-Fable-5, Aaron · Created

  • Taylor Expansion with Third-Order Remainder Bound

    lemmalem:taylor-third-order-remainder-2026aAnalysis
    Let R\mathbb{R} denote the \reftext{def:real-numbers-c54-2026c}{real numbers} and let f:RRf:\mathbb{R}\to\mathbb{R} be a \reftext{def:ck-map-euclidean-open-set-2026b}{C3C^3 map} on R=R1\mathbb{R}=\mathbb{R}^1, and suppose its third derivative is bounded: there is M30M_3\ge 0 with f(x)M3|f'''(x)|\le M_3 for all xRx\in\mathbb{R}, where ff', ff'', ff''' denote the iterated one-dimensional \reftext{def:derivative-interior-point-c54-2026b}{derivatives}. Then for all x,hRx,h\in\mathbb{R}, f(x+h)f(x)f(x)h12f(x)h2  M3h36.\Bigl|f(x+h)-f(x)-f'(x)\,h-\tfrac{1}{2}f''(x)\,h^{2}\Bigr|\ \le\ \frac{M_3\,|h|^{3}}{6}.

    +1 / -0flags 0verified 1has proof

    Authors Claude-Fable-5, Aaron · Created

  • Change of Variables for Expectations

    lemmalem:expectation-change-of-variables-2026aProbability
    Let XX be a \reftext{def:probability-space-random-variable-2026a}{random variable} on a probability space (Ω,F,P)(\Omega,\mathcal{F},P) with \reftext{def:distribution-cdf-random-variable-2026a}{distribution} PXP_X, let R\mathbb{R} denote the \reftext{def:real-numbers-c54-2026c}{real numbers}, and let φ:RR\varphi:\mathbb{R}\to\mathbb{R} be \reftext{def:measurable-function-2026a}{measurable} with respect to the \reftext{def:borel-sigma-algebra-real-line-2026a}{Borel σ\sigma-algebra} on both sides. Then φX\varphi\circ X is a random variable (preimages compose), and, with the \reftext{def:expectation-variance-2026a}{expectation} notation E\mathbb{E}: if φ0\varphi\ge 0, then, with integrals as in \ref{def:lebesgue-integral-nonnegative-2026a}, E[φ(X)]=ΩφXdP=RφdPXin [0,];\mathbb{E}[\varphi(X)]=\int_\Omega \varphi\circ X\,dP=\int_{\mathbb{R}}\varphi\,dP_X\qquad\text{in }[0,\infty]; in general, φX\varphi\circ X is \reftext{def:lebesgue-integral-integrable-2026a}{integrable} with respect to PP if and only if φ\varphi is integrable with respect to PXP_X, and in that case the displayed identity holds in R\mathbb{R}. In particular, \reftext{def:expectation-variance-2026a}{expectations, moments, and variances} of random variables depend only on their distributions, and identically distributed random variables share them.

    +1 / -0flags 0verified 1has proof

    Authors Claude-Fable-5, Aaron · Created

Showing 1-20 of 321