User Tools

Site Tools


math214:01-31

2020-01-31, Friday

\gdef\d\partial

Today is our first encounter with a non-trivial theorem, the Sard theorem.
Theorem(Sard)Given a smooth map F:MNF: M \to N, the set of critical values of FF is a measure zero set in NN.

We recall the definitions

  • A point pMp \in M is a critical point of FF, if dF:TpMTF(p)NdF: T_p M \to T_{F(p)} N is not surjective. The set of critical point is denoted as Cr(F)Cr(F).
  • A point qNq \in N is a critical value of FF, if qq is the image of a critical point. The set of critical value is denoted as ΔF\Delta_F, or called the discriminant locus.
  • A subset ANnA \subset N^n is of measure zero (or negligible), if for any coordinate chart (U,φ)(U, \varphi) on NN, φ(AN)\varphi(A \cap N) is of measure zero in Rn\R^n.

Note: we don't have a canonical measure on NN, but we have a class smooth density on NN, which can be written as a smooth positive function times the Lebesgue measure induced by the coordinates.

It suffices to prove a local version of the Sard theorem, in a coordinate chart.

Theorem (Sard on Rn\R^n) Let URnU \subset \R^n be an open set, F:URmF: U \to \R^m be a smooth map. Assume nmn \geq m. Then the discriminant set ΔF\Delta_F is of measure zero.

Remark: We don't say anything about the measure of Cr(F)Cr(F), in fact, it can be quite large. For example, consider a non-negative function f:RRf: \R \to \R, where ff vanishes on [1,1][-1,1], then [1,1]Cr(f)[-1,1] \subset Cr(f), but f([1,1])f([-1,1]) is just a single point, 00.

(I am copying the proof from Nicholascu's note, page 30, which was originally due to Milnor and Pontryagin.)

We denote Crk(F)Cr(F)Cr^k(F) \subset Cr(F) denote the subset of points in UU such that all partial derivatives of FF up to order kk vanishes (check: this notion does not depends on the choice of coordinates). We obtain a descreasing filtration of closed sets Cr(F)Cr1(F)Cr2(F)Cr3(F) Cr(F) \supset Cr^1(F) \supset Cr^2(F) \supset Cr^3(F) \supset \cdots

Note: A point pCr(F)p \in Cr(F) means dF(p)dF(p) is not surjective, a point pCr1(F)p \in Cr^1(F) means dF(p)=0dF(p)=0.

We prove by induction. The case n=0n=0 is trivial. We assume the case is true for any n<nn' < n and any mnm \leq n'. The inductive step is divided into 3 steps

  1. Step 1: Show that F(CrFCrF1)F(Cr_F - Cr^1_F) is neligible .
  2. Step 2: Show that F(CrFkCrFk+1)F(Cr^k_F - Cr^{k+1}_F) is neglible for all k1k \geq 1
  3. Step 3: Show that the set F(CrFk)F(Cr^k_F) is neglible for some sufficiently large kk.

Step 1: Set CrF=CrFCrF1Cr'_F = Cr_F - Cr_F^1. We will show that there exists a countable open cover {Oj}j=1\gdef\cO{\mathcal O} \{\cO_j\}_{j=1}^\infty of CrFCr'_F, such that F(OjCrF)F(\cO_j \cap Cr'_F) is neglibile for all jj. Since CrFCr'_F is contained in a second countable space Rn\R^n, every open cover has a countable refinement, hence suffice to prove that for each uCrFu \in Cr'_F, there is a neighborhood N\gdef\cN{\mathcal N} \cN, such that F(NCrF)F(\cN \cap Cr'_F) is negligible.

Suppose pCrFp \in Cr'_F, since dF(p)dF(p) is not identifically zero, we may choose coordinate chart (U,(xi))(U, (x_i)) centered around pp and (V,(yj))(V, (y_j)) centered around F(p)F(p), such that in this coordinate F(x1,,xn)=(F1(x),,Fm(x))F(x_1,\cdots,x_n) = (F_1(x), \cdots, F_m(x)), and F1(x)=x1. F_1(x) = x_1. ( Why we can have such coordinates? We can choose coordinate (V,(yj))(V, (y_j)) first, and consider yjFy_j \circ F on F1(V)F^{-1}(V) for all jj, there exists at least one jj, such that d(yjF)(p)0d(y_j\circ F)(p) \neq 0, otherwise dF(p)=0dF(p)=0. Then, wlog, assume j=1j=1, and define x1=y1Fx_1 = y_1 \circ F. )

Next, for every tRt \in \R, set Nt={xNx1=t}\cN_t = \{ x \in \cN \mid x_1 = t\} and define Gt:NtRm1,p(F2(p),,Fm(p)) G_t: \cN_t \to \R^{m-1}, p \mapsto (F_2(p), \cdots, F_m(p)) Observe that F(NCrF)=t{t}×Gt(CrGt) F(\cN \cap Cr'_F) = \bigcup_{t} \{t\} \times G_t(Cr_{G_t}) By the induction hypothesis, we have the statement when the source dimension is n1n-1. Hence the (m-1) Lebesgue measure of Gt(CrGt)G_t(Cr_{G_t}) is zero. By Fubini theorem μm(F(NCrF))=μm1(Gt(CrGt))dt=0. \mu_{m} (F(\cN \cap Cr'_F)) = \int \mu_{m-1}( G_t(Cr_{G_t})) dt = 0.

