Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-07
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.

Exact tail criterion for a truncated-centered IID weak law

Statement

For IID real random variables (Xn)n1 and Sn=k=1nXk, there exist deterministic real constants (μn) with Sn/nμn0 in probability if and only if nP(X1>n)0. When this condition holds, μn=E[X11{X1n}] works. Neither existence of an untruncated mean nor convergence of (μn) is asserted.

Facts & Assumptions

[F1]

Identical distribution and IID families: Let (Xi)iI be random elements with the same measurable target (E,E). They are identically distributed if P(XiB)=P(XjB) for all i,jI and BE, that is, their laws in def-law-or-distribution-of-a-random-element agree. They are independent and identically distributed (IID) if, in addition, the whole family is independent in def-independent-random-elements. Independence means mutual independence, not merely pairwise independence. No moment assumption is part of either definition. The empty family satisfies these universal conditions vacuously.

[F2]

Independent-copy symmetrization of random series: Given an independent sequence (Xn)n1 on (Ω,F,P), form the product probability space (Ω2,FF,PP). Write Un(ω,ω)=Xn(ω), Vn(ω,ω)=Xn(ω), and Zn=UnVn. Then (Un) and (Vn) are independent copies of the whole sequence, and the Zn are independent symmetric real random variables. Almost-sure convergence of nXn implies almost-sure convergence of nZn. If XnA almost surely for every n, with 0A<, then Zn2A almost surely, EZn=0, and Var(Zn)=2Var(Xn).

[F3]

Tail comparisons under independent-copy symmetrization: Let X be an independent copy of a real random variable X. For every t>0, P(XX>t)2P(X>t/2). There exists a finite M0 with P(XM)1/2; for every such M, P(XX>t)12P(X>t+M).

[F4]

One-sided maximal inequality for symmetric independent sums: For independent symmetric real random variables X1,,Xn, n1, let Sk=j=1kXj. For every real a, P(max1knSk>a)2P(Sn>a). Consequently for every t>0, P(max1knSk>t)2P(Sn>t). No moment assumptions are needed.

[F5]

Truncation weak law for independent arrays: For each n1 let Xn,1,,Xn,rn be independent real random variables on one probability space, with finite rn0. Let deterministic bn>0 tend to infinity and set Yn,k=Xn,k1{Xn,kbn}. If k=1rnP(Xn,k>bn)0,bn2k=1rnVar(Yn,k)0, then k=1rnXn,kk=1rnEYn,kbn0in probability. No independence between rows is required.

[F6]

Vanishing tail control bounds truncated second moments: Let X be a real random variable with nP(X>n)0 as positive integers n. Then xP(X>x)0 for real x, and E[X21{Xn}]n0. Moreover EXp< for every 0<p<1.

[F7]

Convergence in probability: For real random variables (Xn) and X on one probability space, write XnX in probability when, for every ε>0, P(XnX>ε)0. This is precisely def-convergence-in-measure for the probability measure.

[F8]

Finite and countable subadditivity of measures: Let μ be a measure and let (Ek)kN be measurable. Then μ(kNEk)k=0μ(Ek). For every mN one also has μ(k<mEk)k<mμ(Ek), including m=0, where both sides are 0.

[F9]

Largest-summand bound for independent symmetric variables: Let Y1,,Yn be independent symmetric real random variables, n1, and Sn=k=1nYk. For t>0, P(Snt)12P(maxknYkt). The same bound holds when both inequalities inside the probabilities are strict. If the Yk are IID and p=P(Y1>t), then P(Sn>t)12(1(1p)n)12(1enp).

Proof

Given: The objects and hypotheses of the statement.

1.1

Assume the tail condition and take row Xn,k=Xk for 1kn, with bn=n. The sum of row tail probabilities is nP(X1>n)0. The normalized truncated variance sum is at most n1E[X121{X1n}]0 by the second-moment lemma. The truncated array law yields the claimed convergence with the explicit finite μn.

F6F5F1given
1.2

For necessity suppose constants μn give the convergence. On the two-factor product take an independent copy Xk and let Zk=XkXk, Tn=k=1nZk. The Zk are IID and symmetric. The triangle and union bounds give P(Tn>εn)2P(Snnμn>εn/2)0. The deterministic center cancels exactly.

F2F8F7given
2.1

For pn=P(Z1>εn), the largest-summand bound gives P(Tn>εn)(1enpn)/2. Since the left side tends to zero and npn0, necessarily npn0; otherwise a positive lower bound along a subsequence would keep the right side away from zero.

F9step 1.2algebra
3.1

Choose finite M0 with P(X1M)1/2. The symmetrization lower bound with t=n/2 gives P(Z1>n/2)P(X1>n/2+M)/2P(X1>n)/2 for n2M. Multiply by n and use the previous step with ε=1/2. This proves necessity, including atomic or deterministic laws.

F3step 2.1algebra
4.1

An alternative check of the maximal step uses Zk=TkTk1 with T0=0, whence maxkZk2maxkTk. The symmetric maximal inequality gives P(maxkZk>2εn)2P(Tn>εn)0. Independence then gives 1(1P(Z1>2εn))n0, hence again nP(Z1>2εn)0 by 1pep. Both checks retain strict events and allow atoms.

F4step 1.2algebra

Depends on

Used by

Dependency tree · two levels

32 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