LemmaStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-08-01

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.

If every finite interval cover of $A \subseteq R$ has total length at least $c$ , then every rectangle cover of $A \times [0, d]$ has total area at least $c d$

Statement

Let $A \subseteq R$ . If every finite interval cover of $A$ has total length at least $c \geq 0$ , then every finite rectangle cover of $A \times [0, d]$ , $d \geq 0$ , has total area at least $c d$ .

Facts & Assumptions

Given: A finite rectangle cover and the stated interval-cover lower bound.

[L1]

Rectangles and grids are Axis-parallel rectangles in $R^{m}$ and their volume and Grid partitions of a rectangle in $R^{m}$ , their cells, refinements and mesh.

[L2]

Finite sums split and distribute (Finite sums and finite products, by recursion, Laws of finite sums and finite products).

Proof

technique · direct

1.1

If $d = 0$ , then every covering area is nonnegative and the required lower bound is $c d = 0$ . Hence assume $d > 0$ . Clip the rectangles to a common bounding rectangle and partition the nondegenerate interval $[0, d]$ at every vertical endpoint.

L1given

2.1

On each nondegenerate horizontal strip, choose an interior height. The horizontal projections of the rectangles active at that height cover $A$ , so their total widths are at least $c$ .

givenstep 1.1choose

3.1

Multiply the inequality for each strip by its height and sum. Reindexing the nested finite sums counts each covering rectangle by its width times its total active height, at most its area. Thus the covering area is at least $c \sum strip heights = c d$ .

step 2.1L2algebra∎

Depends on

Used by

((0,1)∖ S)×(0,1) is bounded and open, but its boundary has positive Jordan outer content Counterexample
The Smith–Volterra–Cantor slab S×[0,1] is compact and not Jordan measurable Counterexample

Dependency tree · two levels

34 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

J. Lebl, Basic Analysis, Jordan Measurable Sets (standard reference, not scraped)
J. Lebl, Basic Analysis, Outer Measure and Null Sets (standard reference, not scraped)

If every finite interval cover of A⊆RA⊆R has total length at least cc, then every rectangle cover of A×[0,d]A×[0,d] has total area at least cdcd