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 embeds in some finite-dimensional Euclidean space

Statement

Assume countable choice ACω. Every smooth manifold embeds smoothly in some finite-dimensional Euclidean space. More precisely, for a smooth n-manifold M there are a bounded smooth map G:M→R4(2n+1) and a smooth nonnegative proper exhaustion ρ:M→R such that J:M⟶R4(2n+1)×R,J(p)=(G(p),ρ(p)) is a proper smooth embedding. In particular the bounded-plus-proper form is available when M is noncompact.

Facts & Assumptions

Given: A smooth n-manifold M and countable choice.

[A1]

Countable choice selects countably many nonempty sets of complete witnesses (The Axiom of Countable Choice (ACω)). Below these are chart witnesses, finite band data and finite projection certificates. No dependent choice or uncountable simultaneous selection is used.

[F1]

Smooth manifolds are Hausdorff and second countable, with smooth coordinate charts and relatively compact small coordinate balls (Smooth manifolds and their smooth charts, Coordinate balls form a basis of a topological manifold). Smoothness of Euclidean-valued maps is componentwise in charts, including dimension zero (Cr and smooth maps between smooth manifolds).

[L1]

Under [A1], M has a smooth nonnegative function ρ with compact closed sublevel sets (Every smooth manifold admits a smooth proper exhaustion function).

[L3]

A compact set in an open set admits a smooth [0,1]-valued bump equal to one near it and supported in the open set (A manifold bump for a compact set inside an open set). Locally finite smooth sums are smooth; smoothness is local and smooth maps are continuous (A locally finite sum of smooth functions is smooth, Smoothness is local on the source, Smooth maps are continuous).

[L4]

Rational coordinates are countable and dense, and finite products of their enumerations are countable by repeated pairing (Q is countably infinite, Both Q and R∖Q are dense in R, and every nonempty open subset of R is uncountable, N×N≈N).

[L5]

A cube of side ℓ in Rb has volume ℓb, with finite additivity on rectangular grid subdivisions. Nullity means countable closed-cube covers of arbitrarily small total volume; content zero allows finite covers (Axis-parallel rectangles in Rm and their volume, Measure zero and content zero in Rm by countable and finite cube covers). Under [A1], subsets and countable unions of Euclidean null sets are null (Subsets and countable unions of null subsets of Rm are null).

[F2]

A smooth embedding is an injective immersion that is a homeomorphism onto its image (Smooth embeddings).

Proof

technique · direct
1.1A1F1givenconstruct

If M=∅, take the empty maps; all conclusions hold. Otherwise choose a countable smooth atlas as follows. Fix a countable topological basis and form all smooth chart tuples. For each nonempty basis member contained in a chart domain, [A1] selects one such tuple. These chart domains cover M because every point lies in a basis member inside some chart. Enumerate them as (Uj,xj), repeating one if the family is finite. This construction records chart witnesses rather than assuming a countable-atlas theorem with missing choices.

1.2L4L5L6L7constructalgebra

We first prove a Euclidean estimate for later use. Let f:D→Rb be C1, where D⊆Ra is open and 0<a<b. Its domain is covered by the countable family of positive-side rational closed cubes Q⊆D, by [L4]. For a fixed such cube choose a slightly larger closed cube Q′ with Q⊆int⁡Q′⊆Q′⊆D. Compactness and continuity of the finitely many derivative entries bound the derivative norm on Q′ by some finite L≥1. Apply [L7] on the convex OPEN set int⁡Q′ to see that f∣Q is L-Lipschitz. If Q has side ℓ, subdividing into sa cubes gives an image cover by sa closed b-cubes of side 2La ℓ/s, centred at images of the prescribed lower corners. Its total volume is (2La ℓ)bsa−b, which tends to zero. Thus f(Q) has content zero.

1.3L5L6algebra

