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

Outward-rounded interval, rectangle and ball operations

Definition

For real intervals X=[a,b] and Y=[c,d], compute the displayed exact endpoint formulas and round the lower endpoint down and the upper endpoint up in the format of Dyadic floating-point format and directed rounding. If either exact endpoint overflows, return overflow with the outward extended endpoints; never substitute a finite endpoint for an overflow sentinel. Addition is [a+c,b+d], subtraction is [a−d,b−c], and multiplication is [min⁡(ac,ad,bc,bd),max⁡(ac,ad,bc,bd)]. Division is defined only when 0∉Y and is X[1/d,1/c], with reciprocal endpoints computed as exact rationals before outward rounding. Squaring is [0,max⁡(a2,b2)] when 0∈X and [min⁡(a2,b2),max⁡(a2,b2)] otherwise. Square root is defined only for X⊆[0,∞) and is enclosed by applying Exact dyadic bisection for square-root endpoints to the exact dyadic endpoints with request n=p, where p is the selected format precision, and rounding outward for storage.

If 0∈Y for division, return split-domain with the two subdomains Y∩(−∞,0) and Y∩(0,∞), or entire when the caller does not request subdivision. No finite quotient interval is returned in this case. An invalid square-root domain returns domain-error or an explicitly restricted nonnegative subdomain.

Complex-rectangle addition, subtraction and multiplication use (x+iy)(u+iv)=(xu−yv)+i(xv+yu), applying the real interval operations to each component. For a rectangle X+iY excluding 0, define its reciprocal by (X−iY)/(X2+Y2), computing the square hulls, their sum, and the component quotient endpoint formulas as exact rationals before rounding the final reciprocal components outward. The exact denominator interval is strictly positive because at least one coordinate interval excludes zero; do not round it before division, since underflow could introduce zero. Propagate any final endpoint overflow. Division multiplies by this reciprocal.

For a ball B(c,r), let XB=[ℜc−r,ℜc+r] and YB=[ℑc−r,ℑc+r] be its coordinate projection intervals. For a real interval J, let M(J)=max⁡(∣inf⁡J∣,∣sup⁡J∣) and let d(J)=0 if 0∈J, otherwise d(J)=min⁡(∣inf⁡J∣,∣sup⁡J∣). Put MB=M(XB)+M(YB) and mB=max⁡(d(XB),d(YB)). Then ∣z∣≤MB for every z∈B(c,r) and ∣z∣≥mB for every such z. Define ball addition and subtraction as B(0,ru⁡(MB1+MB2)), multiplication as B(0,ru⁡(MB1MB2)), and division as B(0,ru⁡(MB1/mB2)) only when mB2>0. These origin-centered output balls are conservative but inclusion-isotone. If mB2=0, return split-domain, entire, or inconclusive; if a radius overlows, return overflow.

Well-definedness

Dyadic endpoints are rational, so every real arithmetic endpoint and every complex-division component before square root is rational. Reciprocals are formed only for nonzero rational endpoints. In a complex rectangle excluding zero, at least one coordinate interval omits zero; its exact squared interval has a strictly positive lower endpoint, so the unrounded X2+Y2 does also. The prescribed exact rational component quotients therefore have nonzero denominators even when storage rounding would underflow that lower bound. For ball division, mB2>0 gives ∣y∣≥mB2>0 for every y∈B2. Every endpoint overflow is reported explicitly and cannot produce a finite-result claim.

Depends on

Used by

…and 12 more results.

Dependency tree · two levels

5 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