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.

Uniform interval linear residual certificate with inconclusive status

Definition

Input n≥1, nonempty families A⊆Cn×n and b⊆Cn, each enclosed entrywise by finite complex rectangles, together with stored point proposals R and x^. The represented family need only be a subset of the supplied product of rectangles; correlations between entries may be discarded. All stored point data are exact dyadics.

  1. Use outward rectangle operations to evaluate the expression DAGs
E(A)=I−RA,c(A,b)=R(b−Ax^)

over the full input rectangles. If an operation has no finite enclosure or returns a domain or range status, return inconclusive.

  1. For each complex rectangle entry X+iY, outward-enclose its modulus by computing X2+Y2 and taking the upper endpoint. Combine those bounds by outward sums of squares and square roots to obtain q≥sup⁡A∈A∥E(A)∥F and r≥sup⁡A∈A,b∈b∥c(A,b)∥2. If any modulus, sum, square root or final division has no finite outward result, return inconclusive. The Frobenius upper bound also bounds the operator 2-norm. If q≥1, return inconclusive with q,r. Otherwise return certified with the uniform residual data (R,x^,q,r) and radius r/(1−q), rounded outward if represented as a ball.

The interval DAG encloses every value for every admitted pair, including dependencies between repeated inputs because natural interval evaluation may enlarge the range. inconclusive makes no assertion that a member is singular.

Depends on

Used by

Dependency tree · two levels

23 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