A nonempty open subset of Rb, b≥1, is not null. Indeed it contains a positive-side closed cube Q0. If this cube were null, [L6] would give finite cube covers with arbitrarily small total volume. Every finite cube cover of Q0 has total volume at least vol⁡(Q0): subdivide a bounding rectangle at all cover-cube and Q0 endpoint coordinates. Each positive-volume cell in Q0 lies in some covering cube, as is seen at its midpoint, and can be assigned to the least such index. By the finite volume additivity in [L5], the sum of volumes assigned to one covering cube is at most its volume, while all cells of Q0 have total volume vol⁡(Q0)>0. This contradicts content zero.

1.4L1L2L3constructalgebra

Choose ρ≥0 from [L1]. For each integer m≥1 set Km=ρ−1([m−1,m+2]),Om=ρ−1((m−5/4,m+9/4)). The sets Km are compact by [L1] and [L2], they cover M, and Km⊆Om. The open sets Om and Om′ are disjoint when m≠m′ and m≡m′(mod4). The entire family (Om) is locally finite: the open neighbourhood ρ−1((ρ(p)−1,ρ(p)+1)) can meet Om only for integers m in a bounded real interval, hence only finitely many m.

2.1L5step 1.2

Taking the countable union over those rational cubes and using [L5] shows that f(D) is null. If a=0<b, D is empty or a singleton and the same conclusion follows from a degenerate zero-volume cube. In particular this estimate applies to any C1 map on an open subset of R2n with values in Rd−1 when d>2n+1. It uses only Euclidean cube nullity, not atlas invariance of manifold null sets or an equidimensional Lipschitz theorem on the wrong domain.

2.2F1L2L3step 1.4

For a fixed nonempty Km, take all tuples (U,x,χ,V) in which (U,x) is a relatively compact smooth coordinate ball with U‾⊆Om, χ:M→[0,1] is smooth with support in U, and V⊆U is open with χ=1 on V. Their V-sets cover Km: at a fixed point choose a small chart and apply [L3] to the compact singleton in its domain. By [L2] there is a finite ordered list of such tuples whose V-sets cover Km. This is a finite subcover of the set of ALL eligible data, not a choice of data at every point.

3.1L4L5L7step 1.1step 2.1construct

We now prove the required projection assertion locally. Let K⊆M and let h:M→Rd be smooth, injective on K, with dhp injective for every p∈K, where d>2n+1. Write h=(h′,hd) with h′ taking values in Rd−1. For a parameter v∈Rd−1 define Lv(z′,zd)=z′−vzd. Bad secant parameters are values of h′(q)−h′(p)hd(q)−hd(p) wherever the denominator is nonzero. In every chart pair from step 1.1 this is a smooth map on an open subset of R2n. By steps 2.1 and [L5], its image, united over countably many chart pairs, is null.

3.2L5L7step 1.1step 2.1step 1.3choose

In a source chart with coordinates x, write hj=h∘xj−1. Bad tangent parameters are values of Dhj′(x)wDhd,j(x)w on the open subset of (xj(Uj))×Rn where the denominator is nonzero. This is smooth because h is smooth, and its domain has dimension 2n. Steps 2.1 and [L5] make the union of these images over all chart indices null. Thus the union of bad secant and tangent parameters is null in Rd−1 and cannot be all of it by step 1.3. Choose v outside that union.

3.3F1L2L3L7step 2.2construct

For one such finite list, define each coordinate-bump block on U by (χ,χx1,…,χxn) and by zero outside U. It is smooth: on the open cover U and M∖supp⁡χ the formulas are smooth and agree; continuity follows by the same open-cover argument. Concatenate the finitely many blocks into Bm:M→Rqm. Its support is contained in a finite union of compact supports inside Om. If Bm(p)=Bm(q) with p,q∈Km, a block whose χ equals one near p also has χ(q)=1, and equality of its chart coordinates gives p=q. At p∈Km that block's differential includes the invertible chart differential, so dBm,p is injective.

4.1step 3.1step 3.2algebra

The map Lvh is injective on K. For if its values at p,q∈K agree and hd(p)≠hd(q), the quotient in step 3.1 equals v, a contradiction. If hd(p)=hd(q), the equality also gives h′(p)=h′(q), hence p=q. Similarly, if d(Lvh)p(w)=0 for p∈K and a tangent vector w, a nonzero last component of dhp(w) would make v a bad tangent parameter. A zero last component forces all of dhp(w) to be zero, so w=0. This proves the immersion property on K. Notice that h was never assumed to be a global embedding.