Step 2: Set CrF(k):=CrFkCrFk+1Cr^{(k)}_F := Cr^k_F - Cr^{k+1}_F, and suppose pCrF(k)p \in Cr^{(k)}_F. We may choose local coordinate s1,,sns_1, \cdots, s_n around pp and y1,,ymy_1, \cdots, y_m around F(p)F(p), such that si(p)=0s_i(p)=0 for all ii and yj(F(p))=0y_j(F(p))=0 for all jj. And furthermore, we assume that k+1y1s1k+1(p)0 \frac{\d^{k+1} y_1}{\d s_1^{k+1}}(p) \neq 0 Then, we define x1=ky1s1kx_1 = \frac{\d^{k} y_1}{\d s_1^{k}} and x2=s2,,xn=snx_2=s_2,\cdots,x_n=s_n. We choose N\cN to be a small enough neighborhood around pp, such that (xi)(x_i) forms a coordinate. Then CrFkNCr^{k}_F \cap \cN is contained in the hyperplane x1=0x_1=0. (indeed, if x10x_1 \neq 0, then one kk-th derivative of FF is non-zero, hence the point is not in CrFkCr^k_F by definition).

Define G:N{x1=0}Rm,G(p)=F(p)pN{x1=0} G: \cN \cap \{x_1=0\} \to \R^m, \quad G(p) = F(p) \forall p\cN \cap \{x_1=0\} Then CrFkN=CrGk,F(CrFkN)=G(CrGk) Cr^k_F \cap \cN = Cr_G^k, \quad F(Cr^k_F \cap \cN ) = G(Cr_G^k) By induction hypothesis, G(CrGk)G(Cr_G^k) is negligible in Rm\R^m, hence F(CrFkN)F(Cr^k_F \cap \cN) is neglibile. By covering CrF(k)Cr^{(k)}_F by such open cover, and take countable refinement, we can conclude that F(CrF(k))F(Cr^{(k)}_F) is negligible.

Step 3 (the key step): Suppose k>n/m1k > n / m - 1. We will show that F(CrFk)F(Cr^k_F) is neglibile. More precisely, for every compact subset SUS \subset U, we will show that F(SCrFk)F(S \cap Cr^k_F) is negligible.

From Taylor expansion around points in SCrFkS \cap Cr^k_F, we know there exists 0<r0<10< r_0 < 1 and λ0>0\lambda_0>0, depending only on SS, such that if CC is a cube with sides r<r0r < r_0 and intersects CrFkSCr^k_F \cap S. Then diam(F(C))<λ0rk+1 diam(F(C)) < \lambda_0 r^{k+1} where for any set ARmA \subset \R^m, the diameter is defined as diam(A)=sup{a1a2,a1,a2A}.diam(A) = sup \{|a_1 - a_2|, a_1, a_2 \in A \}.

( Recall the Taylor expansion formula, if f:RnRf: \R^n \to \R is a smooth function, then for any k0k \geq 0, there exists r>0r>0, and C>0C > 0, such that for any x<r|x|<r, we have f(x1,,xn)=f(0)+1αkf(α)x1α1xnαnα1!αn!+Rk(x) f(x_1, \cdots, x_n) = f(0) + \sum_{1 \leq |\alpha| \leq k } f^{(\alpha)}\frac{x_1^{\alpha_1}\cdots x_n^{\alpha_n}}{\alpha_1! \cdots \alpha_n!} + R_k(x) where the remainder Rk(x)<Cxk+1| R_k(x) | < C |x|^{k+1}. Apply this remainder estimate to each function FiF_i, one can get the diameter)

Hence, the Lebesgue measure of the image is μm(F(C))<C1rm(k+1)=C1μn(C)m(k+1)/n \mu_m(F(C)) < C_1 r^{m(k+1)} = C_1 \mu_n(C)^{m(k+1)/n}

Now, we cover CrFkSCr^k_F \cap S by finitely many cubes {Cl}l=1N\{C_l\}_{l=1}^N, of edges r<r0r< r_0, with disjoint interiors. For each positive integer PP, we may subdivide each ClC_l into PnP^n many subcubes of equal sizes. For every sub-cube ClσC_l^\sigma that intersects CrFkCr^k_F, we have μm(F(Clσ))C1μn(Clσ)m(k+1)/n=C1Pm(k+1)μn(Cl) \mu_m(F(C_l^\sigma)) \leq C_1 \mu_n(C_l^\sigma)^{m(k+1)/n} = \frac{C_1}{P^{m(k+1)}}\mu_n(C_l) Hence μm(F(ClCrFk))=σμm(F(ClσCrFk))Pnm(k+1)μn(C).\mu_m(F(C_l \cap Cr^k_F)) = \sum_{\sigma} \mu_m(F(C_l^\sigma \cap Cr^k_F)) \leq P^{n-m(k+1)} \mu_n(C). Now, we may send PP to \infty, and conclude that μm(F(ClCrFk))=0\mu_m(F(C_l \cap Cr^k_F)) = 0.

math214/01-31.txt · Last modified: 2020/02/03 10:50 (external edit)