Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passverified 2026-09-09 (Codex)
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.

A smooth Urysohn lemma for a closed set in an open set

Statement

Assume countable choice ACω. Let A be a closed subset of a smooth manifold M, and let U⊆M be open with A⊆U. Then there exists a smooth function f:M→[0,1] such that f=1 on an open neighbourhood of A and supp⁡(f)⊆U.

Facts & Assumptions

Given: Countable choice, a closed set A⊆M, and an open set U⊆M containing A.

[A1]

Countable choice selects from countably many nonempty sets (The Axiom of Countable Choice (ACω)). It is used for countable coordinate witnesses, finite annular covers, and bumps, not for choices indexed by all points.

[F1]

A smooth manifold is Hausdorff and has a countable basis. In a smooth chart, sufficiently small coordinate balls have compact closures inside any prescribed open neighbourhood (Smooth manifolds and their smooth charts, Coordinate balls form a basis of a topological manifold).

[L2]

A compact set inside an open set admits a smooth [0,1]-valued bump equal to one near that compact set and supported in the open set (A manifold bump for a compact set inside an open set).

[L3]

A family of smooth functions with locally finite supports has a smooth pointwise sum (A locally finite sum of smooth functions is smooth).

Proof

technique · direct
1.1A1F1givenconstruct

If M=∅ or A=∅, take f=0, using the empty open neighbourhood of A. Otherwise put O0=U and O1=M∖A. Form the set of all tuples consisting of a smooth coordinate ball B, its chart data, and a label a∈{0,1} such that B‾ is compact and lies in Oa. These balls cover M by [F1]. Fix a countable basis. For each nonempty basis member contained in one eligible ball, [A1] chooses one such tuple. The selected balls cover M: every point lies in a basis member inside an eligible ball. Enumerate the selected tuples as (Bn,an), repeating one if the nonempty family is finite. This avoids choosing a ball at every point.

2.1L1step 1.1construct

Put Hr=⋃n≤rBn‾. These sets are compact and closed by [L1], and their interiors cover M. Put r1=1 and let rm+1 be the least integer greater than rm for which Hrm⊆int⁡Hrm+1. Such an integer exists by compactness and the increasing open cover (int⁡Hr). Set Km=Hrm and K0=K−1=∅. Then Km⊆int⁡Km+1 and their interiors cover M. This recursion uses least integers, not dependent choice.

3.1F1L1step 2.1

The sets Cm=Km∖int⁡Km−1 are compact and cover M. For each m, form all tuples (W,V,n) of nested smooth coordinate balls with compact closures satisfying W‾⊆V,V‾⊆Bn∩int⁡Km+1∖Km−2. Their W-sets cover Cm: for x∈Cm, choose one Bn containing x and apply the small-ball construction twice inside the displayed open neighbourhood of x. This is an existence argument at one point, not a simultaneous point-indexed selection. Compactness provides a finite ordered list of such tuples covering Cm.

4.1A1step 2.1step 3.1

Apply [A1] to the countable family of nonempty sets of finite ordered covering lists, taking the empty list when Cm is empty. Label a tuple from annulus m by (m,j). The resulting family (Wm,j) covers M, and (Vm,j) is locally finite: if x∈int⁡Kt, no tuple from m≥t+2 meets int⁡Kt, since its V misses Km−2⊇Kt. Only finitely many tuples occur in the remaining finitely many annuli. The pairs (m,j) form a subset of N2, hence an at most countable index set I.

5.1A1L2L3step 1.1step 4.1choose

For each i=(m,j)∈I, [L2] supplies a nonempty set of smooth bumps gi:M→[0,1] equal to one near Wi‾ and supported in Vi. Use [A1] to choose this countable family. Its supports are locally finite, and G=∑i∈Igi is smooth and strictly positive by [L3], because the Wi cover M. Attach to i the original label an(i) from its tuple.

6.1L3step 4.1step 5.1

For a=0,1, put Sa=⋃i: an(i)=asupp⁡(gi),ha=∑i: an(i)=agi. The sums are smooth by [L3]. Each Sa is closed: around a point outside Sa choose a neighbourhood meeting only finitely many constituent supports, and remove those finitely many closed sets. The resulting neighbourhood misses Sa. Moreover Sa⊆Oa, and the nonzero locus of ha is contained in Sa, so supp⁡(ha)⊆Sa. Thus taking a closure after regrouping does not enlarge the support outside its assigned open set.

7.1L4step 1.1step 5.1step 6.1∎

Since h0+h1=G>0, define f=h0/G. It is smooth by [L4] and lies in [0,1]. Its nonzero locus lies in the closed set S0⊆U, so supp⁡(f)⊆U. On the open set M∖S1, which contains A, one has h1=0 and therefore f=h0/G=1. This proves the required neighbourhood and support assertions, including the empty cases in step 1.1.

Depends on

Used by

Dependency tree · two levels

44 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