Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passverified 2026-09-23 (gpt-6-sol)
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.2F1givenchoose

Fix ε>0 and put L:=b−a+1. For each t∈[a,b], [F1] supplies the following covers. [F1, given, choose] There are finitely many closed n-cubes Qt,1,…,Qt,mt covering the compact section Kt with total n-volume below ε/(2n+3L). Enlarge them slightly to open n-cubes Q~t,ℓ⊇Qt,ℓ so that, with Ot:=⋃ℓ=1mtQ~t,ℓ, one still has ∑ℓ=1mtvol⁡n(Q~t,ℓ)<ε2n+2L. Thus each section has an open finite cube cover with the stated uniform volume budget.

2.1step 1.2givencontradiction

Since Kt⊆Ot and Ot is open, compactness of K gives the following interval. [step 1.2, given, contradiction] There is an open interval It about t such that K∩(It×Rn)⊆It×Ot. Otherwise one could find (tj,yj)∈K with tj→t and yj∉Ot; passing to a convergent subsequence inside the compact set K yields a limit point (t,y)∈K with y∈Kt∖Ot, contradiction.

3.1F1L1step 2.1algebra

By [L1], the cover {It:t∈[a,b]} has a Lebesgue number. Choose a finite partition of [a,b] into closed intervals J1,…,Jr of positive length smaller than that number, and for each j choose tj with Jj⊆Itj. Then ∑j∣Jj∣=b−a<L. For each prism Jj×Q~tj,ℓ, use the following subdivision. [L1, step 2.1, choose] Let λj:=∣Jj∣ and let sj,ℓ be the side length of Q~tj,ℓ. 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~tj,ℓ). These cubes cover K, and their total volume is at most 2n∑j=1r∣Jj∣∑ℓ=1mtjvol⁡n(Q~tj,ℓ)<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

Used by

Dependency tree · two levels

24 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