Alphabeta Math
AlgorithmAlgorithm: 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.

Quantile Monte Carlo standard error

Definition

Inputs: M≥2 equal-length scalar chains with N≥2 observations each, a quantile level α∈(0,1), and the fixed levels u−=.16 and u+=.84 used for a one-standard-error approximation. Output: The approximate error interval and MCSE below, or not estimable.

  1. If N<4, return not estimable. This procedure calls Split multi-chain autocorrelation effective sample size, whose input chains must have length at least 4.
  2. Pool the draws and compute q^α=QS(α) by Left empirical quantile of finite draws. Form the indicator chains Im,n=1{xm,n≤q^α}, Blom-normalize their pooled values by Blom rank-normal scores for pooled draws, and compute Eα with Split multi-chain autocorrelation effective sample size. If the indicator chains are constant or Eα is not estimable, return not estimable.
  3. Set a=Eαα+1 and b=Eα(1−α)+1. For u∈(0,1), define the lower Beta quantile Qa,b(u)=inf⁡{t∈[0,1]:Fa,b(t)≥u}, where Fa,b(t)=Beta⁡(a,b)((0,t]) and Beta distribution supplies the probability measure. Let v−=Qa,b(u−) and v+=Qa,b(u+). For integers n≥1, the sets En=(0,1/n] in (0,1) decrease to the empty set. By The real numbers, R is the Cauchy-sequence real field, and The Cauchy-sequence reals have the least-upper-bound property says it is a complete ordered field. Thus For every ε>0 in a complete ordered field there is a natural n≥1 with 1/n<ε gives, for every p∈(0,1), an n with 1/n<p. The sets have finite Beta measure because the Beta law is a probability measure. Thus Continuity from above when one set has finite measure gives Fa,b(1/n)=Beta⁡(a,b)(En)→0. Since Fa,b is nondecreasing by Measures are monotone and Fa,b(1)=1, for each u∈{u−,u+}⊂(0,1) there is an n with Fa,b(1/n)<u; no t≤1/n then belongs to the defining level set, while t=1 does. Hence 0<1/n≤Qa,b(u)≤1, so v−,v+∈(0,1] and both calls to QS lie in its domain. Also u−<u+ makes the upper level set a subset of the lower one, so v−≤v+. The order-statistic definition makes QS nondecreasing, hence QS(v−)≤QS(v+).
  4. Return the approximate Monte Carlo error interval [QS(v−),QS(v+)] and the estimate MCSE⁡^(q^α)=QS(v+)−QS(v−)2.

All Beta shape parameters are positive because Eα>0 and 0<α<1. This is a finite-run approximation, not a theorem that the interval has a prescribed coverage probability. Its statistical interpretation requires conditions for the relevant quantile and indicator-chain limit behavior; none are asserted here.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

37 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