Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6-luna)
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.

Empirical, centered, and Rademacher processes

Definition

Let (X,A,P) be a probability space, let n≥1 be an integer, and let Z1,…,Zn be IID random elements with law P. For a class F of measurable, integrable real-valued functions on X, write

Pf:=∫f dP,Pnf:=1n∑i=1nf(Zi),Gn(f):=n (Pnf−Pf).

The map f↦Pnf−Pf is the centered empirical process, and Gn is its n-scaled version. More generally, for independent processes X1(t),…,Xn(t) whose marginal expectations are finite for each index t∈T, the centered process sum is

Sn(t):=∑i=1n(Xi(t)−EXi(t)),t∈T.

On an auxiliary probability-space extension, let σ1,…,σn be independent signs, each taking +1 and −1 with probability 1/2, independent of the observations. The empirical Rademacher process is

Rn(f):=∑i=1nσif(Zi),f∈F.

The centered Rademacher process ∑iσi(f(Zi)−Pf) is a distinct process; no equality between it and Rn is part of this definition.

For a countable class of measurable functions, each displayed supremum of measurable sample paths is measurable. For an uncountable class, ordinary probability or expectation is used only when a specified countable subclass has the same supremum almost surely for the process in question; this is the separable-version convention used here. Otherwise state results using outer probability

P∗(A):=inf⁡{P(B):A⊆B, B∈A}

and, for a nonnegative possibly nonmeasurable random quantity Y, outer expectation

E∗Y:=inf⁡{EU:U is measurable, nonnegative, and U≥Y}.

In particular, measurability of every f separately does not by itself make an uncountable supremum measurable.

Depends on

Used by

Dependency tree · two levels

14 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