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.

Every smooth manifold admits a smooth proper exhaustion function

Statement

Assume countable choice ACω. Every smooth manifold M admits a smooth nonnegative function h:M→[0,∞) whose closed sublevel sets are compact. In particular h is proper: the inverse image of each compact subset of [0,∞) is compact.

Facts & Assumptions

Given: A smooth manifold M and countable choice.

[A1]

Countable choice selects from countably many nonempty sets (The Axiom of Countable Choice (ACω)).

[F1]

A smooth manifold is Hausdorff and second countable. Small balls in smooth charts have compact closures (Smooth manifolds and their smooth charts, Coordinate balls form a basis of a topological manifold).

[L2]

For a compact set K in an open set V, there is a smooth χ:M→[0,1] equal to one near K and supported in V (A manifold bump for a compact set inside an open set).

[L3]

A locally finite family of smooth functions has a smooth sum, and smooth maps are continuous (A locally finite sum of smooth functions is smooth, Smooth maps are continuous).

Proof

technique · direct
1.1A1F1givenconstruct

If M=∅, the empty function has all the stated properties. Otherwise form the set of all relatively compact smooth coordinate-ball tuples, including their chart data. Their balls cover M by [F1]. Fix a countable basis. For each nonempty basis member contained in an eligible ball, [A1] selects one such tuple. The selected balls cover M, since every point lies in a basis member contained in an eligible ball. Enumerate them as (Bn)n≥1, repeating one if the nonempty selected family is finite. This uses countably many choices, not a choice at every point.

2.1L1step 1.1construct

Put Hr=⋃n≤rBn‾. By [L1], these are compact and closed, and their interiors form an increasing open cover of M. Set r1=1 and recursively let rm+1 be the least integer greater than rm satisfying Hrm⊆int⁡Hrm+1. Compactness gives such an integer by taking a finite subcover of Hrm from the increasing interiors. For Km=Hrm, one has Km⊆int⁡Km+1,M=⋃m≥1int⁡Km. The recursion is by least integers and needs no dependent choice.

3.1A1L2L4step 2.1choose

For each n≥1, the set of smooth cutoffs χn:M→[0,1] equal to one near Kn and supported in int⁡Kn+1 is nonempty by [L2]. Use [A1] to choose one cutoff for each n. Put gn=1−χn, a smooth nonnegative function by [L4].

4.1L3step 2.1step 3.1

The support family (supp⁡gn) is locally finite, not merely pointwise finite. Indeed, for x∈int⁡Kt and every n≥t, one has int⁡Kt⊆Kn, so χn=1 on that whole open set. Thus gn vanishes there and its support misses int⁡Kt. This neighbourhood meets at most the supports with n<t. Hence h=∑n≥1gn is smooth, continuous and nonnegative by [L3].

5.1L1step 2.1step 3.1step 4.1algebra

Let c≥0 and choose an integer N>c. If x∉KN+1, then for each 1≤n≤N the support of χn is contained in Kn+1⊆KN+1, so χn(x)=0 and gn(x)=1. Consequently h(x)≥N>c. Thus {x:h(x)≤c}⊆KN+1. This sublevel set is closed by continuity of h, hence compact by [L1]. For c<0 it is empty and therefore compact.

6.1L1step 1.1step 4.1step 5.1∎

Finally let C⊆[0,∞) be compact. It is closed by [L1], and the increasing open cover ([0,n))n≥1 of [0,∞) gives an integer N with C⊆[0,N] by a finite subcover. Therefore h−1(C) is a closed subset of the compact sublevel set {h≤N}, hence compact by [L1]. Together with the empty case, this proves properness and the stated exhaustion properties.

Depends on

Used by

Dependency tree · two levels

49 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