Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generated
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.

Strong Whitney approximation by transverse maps

Statement

Assume the Axiom of Countable Choice ACω (The Axiom of Countable Choice (ACω)). Let f:M→N be smooth and let Z⊆N be a closed embedded submanifold. Every neighbourhood of f in the strong smooth topology contains a smooth map g that is transverse to Z.

Facts & Assumptions

Given: ACω, a smooth map f:M→N between smooth manifolds without boundary, a closed embedded submanifold Z⊆N, and a strong smooth neighbourhood U of f.

[A1]

Countable Choice is The Axiom of Countable Choice (ACω). The manifold convention is Hausdorff and second countable (Smooth manifolds and their smooth charts). The embedding, tubular neighbourhood, chart-cover, partition and parametric-transversality suppliers below carry this same premise; no dependent choice or uncountable family choice is used.

[F1]

The strong Cr topology, for a finite integer r≥0, has basic neighbourhoods specified by a locally finite source chart family (Ui,φi), compact sets Ki⊆Ui, target charts (Vi,ψi) with f(Ki)⊆Vi, and tolerances bi>0. They require h(Ki)⊆Vi and max⁡∣α∣≤rsup⁡x∈φi(Ki)∣Dα(ψi∘h∘φi−1)(x)−Dα(ψi∘f∘φi−1)(x)∣<bi for every i. The strong smooth topology on C∞(M,N) is generated by the restrictions of these topologies for finite r. Thus any neighbourhood contains a finite intersection of such basic sets. Combining their finitely many locally finite chart families gives locally finite compact constraints with a finite derivative order ri for each constraint. This is the coordinate definition of the topology, not a density assumption.

[L1]

Under [A1], there is a smooth Euclidean embedding e:N↪Rd (Every smooth manifold embeds in some finite-dimensional Euclidean space). The Euclidean tubular theorem and its normal-addition construction supply an open set T⊆Rd containing e(N) and a smooth retraction R:T→N with R∘e=id⁡N; R is a submersion because in normal-bundle coordinates it is the bundle projection (The Euclidean tubular neighbourhood theorem, The normal addition map for a Euclidean submanifold).

[L2]

Under [A1], an open cover has a countable subordinate relatively compact coordinate-ball cover and a countable locally finite shrinking; a smooth subordinate partition of unity exists (Every open cover of a manifold has a countable relatively compact coordinate-ball subcover, A countable coordinate-ball cover has a countable locally finite shrinking, Smooth partitions of unity exist on manifolds). In particular one obtains a locally finite compact coordinate cover and a countable partition (ηj)j≥1 with compact locally finite supports; a finite partition is padded by zero functions.

[L4]

Under [A1], if a smooth evaluation map F:M×B→N is transverse to Z, its nontransverse slice parameters form a null subset of B (Parametric transversality). Nullity in a Euclidean chart is the cube-cover nullity of Null subsets of a smooth manifold and Measure zero and content zero in Rm by countable and finite cube covers. A compact null subset of positive-dimensional Euclidean space has content zero (For compact subsets of Rm, measure zero and content zero coincide); cube volumes and finite grid additivity are Axis-parallel rectangles in Rm and their volume.

Proof

technique · direct, by a smooth perturbation amplitude with prescribed local derivative bounds and a finite-dimensional Sard parameter
1.1givenL1

If M=∅, its unique map is already transverse and lies in U. Otherwise N≠∅. Fix e,T,R as in [L1]. The ambient dimension supplied by the embedding theorem is positive, so take d≥1.

2.1A1F1L2step 1.1

Choose a finite intersection of the basic sets of [F1] contained in U. List its compact chart constraints (Ki,φi,ψi,ri,bi). Their nonempty source chart domains form an at-most-countable family: in a countable basis assign to each domain the least nonempty basis member contained in it. Each basis member is assigned only finitely many domains, since a point of that member belongs to all of them and the family is locally finite. Countable Choice enumerates these finite fibres. Add a locally finite compact coordinate cover subordinate to the open sets f−1(V) for target chart domains V, using [L2], with derivative order zero and tolerance one. The combined constraints are still countable and locally finite; their compact sets now cover M. They only impose extra restrictions, so satisfying all of them implies membership in U.

3.1L1L3step 2.1

For one nonempty Ki consider, in source coordinates, Ei(x,v):=ψi(R(e(f(φi−1(x)))+v)). This is smooth on an open neighbourhood of φi(Ki)×{0}. Compactness gives a positive ti and a compact neighbourhood of φi(Ki) within its coordinate domain such that Ei is defined on that neighbourhood times {∣v∣≤ti}, with the retraction argument in T and the result in Vi. Every finite collection of derivatives of Ei is bounded and uniformly continuous on this compact product by [L3].

4.1L3step 3.1

