Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-10-02
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 domains

Statement

Assume the Axiom of Choice (AC) and the Axiom of Countable Choice. Let Ω⊆Cn, n≥1, be a domain and let (Ui)i∈I be an open cover of Ω. Then there are an open cover (Vk)k∈N of Ω refining (Ui) and functions χk∈C∞(Ω), k∈N, such that:

  1. (Vk)k∈N is locally finite and there is a map k↦i(k)∈I with Vk⊆Ui(k) for every k;
  2. 0≤χk≤1 and supp⁡χk⊆Vk for every k;
  3. the family (supp⁡χk)k∈N is locally finite;
  4. ∑kχk=1 at every point of Ω.

In particular (χk) is a smooth partition of unity subordinate to the locally finite refinement (Vk).

Facts & Assumptions

Given: The Axiom of Choice and the Axiom of Countable Choice; a domain Ω⊆Cn with n≥1; an open cover (Ui)i∈I of Ω; the function δ(z):=inf⁡{∣z−w∣:w∈Cn∖Ω} on Cn, read as δ≡+∞ when Ω=Cn.

[F1]

A family (ϕi)i∈I of smooth functions ϕi:M→[0,1] is a smooth partition of unity subordinate to an open cover (Ui)i∈I of a smooth manifold M when the supports are locally finite, supp⁡(ϕi)⊆Ui for every i, and ∑iϕi(p)=1 for every p (Smooth partitions of unity subordinate to an open cover).

[F2]

For all 0<r<R there is a smooth function ρ:Rn→[0,1] with ρ=1 on B‾r(0) and supp⁡ρ⊆BR(0) (A smooth bump between concentric Euclidean balls).

[F4]

Under the coordinate identification of Cm with R2m the metric, the balls, the open sets, the convergent sequences, the Cauchy sequences and the continuous maps of Cm are verbatim those of R2m (Complex m-space and its real coordinate dictionary).

[F5]

The Axiom of Countable Choice: for every family (Xn)n∈N of nonempty sets there is f with domain N and f(n)∈Xn for all n (The Axiom of Countable Choice (ACω)).

[F6]

AC states that every family of nonempty sets has a choice function (The Axiom of Choice).

Choice use. AC selects, for each point of the shells below, one cover member and one radius; the countable instance [F5] selects the finite subcover list of each shell and the bumps built on it. No other selection occurs: the shell functions Kj, Sj, Wj and the normalisation are explicit.

Proof

technique · direct
1.1F3F4algebra

If Ω=Cn, then δ≡+∞ is constant. Otherwise Cn∖Ω≠∅, and for z,z′∈Cn and every w∈Cn∖Ω, ∣z−w∣≤∣z−z′∣+∣z′−w∣, so taking infima and then interchanging z,z′ gives ∣δ(z)−δ(z′)∣≤∣z−z′∣. Thus δ is continuous in either case. For j≥1 put Kj:={z∈Ω:∣z∣≤j and δ(z)≥1/j}; then each Kj is closed in Cn (intersection of the closed ball with the closed set {δ≥1/j}) and bounded, hence compact by [F3] read through [F4]; moreover Kj⊆int⁡Kj+1, because ∣z∣≤j<j+1 and δ(z)≥1/j>1/(j+1) hold for z∈Kj and persist on a small ball around z by continuity of the modulus and of δ; finally ⋃jKj=Ω, since for z∈Ω one has δ(z)>0 (or δ(z)=+∞) and ∣z∣<∞, so some integer j satisfies j≥∣z∣ and 1/j≤δ(z).

2.1step 1.1algebra

Put Km:=∅ for m≤0 and, for j≥1, Sj:=Kj+1∖int⁡Kj−1 and Wj:=int⁡Kj+2∖Kj−2; then every Sj is compact (a closed subset of the compact Kj+1), Sj⊆Wj with Wj open (because Kj+1⊆int⁡Kj+2 and int⁡Kj−1⊇Kj−2), and the Sj cover Ω: for z∈Ω let m0:=min⁡{m:z∈Km}, which exists by step 1.1, so z∈Km0⊆Km0+1 and z∉Km0−1⊇int⁡Km0−1, that is z∈Sm0. The family (Wj)j≥1 is locally finite: a neighbourhood of z contained in int⁡Km0+1 misses every Wj with j≥m0+3, while only finitely many smaller indices remain; thus the family is locally finite.

3.1F5F6step 1.1step 2.1

For each j≥1 the set of finite lists (including the empty list when Sj=∅) ((z1,r1,i1),…,(zN,rN,iN)) with zk∈Sj, rk>0, ik∈I, B‾(zk,3rk)⊆Uik∩Wj and Sj⊆⋃kB(zk,rk) is nonempty: for every z∈Sj⊆Wj the cover {Ui} gives some i(z) with z∈Ui(z), the set Ui(z)∩Wj is open and contains z, so some radius r(z)>0 satisfies B‾(z,3r(z))⊆Ui(z)∩Wj (choosing the pair (i(z),r(z)) by [F6]), and compactness of Sj by step 2.1 lets the resulting open cover be reduced to a finite subcover; by [F5] select one such finite list for every j≥1 and enumerate the union of the selected lists as a sequence (Bk,ik,rk)k∈N of balls Bk=B(zk,rk). Then ⋃kBk⊇⋃jSj=Ω by step 2.1.

4.1F2F4F5step 2.1step 3.1

For each k, [F2] applied with the pair 0<r=rk<R=3rk/2 and the centre zk provides a smooth χk:Cn→[0,1] with χk=1 on B‾(zk,rk) and supp⁡χk⊆B(zk,3rk/2); the balls here are Euclidean balls of R2n under the identification of [F4], so χk∈C∞(Cn). By step 3.1, supp⁡χk⊂B(zk,2rk)⊆Uik∩Wj(k); the countably many choices of the χk are read through [F5]. Since only finitely many selected balls occur for each Wj, each support lies in its assigned Wj, and the family (Wj) is locally finite by step 2.1, every point of Ω has a neighbourhood meeting only finitely many supports, so σ:=∑kχk is a well-defined smooth function on Ω; finally σ≥1 at every point of Ω, because every point lies in some Sj by step 2.1 and hence in some selected ball B(zk,rk) on which χk=1.

5.1F1step 2.1step 3.1step 4.1∎

Define Vk:=B(zk,2rk)∩Ω, so each Vk is open with Vk⊆Ui(k) and with supp⁡χk⊆Vk by step 4.1, and put χ~k:=χk/σ; then χ~k∈C∞(Ω), 0≤χ~k≤1, supp⁡χ~k=supp⁡χk⊆Vk, and ∑kχ~k=1 because ∑kχk=σ. The family (Vk) covers Ω, because ∑kχ~k=1 makes χ~k positive at every point for at least one k, and then that point lies in Vk; it refines (Ui) by the map k↦ik, and is locally finite because Vk⊆Wj(k) and (Wj) is locally finite by step 2.1; the supports of the χ~k are locally finite for the same reason. Hence (χ~k) is a smooth partition of unity subordinate to the locally finite refinement (Vk) in the sense of [F1].

Depends on

Used by

Dependency tree · two levels

55 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