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

Real intervals, complex rectangles and ball enclosures

Definition

A real interval is a closed set [a,b]⊂R with finite dyadic endpoints a≤b. Its width is b−a, midpoint is (a+b)/2, and its midpoint-radius form is m+[−r,r] with m=(a+b)/2 and r=(b−a)/2. The empty set is the status empty; the whole real line is entire. overflow, domain-error, split-domain, and inconclusive are computation statuses, not finite intervals.

A complex rectangle is X+iY={x+iy:x∈X, y∈Y} for real intervals X,Y. Complex addition and multiplication use (x+iy)+(u+iv)=(x+u)+i(y+v) and (x+iy)(u+iv)=(xu−yv)+i(xv+yu). For z=x+iy, its complex modulus is ∣z∣=x2+y2, and for z≠0 its reciprocal is 1/z=(x−iy)/(x2+y2). A complex ball B(c,r) is {z∈C:∣z−c∣≤r} with dyadic complex center c and dyadic r≥0. For any two represented sets S,T, the inclusion order is S⊑T iff S⊆T.

The width of a complex rectangle with coordinate widths wX,wY is its Euclidean diameter wX2+wY2; the width of a ball B(c,r) is its diameter 2r. Width comparisons against a dyadic tolerance can be decided by exact rational comparisons after squaring the nonnegative quantities.

The range of a real or complex function f on a set S is f(S)={f(x):x∈S∩dom⁡(f)}. A finite expression DAG is a finite directed acyclic graph with input nodes, constant nodes, and operation nodes; constants are exact dyadics or are supplied with certified enclosing intervals. Sharing a node means the exact same intermediate value is reused.

Depends on

Used by

Dependency tree · one level

2 results within one dependency step 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