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.
The cover of by and has Lebesgue number , and no larger one
Example
Work in with its usual metric (The absolute value makes a metric space: is a metric, its open balls are the intervals , and it is unbounded) and let carry the restricted metric (Isometry, isometric embedding, and the subspace metric on a subset, Intervals of : the nine order-convex forms, nondegeneracy, and length). Put
so that is an open cover of the compact metric space (Open cover, subcover, compact metric space, and compact subset of a metric space, Heine-Borel in : with the Euclidean metric a subset of is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line). Then:
- is a Lebesgue number for (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): every nonempty with (Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space) is contained in or in .
- No larger works: for every real the set is nonempty with and is contained in neither nor .
Facts & Assumptions
Given: The compact metric space with , and the sets and .
A closed bounded subset of is a compact subset of , and is closed and bounded (Heine-Borel in : with the Euclidean metric a subset of is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line, Intervals of : the nine order-convex forms, nondegeneracy, and length, Lower bound, bounded below, bounded set).
The sets open in the subspace are the traces on of the open subsets of , and and are open in (A subset of a metric space is open in the subspace metric exactly when it is the trace of an open set of the ambient space, and it is compact as a metric space in its own right exactly when every family of open subsets of the ambient space covering it, indexed or not, has finitely many members covering it, The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement, Open ball, closed ball and sphere in a metric space, The absolute value makes a metric space: is a metric, its open balls are the intervals , and it is unbounded).
for nonempty bounded , so for all (Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space).
A Lebesgue number for an open cover of a compact metric space is a real such that every nonempty subset of diameter less than lies in a single member of the cover; one exists (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).
Verification
and are open in , being the traces of and , and , because a point of is either below , and then in , or at least , and then in .
Let be nonempty with , and suppose first that every satisfies ; then .
Otherwise some has , and then every satisfies , so .
In both cases lies in a single member of , so is a Lebesgue number: claim 1.
For claim 2 let be real and put , a nonempty subset of with for and with attained, so .
because and , and because and ; so no is a Lebesgue number for this cover, and is the largest one: claim 2.
Remarks
The number is exactly the overlap. has length , and that is the Lebesgue number: a set of diameter below the overlap cannot straddle both ends. The example shows that the conclusion of 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 is sharp, the lemma asserting only that some positive exists.
The strict inequality in the definition matters. The set has diameter exactly and lies in neither member, so a Lebesgue number could not be required to work for subsets of diameter at most .
Depends on
- Every open cover of a compact metric space has a Lebesgue number: a $\delta > 0$ such that every nonempty subset of diameter less than $\delta$ lies inside a single member of the cover
- Heine-Borel in $\mathbb{R}^n$: with the Euclidean metric a subset of $\mathbb{R}^n$ is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line
- Open cover, subcover, compact metric space, and compact subset of a metric space
- A subset of a metric space is open in the subspace metric exactly when it is the trace of an open set of the ambient space, and it is compact as a metric space in its own right exactly when every family of open subsets of the ambient space covering it, indexed or not, has finitely many members covering it
- The absolute value makes $\mathbb{R}$ a metric space: $d(x,y) = |x-y|$ is a metric, its open balls are the intervals $(x-r, x+r)$, and it is unbounded
- Isometry, isometric embedding, and the subspace metric on a subset
- Intervals of $\mathbb{R}$: the nine order-convex forms, nondegeneracy, and length
- Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space
- The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement
- Open ball, closed ball and sphere in a metric space
- Lower bound, bounded below, bounded set
Used by
Nothing in the library uses this result yet.
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 118 results over 18 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- Lebesgue's number lemma (Wikipedia) (standard reference, not scraped)
- Heine-Borel theorem (Wikipedia) (standard reference, not scraped)