Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)
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 D⊂Rd be nonempty, bounded, connected and Lipschitz. Here Lipschitz means that its compact boundary has a finite atlas of rigidly moved cylinders in which D is the strict epigraph xd>φ(x′) of a Lipschitz function. There are finitely many bounded open sets Ui⊂D covering D, each star-shaped with respect to a closed ball B‾i⊂Ui, and the graph joining i,j when Ui∩Uj≠∅ is connected. There are measurable sets Ei⊂Ui partitioning D and, for every edge of a spanning tree of this graph, a function ψij∈Cc∞(Ui∩Uj) with integral one.

Facts & Assumptions

Given: A nonempty bounded connected open set with the finite graph-chart definition of Lipschitz boundary stated above.

Proof

1.1givenconstruct

Fix one graph chart, with Lipschitz constant L, and a smaller horizontal ball C whose closure lies in its base. Shrink its radius r until the chart's upper height Hchart satisfies Hchart−sup⁡Cφ>4(L+1)r. Choose c with sup⁡Cφ+3(L+1)r<c<Hchart−(L+1)r and 0<ρ<r. Then the closed ball B‾((x0′,c),ρ) stays in the cylinder. Set U={(x′,xd):x′∈C, φ(x′)<xd<H} with c+ρ<H<Hchart.

2.1givenalgebrastep 1.1

If x∈U, z∈B‾((x0′,c),ρ), and w=(1−t)x+tz with 0<t<1, then z′∈C and convexity keeps w′∈C. Since ∣z′−x′∣≤2r, Lipschitz continuity gives φ(w′)≤φ(x′)+2Lrt. Also c−ρ>sup⁡Cφ+2Lr, so wd>(1−t)φ(x′)+t(c−ρ)>φ(x′)+2Lrt≥φ(w′), and wd<H by convexity of the vertical interval. Thus w∈U; the endpoints belong to U as well, proving star-shapedness with respect to the closed ball.

3.1F1givenstep 1.1step 2.1

The boundary ∂D is closed and bounded, hence compact by [F1]. At any p∈∂D, a chart containing p writes the boundary locally as xd=φ(x′), with pd=φ(p′) strictly below the chart's upper height. Shrinking a horizontal ball C about p′ 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 U={(x′,xd):x′∈C, φ(x′)<xd<H} star-shaped with respect to its selected closed ball by step 2.1. Since p lies inside the chart and inside the open set with x′∈C and xd<H, there is an ambient open ball N about p whose closure lies in that chart and open set. For every x∈N∩D, the chart description gives xd>φ(x′), so x∈U and N∩D⊂U. Let N be the family of all pairs (N,U) obtained this way from the finite chart atlas and admissible local choices; the preceding existence argument shows that its first components cover ∂D, without choosing a patch simultaneously for every boundary point. Compactness supplies a finite subfamily (Ni,Ui), 1≤i≤m, whose neighborhoods cover ∂D. Their union is an open neighborhood of the compact boundary, so some relative collar {x∈D:dist⁡(x,∂D)<δ} lies in that union and hence in ⋃i=1mUi. The remainder Kδ={x∈D‾:dist⁡(x,∂D)≥δ} is closed and bounded, hence compact by [F1], and is contained in D because every point of D‾∖D lies on ∂D. Finitely many balls with closures in D cover Kδ; each ball is convex and star-shaped with respect to a smaller concentric ball. Together these sets form a finite star-shaped cover of D.

4.1givenstep 3.1

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 D, contradicting connectedness. Order the cover and set Ei=Ui∖⋃j<iUj. Then the Ei are disjoint measurable sets with Ei⊂Ui and union D. A finite connected graph has a spanning tree.

5.1constructstep 4.1∎

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 ψij∈Cc∞(Ui∩Uj) 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