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.

Finite-bit Box–Muller with certified elementary-function evaluators

Definition

Input an integer bit budget b≥1, two disjoint ideal fair-bit subsequences as in Disjoint streams of independent fair bits produce independent uniform variables, and a fixed deterministic configuration consisting of finite dyadic format parameters, positive integer series truncation indices N≥1 and nonnegative integer total split budgets B≥0 for the log/root interval evaluators, positive dyadic log/root width targets, and phase parameters with exact rational 0<τ≤1/4, integer exponent limits emin⁡≤emax⁡, integer precisions 2≤p0≤pmax⁡, and a positive integer elementary-series cap J≥1. Every call uses these fixed parameters; a failed call returns inconclusive with its supplier status. No success at a requested width is promised for arbitrary fixed budgets. The midpoint convention is Midpoint bit discretization has bounded coupling and CDF error, and the exact reference transform is Box–Muller has a product Gaussian density and Rayleigh second moment.

  1. Take the first b bits from each subsequence and form the exact dyadics uj=(Kj+1/2)2−b. Enclose u1 by directed dyadic endpoints in the selected format. If this is non-finite or its lower endpoint is not positive, return inconclusive; underflow may not turn a log argument into an accepted interval containing zero.

  2. Apply Finite-budget validated range evaluation to the logarithm DAG on that interval with the configured finite parameters and log width target. On certified(L,X), write L=[L−,L+] and set ℓ^=L−, ηℓ=L+−L−. The natural logarithm equals the integral logarithm by The natural logarithm has derivative 1/x and equals the integral from 1 to x of 1/t, so L−≤log⁡u1<0. Compute the exact dyadic q=−2ℓ^≥0.

  3. Enclose q by directed endpoints in the configured format; reject non-finite endpoints or a negative lower endpoint. Apply the same budgeted procedure to its square-root DAG with the root width target. On a certified interval S=[S−,S+], set r^=S− and ηs=S+−S−. The range guarantee of Budgeted range evaluation terminates and certifies only sound enclosures gives ∣ℓ^−log⁡u1∣≤ηℓ and ∣r^−q∣≤ηs. Width differences and the products in these instructions are exact dyadic arithmetic.

  4. Call Certified dyadic enclosures for unit-circle phases on the exact rational qphase=2u2 and configured phase parameters. On its certified return (w^,ϵ), set t^=(ℜw^,ℑw^) and ηt=ϵ. By Certified phase output encloses the exact unit-circle value, ∥t^−(cos⁡(2πu2),sin⁡(2πu2))∥2≤ηt, including pi, angle, truncation and directed-endpoint errors. This is the existing phase routine, with its existing canonical-pi bridge.

  5. Return the exact dyadic vector Z^=r^ t^ and the dyadic certificates ηℓ,ηs,ηt. If any preceding supplier call has a non-finite status, propagate it as inconclusive. Final vector multiplication is exact dyadic multiplication; rounding it further requires a separate added error certificate.

The output is the dyadic vector together with the reported evaluator certificates. Its arithmetic suppliers provide neither an IID source nor exact normal output.

Depends on

Used by

Dependency tree · two levels

55 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