Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedPipeline-generatedprecheck pass
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-law bootstrap draws are conditionally IID

Statement

Fix n≥1, write [n]:={1,…,n}, let (Z,F) be a measurable unit space, and fix an observed tuple z=(z1,…,zn). Let Pn=1n∑i=1nδzi be its empirical probability measure. For the bootstrap algorithm Size-n bootstrap from the empirical law, equip the conditional index vector (I1,…,In) with the finite uniform law on Ωn:={f:[n]→[n]} and set Zj∗=zIj. For every A1,…,An∈F, P∗(Z1∗∈A1,…,Zn∗∈An)=∏j=1nPn(Aj). Thus, conditional on the fixed observed tuple, Z1∗,…,Zn∗ are independent random elements with common law Pn (Identical distribution and IID families).

Facts & Assumptions

Given: n≥1, a measurable space (Z,F), a fixed tuple z1,…,zn, and the size-n bootstrap procedure.

[F1]

Size-n bootstrap from the empirical law: each replicate selects I1,…,In independently and uniformly from [n] and sets Zj∗=zIj.

[F2]

Finite probability spaces, outcome weights, events, and event probabilities: a finite outcome set with nonnegative weights summing to 1 defines a probability on every subset of outcomes.

[F3]

Empirical measure of observed units: Pn(A)=1n∑i=1n1{zi∈A}.

[F4]

The set AB of functions B→A between finite sets is finite, with ∣AB∣=∣A∣∣B∣: for finite sets A,B, there are ∣A∣∣B∣ functions B→A.

[F6]

Random elements and real random variables: a random element is a measurable map from a probability space to a measurable space.

[F7]

Law or distribution of a random element: the law of a random element assigns to each target event the probability of its preimage.

[F8]

Independent random elements and Independent sigma-algebras and independent events: a family of random elements is independent when their generated sigma-algebras are independent; event independence is characterized by factorization of probabilities of all finite intersections.

[F9]

Identical distribution and IID families: random elements with the same target are IID when their laws agree and the family is mutually independent.

[F10]

The cardinality ∣A∣ of a finite set: a set is finite when it is bijective with a von Neumann natural.

[F11]

The cardinality ∣A∣ of a finite set: every von Neumann natural n has cardinality n.

[F12]

The cardinality ∣A∣ of a finite set: a bijection transports finiteness and cardinality.

Proof

1.1F1F2F4F6F10F11F12algebra

The shift j↦j−1 is a bijection from [n] to the von Neumann natural n. By [F10]–[F12], [n] is finite with cardinality n. Let Ωn={f:[n]→[n]}, the set of index vectors. By [F4], ∣Ωn∣=nn. Assign weight n−n to each ω∈Ωn. The weights are nonnegative and sum to nnn−n=1, so [F2] gives a finite probability space (Ωn,w) whose event sigma-algebra contains every subset. Each coordinate map Ij(ω)=ω(j) and record map Zj∗(ω)=zω(j) is measurable, because every preimage is a subset of Ωn; hence each Zj∗ is a random element of (Z,F) by [F6].

2.1F3F5F7F13step 1.1algebra

For Aj∈F, put Bj:={i∈[n]:zi∈Aj}. Each Bj is a subset of the finite set [n], so [F13] makes it finite. The event {Zj∗∈Aj for every j} consists of the functions g:[n]→[n] with g(j)∈Bj for every j. The shift τ:[n]→n, τ(j)=j−1, from step 1.1 has inverse ρ:n→[n], ρ(k)=k+1; thus g↦g∘ρ is a bijection from this event's index functions onto ∏k<nBk+1. By [F5] this set has cardinality ∏k<n∣Bk+1∣, which is the same product as ∏j=1n∣Bj∣ under that reindexing. Its probability under the uniform weights is therefore ∏k<n(∣Bk+1∣/n)=∏j=1n(∣Bj∣/n). Taking all events except the jth to be Z gives P∗(Zj∗∈Aj)=∣Bj∣/n=Pn(Aj) by [F3] and [F7]. Hence the joint event probability is the product of its marginal probabilities.

3.1F8F9step 2.1∎

The one-coordinate case of step 2.1 gives each Zj∗ law Pn. To check independence for any finite subfamily indexed by J⊆[n], take arbitrary Aj∈F for j∈J and set Aj=Z for every omitted coordinate. Since Pn(Z)=1 and P∗(Zj∗∈Z)=1, step 2.1 then gives P∗(⋂j∈J{Zj∗∈Aj})=∏j∈JPn(Aj). This is the finite-intersection factorization in [F8], so the coordinate random elements are independent. They have a common measurable target and the same law, hence they are IID by [F9].

Depends on

Used by

Cited to discharge well-definedness by Size-n bootstrap from the empirical law.

Dependency tree · two levels

46 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