4.2L2L3step 3.3constructalgebra

The continuous map Bm is bounded. To see this without assuming a metric on M, its compact support is covered by the increasing open sets {p:∥Bm(p)∥<r}, r≥1 an integer; a finite subcover gives one bound, and Bm=0 off the support. Choose the least integer cm≥1 strictly bounding its norm and set Hm=2−mcm−1Bm. Then ∥Hm∥≤2−m, its support lies in Om, and it retains both separation properties on Km. If Km is empty take Hm=0 into R, with the properties vacuous.

5.1step 3.1step 3.2step 4.1algebra

Replace Lv by Tv=(1+∥v∥)−1Lv. This nonzero rescaling preserves both properties and is a contraction, since ∥Lv(z′,zd)∥≤∥z′∥+∥v∥∣zd∣≤(1+∥v∥)∥(z′,zd)∥. Repeat the proved assertion a finite number of times until the target dimension is D=2n+1; if the initial dimension is smaller, pad by zero coordinates. Thus every such h has a linear contraction T into RD preserving injectivity and injective differential on K. Each finite list of admissible parameters exists by finite induction; no countably dependent selection has been used.

6.1A1step 5.1step 2.2step 3.3step 4.2choose

Use [A1] on the countable family of nonempty sets of finite covering lists from step 2.2 to obtain the maps Hm simultaneously. For each resulting Hm, step 5.1 supplies a nonempty set of finite projection certificates; a second application of [A1] selects one certificate for each m. Let Tm be its contraction into the fixed RD, and put Cm=TmHm. Then Cm is smooth, supported in Om, bounded by 2−m, injective on Km, and has injective differential there. This explicitly accounts for the countably many variable-length finite projection constructions.

7.1L3step 1.4step 6.1constructalgebra

For r=0,1,2,3 put Gr=∑m≥1m≡r (4)Cm,G=(G0,G1,G2,G3). Local finiteness from step 1.4 and [L3] make these maps smooth componentwise. In each colour at most one term is nonzero at any point, by the disjointness of the Om. Thus ∥Gr∥≤1 and ∥G∥≤2 on all of M. Define J=(G,ρ).

8.1step 1.4step 6.1step 7.1algebra

If J(p)=J(q), the equality ρ(p)=ρ(q) puts both points in some common Km, since the intervals defining the Km cover [0,∞). On Om the colour m mod 4 component of G is exactly Cm, all other terms of that colour vanishing there. Hence Cm(p)=Cm(q) and step 6.1 gives p=q. At a point p∈Km, the same component agrees with Cm on the open neighbourhood Om, so its differential is injective. Therefore dJp is injective. This proves that J is an injective immersion.

8.2L1L2L3step 7.1

The map J is proper. For a compact subset B of its Euclidean target, compactness bounds the last coordinate above by some R and makes B closed. Thus J−1(B) is a closed subset of the compact sublevel set {ρ≤R}, hence compact by [L1] and [L2].

9.1F2L1L2L6step 1.1step 1.4step 7.1step 8.1step 8.2∎

Finally J is a homeomorphism onto its image. Indeed, for a closed subset A⊆M and a point z∉J(A), take the closed Euclidean unit ball B about z. By step 8.2 the set A∩J−1(B) is compact. Its continuous image C is compact: pull back any ambient open cover, take a finite subcover, and map it forward. Thus C is closed by [L2]. The open neighbourhood int⁡B∖C of z misses J(A), showing that J(A) is closed in the ambient Euclidean space. Hence the continuous bijection J:M→J(M) is closed and has continuous inverse. Together with step 8.1, [F2] makes J a smooth embedding. The bounds in step 7.1 and the exhaustion from step 1.4 give all the claimed bounded-plus-proper conclusions, including the empty case.

Depends on

Used by

Dependency tree · two levels

153 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