Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge 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.

Compact null sections imply a compact set is null

Statement

Let n≥1, let a≤b, and let K⊆[a,b]×Rn be compact. For each t∈[a,b], write

Kt:={y∈Rn:(t,y)∈K}.

If every section Kt is a null subset of Rn, then K is a null subset of Rn+1.

Facts & Assumptions

Given: An integer n≥1, real numbers a≤b, and a compact set K⊆[a,b]×Rn whose sections Kt are null for every t∈[a,b].

[F1]

Euclidean nullity means that for every ε>0 the set can be covered by countably many closed cubes of total volume below ε (Measure zero and content zero in Rm by countable and finite cube covers).

Proof

technique · direct
1.1F1givencases

If a=b, compactness bounds K inside {a}×[−R,R]n for some R>0. Divide the n-dimensional base into a finite grid of cubes of side at most δ and cover each corresponding point of K by an (n+1)-cube of side δ centred in the first coordinate at a. The number of grid cubes is at most (2R/δ+2)n, so their total (n+1)-volume is at most (2R+2δ)nδ→0. By [F1], K is null. Assume henceforth that a<b.

1.2F1givenconstructalgebra

Fix ε>0, put L:=b−a+1, and set B:=ε/(2n+2L). For a fixed t, nullity [F1] gives a sequence of closed cubes covering Kt, with sides ℓi and total volume below B/4. Enlarge cube i concentrically to an open cube of side ℓi+2hi, where hi=min⁡{1,B2−i−4/(3n(1+ℓi)n−1)} for i≥0. The binomial formula gives (ℓi+2hi)n−ℓin≤3nhi(1+ℓi)n−1≤B2−i−4. Thus the enlarged open cover has total covering cost below B/4+B/8<B, where an open cube of side s has covering cost sn. Compactness of Kt supplies a finite subcover, still of cost below B. This proves existence separately for each t; no family of chosen covers indexed by t is formed.

2.1step 1.2givenconstruct

Let P be the set of all pairs (I,Q) such that I is an open interval, Q is a finite list of open n-cubes of total covering cost below B, and K∩(I×Rn)⊆I×OQ, where OQ is their union. Every t∈[a,b] lies in the interval of at least one such pair. Indeed, take just one finite cover of Kt supplied by step 1.2 and write O for its union. The open sets R×O and {(x,y):∣x−t∣>1/r} for positive integers r cover K: points over t lie in the first, and every other point lies in one of the latter. A finite subcover exists. Taking r at least as large as its finitely many indices shows that K∩((t−1/r,t+1/r)×Rn) lies in R×O. Thus this interval and the finite cube list belong to P. This construction proves coverage by the set of all witnessed intervals without selecting one pair for every t.

3.1F1L1step 2.1algebra

By [L1], the open cover {I:(I,Q)∈P} of [a,b] has a Lebesgue number. Take a finite partition into closed intervals J1,…,Jr of positive length smaller than that number. For each of these finitely many intervals take a witnessing pair (Ij,Qj)∈P with Jj⊆Ij. Write Q~j,1,…,Q~j,mj for its list. Only finitely many witnesses are used, which needs no choice axiom. Then ∑j∣Jj∣=b−a<L. For each prism Jj×Q~j,ℓ, use the following subdivision. [L1, step 2.1, choose] Let λj:=∣Jj∣ and let sj,ℓ be the side length of Q~j,ℓ. If λj≥sj,ℓ, partition the interval direction into at most ⌈λj/sj,ℓ⌉ pieces of length at most sj,ℓ; if λj≤sj,ℓ, partition each of the n base directions into at most ⌈sj,ℓ/λj⌉ pieces of length at most λj. In either case the prism is covered by finitely many closed (n+1)-cubes of total volume at most 2nλjsj,ℓn=2n∣Jj∣ vol⁡n(Q~j,ℓ). These cubes cover K, and their total volume is at most 2n∑j=1r∣Jj∣∑ℓ=1mjvol⁡n(Q~j,ℓ)<2nL⋅ε2n+2L<ε. By [F1], K is null.

4.1step 1.1step 3.1∎

Therefore compact null sections imply the whole compact set is null.

Depends on

Dependency tree · 2 levels

Sources