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 , let , and let be compact. For each , write
If every section is a null subset of , then is a null subset of .
Facts & Assumptions
Given: An integer , real numbers , and a compact set whose sections are null for every .
Euclidean nullity means that for every the set can be covered by countably many closed cubes of total volume below (Measure zero and content zero in by countable and finite cube covers).
Every open cover of a compact metric space has a Lebesgue number (Every open cover of a compact metric space has a Lebesgue number: a such that every nonempty subset of diameter less than lies inside a single member of the cover).
Proof
If , compactness bounds inside for some . Divide the -dimensional base into a finite grid of cubes of side at most and cover each corresponding point of by an -cube of side centred in the first coordinate at . The number of grid cubes is at most , so their total -volume is at most . By [F1], is null. Assume henceforth that .
Fix , put , and set . For a fixed , nullity [F1] gives a sequence of closed cubes covering , with sides and total volume below . Enlarge cube concentrically to an open cube of side , where for . The binomial formula gives . Thus the enlarged open cover has total covering cost below , where an open cube of side has covering cost . Compactness of supplies a finite subcover, still of cost below . This proves existence separately for each ; no family of chosen covers indexed by is formed.
Let be the set of all pairs such that is an open interval, is a finite list of open -cubes of total covering cost below , and , where is their union. Every lies in the interval of at least one such pair. Indeed, take just one finite cover of supplied by step 1.2 and write for its union. The open sets and for positive integers cover : points over lie in the first, and every other point lies in one of the latter. A finite subcover exists. Taking at least as large as its finitely many indices shows that lies in . Thus this interval and the finite cube list belong to . This construction proves coverage by the set of all witnessed intervals without selecting one pair for every .
By [L1], the open cover of has a Lebesgue number. Take a finite partition into closed intervals of positive length smaller than that number. For each of these finitely many intervals take a witnessing pair with . Write for its list. Only finitely many witnesses are used, which needs no choice axiom. Then . For each prism , use the following subdivision. [L1, step 2.1, choose] Let and let be the side length of . If , partition the interval direction into at most pieces of length at most ; if , partition each of the base directions into at most pieces of length at most . In either case the prism is covered by finitely many closed -cubes of total volume at most These cubes cover , and their total volume is at most By [F1], is null.
Therefore compact null sections imply the whole compact set is null.