There is ai>0 such that any smooth u:M→Rd with max⁡∣α∣≤risup⁡x∈φi(Ki)∣Dα(u∘φi−1)(x)∣<ai makes R(e∘f+u) satisfy constraint i. Here the assertion only concerns points of Ki where the expression is defined; the zeroth-order bound ensures that it is defined there. To verify the derivative estimate, repeated chain and product rules express each Dα(Ei(x,u(x))) as a finite sum of derivatives DxβDvγEi(x,u(x)) multiplied by products of derivatives Dνu(x). At u=0 and all its derivatives zero the sum equals DαEi(x,0). As the finitely many derivative variables tend to zero, terms having a positive-order derivative of u tend uniformly to zero by the compact derivative bounds of step 3.1; terms without such a factor converge uniformly by uniform continuity there. Choose ai<ti small enough to make all these finitely many differences less than bi. Take the first number 2−q, q≥1, for which these conclusions hold, so choosing all ai makes no new family choice. Empty Ki may be omitted.

5.1L2L3step 4.1

Choose the partition (ηj) from [L2]. For each i,j put Aij:=max⁡∣α∣≤risup⁡x∈φi(Ki)∣Dα(ηj∘φi−1)(x)∣. These numbers are finite by [L3]. For each j, the set Ij:={i:Ki∩supp⁡ηj≠∅} is finite: every point of the compact support has a neighbourhood meeting only finitely many Ki, and a finite subcover gives finitely many indices in total. Define cj:=min⁡({1}∪{ai2−j−11+Aij:i∈Ij})>0,ε:=∑j≥1cjηj. The sum is locally finite and smooth, and ε>0 because the nonnegative partition sums to one and every cj>0. All coefficients are explicit finite minima.

6.1L3step 5.1

For every i, the compact Ki meets only finitely many partition supports, by the same compactness argument. Outside a support a smooth function and all its derivatives vanish. Therefore differentiation of the locally finite sum and the triangle inequality give max⁡∣α∣≤risup⁡φi(Ki)∣Dα(ε∘φi−1)∣≤∑j:i∈IjcjAij≤ai∑j≥12−j−1=ai2<ai. This controls the entire prescribed finite jet on every compact, with tolerances allowed to shrink independently towards infinity.

7.1L1L3step 2.1step 4.1step 6.1

Let B={a∈Rd:∣a∣<1} and define F(x,a):=R(e(f(x))+ε(x)a). For every a∈B, each derivative of ua(x):=ε(x)a in constraint i is bounded by ∣a∣ times the corresponding bound of step 6.1. Since the Ki cover M, step 4.1 makes the retraction argument lie in T at every x, so F is a globally defined smooth map. It also makes every slice Fa satisfy every original neighbourhood constraint, hence Fa∈U. Finally F0=R∘e∘f=f.

8.1L1L3step 5.1step 7.1

The parameter differential at (x,a) is DaF(x,a)=ε(x) dRe(f(x))+ε(x)a:Rd⟶TF(x,a)N. It is surjective because ε(x)>0 and R is a submersion. Thus the total evaluation map is a submersion and therefore transverse to Z: its differential already spans the whole target tangent space.

9.1L4step 8.1

By [L4], the bad slice parameters are null in B. They cannot exhaust B. Indeed B contains a closed positive-side cube Q. If Q were null, compact-null/content-zero equivalence in [L4] would give finite cube covers of arbitrarily small total volume. Every finite cube cover of Q has total volume at least vol⁡(Q)>0: subdivide a containing rectangle at all cube endpoints, and assign each positive-volume grid cell of Q to the least covering cube that contains its midpoint. Such a cell lies wholly in that cube; finite grid additivity gives the stated volume bound. This contradiction proves that some a∈B is good. No countable sequence of good parameters is selected.

10.1A1step 1.1step 7.1step 9.1∎

Choose this one good a and set g=Fa. It is smooth and transverse to Z by step 9.1, and lies in U by step 7.1. This proves the full strong smooth density, including noncompact M. Empty source was treated in step 1.1; zero-dimensional source or target is allowed throughout, and no positive target dimension was needed for surjectivity onto its tangent spaces. Exactly [A1] is inherited through the stated suppliers; the jet radii and amplitude coefficients were defined canonically, and the final parameter selection is a single existential choice.

Source locator

Hirsch, Differential Topology, Ch. 2 §1, printed pp. 34–36, defines the strong finite-order chart neighbourhoods and the strong smooth topology generated by their restrictions. Ch. 3 §2, Theorem 2.1, printed pp. 74–77, proves transversality density through Lemma 2.3's Sard translations and Theorem 2.2's locally finite globalization/Baire argument. The proof here uses the already proved Euclidean embedding, smooth tubular retraction, partition and parametric Sard suppliers to replace that globalization: steps 3.1–7.1 prove the required noncompact derivative control directly. The external density theorem is not used as a proof premise.

Depends on

Used by

Dependency tree · two levels

105 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