Alphabeta Math
AlgorithmAlgorithm: AI-adaptedProof: Not applicablePipeline-generated
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.

Size-n bootstrap from the empirical law

Definition

Input. Let n≥1, let (Z,F) be the declared measurable space of sampling units, and fix the observed ordered tuple z=(z1,…,zn). Let Pn be its empirical probability measure from Empirical measure of observed units and The empirical measure is a probability measure. Declare a sample sigma-algebra Fn on the ordered tuple space Zn and provide a statistic Tn:(Zn,Fn)→(Rq,Bq), where q≥1 is finite and Bq is the declared target sigma-algebra; "statistic" has the measurable-map meaning in Statistics and estimators.

Write [n]:={1,…,n} for the indexing set.

Procedure. Draw indices I1,…,In independently and uniformly from [n], so repeated indices are allowed. Set Zj∗:=zIj for j=1,…,n. Return the bootstrap tuple (Z1∗,…,Zn∗) and the replicate Tn(Z1∗,…,Zn∗). Generate further replicates by repeating the index draws with fresh randomness. These are resampling units only when the tuple entries satisfy the unit contract in Sampling units and the resampling-unit contract.

The conditional IID law of the draws is proved in Empirical-law bootstrap draws are conditionally IID ↗. This algorithm does not claim that its conditional law consistently approximates any sampling law; such validity requires separate hypotheses and a separate theorem.

Depends on

Used by

Dependency tree · two levels

30 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