Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-26
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.

Half-open boxes are closed under intersection, and the complement of a half-open box is a finite disjoint union of half-open boxes

Statement

Let n1 and let half-open boxes B(a,b)Rn be as in Half-open boxes in Rn and their volume.

  1. Intersection. For parameter pairs (a,b) and (a,b), B(a,b)B(a,b)  =  B(c,d),ci:=max{ai,ai},di:=min{bi,bi}(i<n), the extremes taken in the total order of R. Consequently the intersection of the members of a finite list of half-open boxes is a half-open box, the empty list giving Rn.
  2. Complement. For every parameter pair (a,b) there is a finite list of pairwise disjoint half-open boxes whose union is RnB(a,b). When B(a,b) the list may be taken to have 2n members, indexed by a coordinate i<n and a side.

Facts & Assumptions

Given: A natural number n1 and parameter pairs (a,b), (a,b), that is, pairs of functions nR.

[L1]

B(a,b):={xRn:ai<xibi  for every i<n}, and Rn=(,+]n (Half-open boxes in Rn and their volume).

[L2]

A box is nonempty exactly when ai<bi for every i<n (Half-open boxes in Rn and their volume).

[F1]

(R,) is a totally ordered set, and the inclusion of R preserves and reflects the order (The extended real line R=R{,+}, its order, and the arithmetic that is left undefined).

Proof

technique · direct
1.1

For claim 1, a point xRn lies in B(a,b)B(a,b) exactly when ai<xibi and ai<xibi for every i<n; the order being total, each two-element set {ai,ai} has a greatest member ci and each {bi,bi} a least member di, and for a real xi the conjunction ai<xi and ai<xi says exactly ci<xi while xibi and xibi says exactly xidi, so the intersection is B(c,d); iterating along a list of length m gives the finite case by induction on m, with the empty list giving Rn=B(,+).

L1F1algebra
1.2

For claim 2 in the degenerate case, if B(a,b)= then RnB(a,b)=Rn=(,+]n, a list with the single member Rn, whose members are vacuously pairwise disjoint.

L1
1.3

For claim 2 in the remaining case, assume B(a,b), so ai<bi for every i<n, and for i<n define two parameter pairs (ai,0,bi,0) and (ai,1,bi,1) by setting, in coordinates j<i, aji,ϵ:=aj and bji,ϵ:=bj; in coordinate i, (aii,0,bii,0):=(,ai) and (aii,1,bii,1):=(bi,+); and in coordinates j>i, aji,ϵ:= and bji,ϵ:=+.

L1L2construct
2.1

Still for claim 2, every xB(a,b) lies in one of these 2n boxes: the set of i<n with ¬(ai<xibi) is a nonempty subset of n, so it has a least member i; then aj<xjbj for every j<i, and by totality either xiai, putting x in B(ai,0,bi,0), or xi>bi, putting x in B(ai,1,bi,1), the coordinates j>i being unconstrained in both.

step 1.3F1L1
2.2

Still for claim 2, each of the 2n boxes is disjoint from B(a,b), since its points satisfy xiai or xi>bi; and two of them are disjoint from one another, because for i<i a point of a box with index i fails ai<xibi while a point of a box with index i satisfies it, and for a common i a point of both would satisfy bi<xiai, contradicting ai<bi.

step 1.3L1L2
3.1

Claim 1 is step 1.1, and claim 2 is step 1.2 in the empty case and steps 2.1 and 2.2 in the nonempty case, the union of the 2n boxes being exactly RnB(a,b).

step 1.1step 1.2step 2.1step 2.2

Depends on

Used by

Dependency tree · two levels

13 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