Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passverified 2026-09-23 (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.

The weak Whitney proper embedding theorem

Statement

Assume ACω (The Axiom of Countable Choice (ACω)). Every smooth n-manifold admits a proper smooth embedding into R2n+1.

Facts & Assumptions

Given: ACω and a smooth n-manifold M. The choice assumption is used in [L1] to obtain the initial finite-dimensional embedding.

[L1]

The manifold embeds in some finite-dimensional Euclidean space, and in the noncompact case one may choose an embedding (G,ρ) with G bounded and ρ proper (Every smooth manifold embeds in some finite-dimensional Euclidean space).

[L2]

A projection that avoids secant and tangent directions preserves injectivity and immersion, and in the bounded-plus-proper model it also preserves properness (A generic linear projection preserves injectivity and immersion, A generic projection can preserve properness).

[L3]

A proper injective immersion is a smooth embedding (A proper injective immersion is a smooth embedding).

Proof

technique · direct
1.1L1givenchoose

Choose the embedding F:M→Rd from [L1]. If M is compact, F is automatically proper. If M is noncompact, use the supplied form F=(G,ρ) relative to a decomposition Rd=e⊥⊕Re, with G bounded and ρ proper.

2.1step 1.1construct

If d≤2n+1, compose F with a linear isometric inclusion Rd↪R2n+1. This composite is still a proper smooth embedding, so the theorem is proved in this case. Hence assume d>2n+1.

3.1L2L3step 1.1step 2.1choose

The generic-projection lemma in [L2] gives a dense set of directions u∈Sd−1 for which Pu∘F is an injective immersion. If M is compact, choose any such u; the projected map is proper because its source is compact. If M is noncompact, the set Sd−1∖{e,−e} is a nonempty open set, so it meets the dense good-direction set. Choose u in that intersection. Then u is not parallel to the proper-coordinate axis, and the corrected properness lemma in [L2] makes Pu∘F proper. In either case [L3] upgrades the proper injective immersion to a smooth embedding into u⊥≅Rd−1.

4.1L2step 1.1step 3.1algebra

In the noncompact case put e′:=Pu(e)≠0 and decompose u⊥=Re′⊕(e′)⊥. The component of Pu∘F=Pu(G)+ρe′ perpendicular to e′ is bounded. Its scalar component along e′/∥e′∥ is ∥e′∥ρ+b with b bounded, and the argument in the properness lemma shows this function is proper. Thus the projected embedding again has bounded-plus-proper form, now with proper-coordinate unit vector e′/∥e′∥.

5.1L2L3step 2.1step 3.1step 4.1induction

If the new ambient dimension is still greater than 2n+1, repeat steps 3.1-4.1. Step 3.1 restores the embedding hypothesis after each projection; compactness preserves properness in the compact case, and step 4.1 preserves the bounded-plus-proper form in the noncompact case. After the finite number d−(2n+1) of projections, the ambient dimension is 2n+1 and the resulting map is a proper smooth embedding.

6.1step 2.1step 5.1∎

The low-dimensional branch is step 2.1, and the projection branch is step 5.1. Therefore every smooth n-manifold admits a proper smooth embedding into R2n+1.

Depends on

Used by

Dependency tree · two levels

41 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