Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedverified 2026-10-22 (gpt-6.1-sol)
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.

Locally finite smooth partitions of unity on Euclidean open sets

Statement

If an open set Ω⊆Rn is covered by a countable family of open sets (Vℓ)ℓ∈I, then there is a countable locally finite family of nonnegative functions (ηj)⊂Cc∞(Ω) summing to one, with each supp⁡ηj contained in one member Vℓ of the cover. Locally finite means that each point has a neighborhood meeting only finitely many supports.

Facts & Assumptions

Given: An open set Ω⊆Rn and a countable open cover of Ω.

[F3]

For n≥1, a smooth cutoff exists between any two concentric balls whose closures are nested. (A smooth bump between concentric Euclidean balls)

Proof

Given: The open set Ω and its countable open cover.

1.1F1givenalgebra

If Ω=∅, the empty family proves the claim. If n=0 and Ω≠∅, then Ω=R0 is a singleton; choose one cover member containing it and the single function η=1, which is smooth and compactly supported. Thus assume n≥1 and Ω≠∅. For m≥1 set Km={x:∣x∣≤m, dist⁡(x,Ωc)≥1/m} when Ω≠Rn, and set Km=B‾(0,m) when Ω=Rn; put Km=∅ for m≤0. Each Km is compact by [F1], the sets are nested, Km⊂int⁡Km+1, and their interiors cover Ω. The compact shells Sm:=Km∖int⁡Km−1 cover Ω and lie in the open sets Um:=int⁡Km+1∖Km−2. The family (Um) is locally finite: any compact subset of Ω lies in some int⁡KN and hence in Km−2 for all sufficiently large m.

2.1F2F3step 1.1chooseconstruct

Fix once a smooth nonnegative cutoff θ equal to one on B‾(0,1) and supported in B(0,2), whose existence is [F3]. In each Um, consider the rational inner balls B(q,r) for which B‾(q,2r)⊂Um∩Vℓ for some cover index ℓ. Indexed by (ℓ,q,r), these balls form a countable cover of Sm: for each point choose a cover member containing it, then density [F2] gives a rational center and radius with the required doubled closure. Compactness of Sm gives a finite subcover. Order all finite lists of eligible indexed balls by natural-number codes and take the first list covering Sm; thus no choice principle is needed. For each selected ball use the fixed rescaled cutoff ψm,j(x):=θ((x−q)/r). The family is locally finite because each shell contributes finitely many cutoffs supported in Um, and each support also lies in its assigned cover member. Its sum s:=∑m,jψm,j is smooth and positive on Ω because the shells cover Ω.

3.1step 2.1algebra∎

Define ηm,j:=ψm,j/s. Then each function is smooth, nonnegative and compactly supported in Ω, the family is locally finite, and ∑m,jηm,j=1. Each support remains in its assigned cover member, and enumeration gives the required countable family.

Depends on

Used by

Dependency tree · two levels

61 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