Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedprecheck 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 n≥1 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 Rn∖B(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 n≥1 and parameter pairs (a,b), (a′,b′), that is, pairs of functions n→R‾.

[L1]

B(a,b):={ x∈Rn:ai<xi≤bi  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.1L1F1algebra

For claim 1, a point x∈Rn lies in B(a,b)∩B(a′,b′) exactly when ai<xi≤bi and ai′<xi≤bi′ 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 xi≤bi and xi≤bi′ says exactly xi≤di, 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(−∞,+∞).

1.2L1

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

1.3L1L2construct

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,ϵ:=+∞.

2.1step 1.3F1L1

Still for claim 2, every x∉B(a,b) lies in one of these 2n boxes: the set of i<n with ¬(ai<xi≤bi) is a nonempty subset of n, so it has a least member i; then aj<xj≤bj for every j<i, and by totality either xi≤ai, 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.

2.2step 1.3L1L2

Still for claim 2, each of the 2n boxes is disjoint from B(a,b), since its points satisfy xi≤ai 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<xi≤bi while a point of a box with index i′ satisfies it, and for a common i a point of both would satisfy bi<xi≤ai, contradicting ai<bi.

3.1step 1.1step 1.2step 2.1step 2.2∎

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 Rn∖B(a,b).

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