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.
Finite star-shaped cover of a bounded Lipschitz domain
Statement
Let be nonempty, bounded, connected and Lipschitz. Here Lipschitz means that its compact boundary has a finite atlas of rigidly moved cylinders in which is the strict epigraph of a Lipschitz function. There are finitely many bounded open sets covering , each star-shaped with respect to a closed ball , and the graph joining when is connected. There are measurable sets partitioning and, for every edge of a spanning tree of this graph, a function with integral one.
Facts & Assumptions
Given: A nonempty bounded connected open set with the finite graph-chart definition of Lipschitz boundary stated above.
A closed bounded subset of is compact and every open cover of a compact set has a finite subcover. (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)
Proof
Fix one graph chart, with Lipschitz constant , and a smaller horizontal ball whose closure lies in its base. Shrink its radius until the chart's upper height satisfies . Choose with and . Then the closed ball stays in the cylinder. Set with .
If , , and with , then and convexity keeps . Since , Lipschitz continuity gives . Also , so , and by convexity of the vertical interval. Thus ; the endpoints belong to as well, proving star-shapedness with respect to the closed ball.
The boundary is closed and bounded, hence compact by [F1]. At any , a chart containing writes the boundary locally as , with strictly below the chart's upper height. Shrinking a horizontal ball about makes its closure lie in the chart base and makes the height-gap inequality of step 1.1 hold; the choices there then produce a patch star-shaped with respect to its selected closed ball by step 2.1. Since lies inside the chart and inside the open set with and , there is an ambient open ball about whose closure lies in that chart and open set. For every , the chart description gives , so and . Let be the family of all pairs obtained this way from the finite chart atlas and admissible local choices; the preceding existence argument shows that its first components cover , without choosing a patch simultaneously for every boundary point. Compactness supplies a finite subfamily , , whose neighborhoods cover . Their union is an open neighborhood of the compact boundary, so some relative collar lies in that union and hence in . The remainder is closed and bounded, hence compact by [F1], and is contained in because every point of lies on . Finitely many balls with closures in cover ; each ball is convex and star-shaped with respect to a smaller concentric ball. Together these sets form a finite star-shaped cover of .
The intersection graph is connected: if it split into two nonempty graph components, the unions of the corresponding open sets would be disjoint nonempty relatively open subsets whose union is , contradicting connectedness. Order the cover and set . Then the are disjoint measurable sets with and union . A finite connected graph has a spanning tree.
Each tree-edge intersection is nonempty and open, so it contains a ball. Choose a nonnegative smooth bump supported in that ball. Its integral is strictly positive; dividing by that integral gives with integral one.
Depends on
Used by
Dependency tree · two levels
28 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
- Jean-Luc Guermond, MATH 661 Fall 2025, Chapters 53–54 (complete course notes) (standard reference, not scraped)
- Daniele Boffi, Franco Brezzi, Michel Fortin, Mixed Finite Element Methods and Applications (complete textbook) (standard reference, not scraped)