Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedverified 2026-09-26 (gpt-6-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.

A smooth exhaustion separates the locally finite chart bands

Statement

Assume countable choice. Let Mn be a noncompact smooth manifold. Then there exist a smooth proper function ρ:M→R, compact bands Km:=ρ−1([m−1,m+2])(m≥1), and smooth maps Hm:M→RQm such that:

  1. each Hm is supported in a neighbourhood of Km;
  2. the supports of Hm and Hm′ are disjoint whenever m≡m′(mod4) and m≠m′;
  3. Hm separates points and tangent vectors on Km; and
  4. ∥Hm∥≤2−m everywhere.

Facts & Assumptions

Given: Countable choice and a noncompact smooth n-manifold M.

[L1]

The manifold admits a smooth proper exhaustion function ρ:M→R (Every smooth manifold admits a smooth proper exhaustion function).

[L2]

A closed set inside an open set admits a smooth cutoff equal to 1 near the closed set and supported in the open set (A smooth Urysohn lemma for a closed set in an open set).

[F1]

A smooth manifold comes with smooth coordinate charts (Smooth manifolds and their smooth charts).

[L3]

Smooth maps that agree on overlaps paste over an open cover (Smooth maps paste over an open cover).

Proof

technique · direct
1.1L1givenconstruct

Choose a nonnegative smooth proper exhaustion ρ from [L1]. Let Km:=ρ−1([m−1,m+2])(m≥1). Each Km is compact and the family (Km) covers M. If m≡m′(mod4) and m≠m′, the defining intervals are separated by a positive gap.

2.1step 1.1construct

Put Om:=ρ−1((m−5/4,m+9/4)). Then Km⊆Om, and Om∩Om′=∅ for distinct congruent indices modulo 4. If Km=∅, take Qm=1 and Hm=0; all four requirements for this index are then immediate. Henceforth suppose Km≠∅.

3.1F1L2step 2.1choose

For every p∈Km, a chart from [F1] can be shrunk over a Euclidean ball to a coordinate domain (U,x) with p∈U, compact closure, and U‾⊆Om. Applying [L2] under countable choice to {p}⊆U gives a smooth ϕ:M→[0,1] supported in U and equal to 1 on an open neighbourhood V of p. The collection of all plateau neighbourhoods V obtainable in this way covers Km, so compactness gives a finite covering list of data (Umj,xmj,ϕmj,Vmj), 1≤j≤rm. Countable choice selects one such list for each nonempty band Km.

4.1F1L3step 3.1construct

For each selected datum define a global block Bmj:M→Rn+1 by Bmj(q):={(ϕmj(q), ϕmj(q)xmj(q)),q∈Umj,0,q∉Umj. On the open cover Umj∪(M∖supp⁡(ϕmj)) the two formulas are smooth and agree on the overlap, so [L3] makes Bmj smooth. Set Hm′:=(Bm1,…,Bmrm):M→Rrm(n+1). Its support lies in the finite union of the compact sets supp⁡(ϕmj)⊆Om.

5.1step 3.1step 4.1algebra

The map Hm′ separates points of Km: if Hm′(p)=Hm′(q), choose j with p∈Vmj. Equality of the first coordinate of the jth block gives ϕmj(q)=1, and equality of the remaining coordinates gives xmj(p)=xmj(q), whence p=q. It also separates tangent vectors: for p∈Vmj, the function ϕmj is locally constant with value 1, so the last n components of dBmj,p are dxmj,p, an isomorphism. Thus dHm,p′ is injective for every p∈Km.

6.1step 4.1step 5.1chooseconstruct

Compact support makes Hm′ bounded. Choose Cm≥1 with ∥Hm′(q)∥≤Cm for every q∈M, and put Hm:=2−mCm−1Hm′. This positive rescaling preserves support and both separation properties, and it gives ∥Hm∥≤2−m everywhere.

7.1step 1.1step 2.1step 4.1step 5.1step 6.1∎

For a nonempty band, steps 4.1 and 6.1 put supp⁡(Hm) inside Om; for an empty band, step 2.1 gives empty support. The sets Om are disjoint for distinct congruent indices modulo 4, so the corresponding supports are disjoint. Together with steps 1.1, 5.1, and 6.1, this proves all four stated properties.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

23 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