Processing math: 100%

2024年3月25日 星期一

Solution to Partial Differential Equations: Methods and Applications (Robert McOwen) Section 6.1

Solution to Partial Differential Equations: Methods and Applications (Robert McOwen) Section 6.1

    1. If X is a normed vector space, prove that |xy|xy.
    2. Show that the norm defines a continuous function on X.
    3. If X is a real inner product space, prove (1).
  1. Solution
    1. By the triangle inequality, we have

      xy=(xy)+yyxy+yy=xy,yx=(yx)+xxyx+xx=xy.

      Thus, we obtain xyxyxy, i.e., |xy|xy.
    2. Let f:XR be defined by f(x)=x for xX. For any ϵ>0, we pick δ=ϵ. Then for x,yX and xy<δ, we use (a) to find

      |f(x)f(y)|=|xy|xy<δ=ϵ.

      This shows f is continuous on X.
    3. If y=0, then we have y=0,0=0 and

      x,0=¯0,x=¯0+0,x=¯0,x+0,x=¯0,x+¯0,x=x,0+x,0,

      which shows x,0=0. Thus, |x,0|=0=xy, i.e., the equality holds true (even over the complex field). Now we suppose y0 and consider the function g g:RR be defined by g(t)=xty2. Clearly, g is nonnegative on R. Then we observe that

      0xty2=xty,xty=x,xtyty,xty=xty,xtxty,y(since$X$isarealinnerproductspace)=x,xty,xtx,y+t2y,y=x22tx,y+t2y2for tR.

      Taking x,yy2, we get

      x22x,y2y2+x,y2y4y20,

      which implies x,y2x2y2, i.e., |x,y|xy. The proof is complete.

  2. Use Hölder's inequality to prove the generalized Hölder's inequality

    Ω|uvw|dxupvqwr

    for uLp(Ω), vLq(Ω), and wLr(Ω), where p1+q1+r1=1.
  3. SolutionFirstly we claim that vwLp, where p satisfies (p)1=1p1=q1+r1. Since vLq(Ω) and wLr(Ω), we have vpLq/p(Ω) and wpLr/p(Ω). Since 1q/p+1r/p=1, we can apply Hölder's inequality to get vpwpL1(Ω) and

    vwpp=Ω|vw|pdx=Ω|vpwp|dxvpq/pwpr/p=(Ω|v|qdx)p/q(Ω|w|rdx)p/q=vpqwpr,

    which gives vwpvqwr. Therefore, we can use Hölder's inequality again to get

    Ω|uvw|dx=Ω|u||vw|dxupvwpupvqwr.

    The proof is complete.

  4. Use Hölder's inequality to prove

    uquλpu1λrfor uLp(Ω)Lr(Ω),

    where pqr and q1=λp1+(1λ)r1.
  5. SolutionSince 1p/(λq)+1r/((1λ)q)=1, we can use Hölder's inequality to get

    uq=uq1/q1=uλqu(1λ)q1/q1uλq1/qpλqu(1λ)q1/qr(1λ)q=(Ω|uλq|pλqdx)λp(Ω|u(1λ)q|r(1λ)qdx)(1λ)r=[(Ω|u|pdx)1p]λ[(Ω|u|rdx)1r]1λ=uλpu1λr.

    Remark. When Ω has a finite Lebesgue measure, i.e., μ(Ω)<, Lr(Ω)Lp(Ω) for p<r. To see this, we let fLr(Ω) and define Ω1={xΩ:|f|1} and Ω2={xΩ:|f|>1}. Then

    Ω|f|pdμ=Ω1|f|pdμ+Ω2|f|pdμΩ11dμ+Ω2|f|rdμ<,

    which shows fLp(Ω). Here we have used the fact that μ(Ω1)μ(Ω) and μ(Ω) is finite. However, it is not true when μ(Ω)= so one may modify the condition for this case.


  6. let 2 denote the space of all sequences of real numbers {an}n=1 such that a2n<.
    1. Verify that {an},{bn}=anbn is an inner product on 2.
    2. Verify that 2 is a Hilbert space (i.e., complete in the induced norm).
  7. Solution
    1. Let 0={0}n=1. Then 0,0=02=0. For {an}0, i.e., there exists mN such that am0, we have

      {an},{an}=a2na2m>0.

      Since {an} and {bn} are sequences of real numbers, it is clear that

      {an},{bn}=anbn=¯bnan=¯{bn},{an}.

      For λ,μR and {an},{bn},{cn}2, we have

      λ{an}+μ{bn},{cn}=(λan+μbn)cn=λancn+μbncn=λ{an},{cn}+μ{bn},{cn}.

      Therefore, , is an inner product on 2.
    2. Let {an}(k)={a(k)n} be the Cauchy sequence in 2 for kN, i.e., for any ϵ>0, there exists K1N such that {an}(k){an}(m)<ϵ for k,m>K1, where {an}={an},{an}. In addition, by the triangle inequality, there exists K2 such that {a(k)n}<1+{a(K1)n}:=M for k>K2. For any nN and k,m>N, we have

      |a(k)na(m)n|(a(k)na(m)n)2j=1(a(k)ja(m)j)2={an}(k){an}(m)<ϵ.

      Thus, for any fixed nN, {a(k)n}k=1 is Cauchy sequence in R, i.e., limka(k)n exists and is denoted by a()n. Now we claim that the sequence {a()n} is in 2. For any positive integer NN, we notice that

      Nn=1(a()n)2=Nn=1limk(a(k)n)2=limkNn=1(a(k)n)2limkn=1(a(k)n)2limkM2=M2.

      Since the upper bound for Nn=1(a()n)2 is independent of N, the series Nn=1(a()n)2 is convergent, i.e., n=1(a()n)2< and hence {a()n}2. Finally, we note that

      Nn=1(a(k)na()n)2=Nn=1(a(k)nlimma(m)n)2=limkNn=1(a(k)na(m)n)2limkn=1(a(k)na(m)n)2limk{a(k)n}{a(m)n}|2ϵ2for NN and kK1.

      Therefore, {a(k)na()nϵ for kK1, which implies limk{a(k)na()n=0, i.e., a(k)n converges to a()n in 2. Therefore, 2 is a Hilbert space.

  8. Let Ω=(0,1).
    1. Verify that du/dx (given in Example 4) is the weak derivative of u.
    2. For what values of α is u(x)=|x|α in H1,2(Ω)?
  9. Solution
    1. For ϕC0(Ω)=C0((0,1)), it is easy to verify that Ωudϕdxdx=Ωϕdudxdx as follows:

      20udϕdxdx=1/20xdϕdxdx+11/2(1x)dϕdxdx=xϕ(x)|1/201/20ϕ(x)1dx+(1x)ϕ(x)|11/211/2ϕ(x)(1)dx=1/20ϕ(x)dx+11/2ϕ(x)dx=10ϕdudxdx.

      Thus, du/dx is the weak derivative of u.

      Remark. The original question is that "Compute the weak derivative of the function u of Example 4." However, the weak derivative is given in Example 4 at page 166 so I modify the statement to make it sense.
    2. For xΩ=(0,1), function u can be denoted as u(x)=xα. Then u(x)=αxα1 for x(0,1). Clearly, uC1(Ω). Hence it suffices to find suitable α such that u21,2<. When α>1/2, we find

      u21,2=10(|u|2+|u|2)dx=10(α2x2α2+x2α)dx=α2x2α12α1+x2α+12α+1|10=α22α1+12α+1<.

      However, when α=1/2, we have

      u21,2=10(|u|2+|u|2)dx=10(14x1+x)dx=lnx4+x22|10=.

      For α<1/2 but α1/2, we have

      u21,2=10(|u|2+|u|2)dx=10(α2x2α2+x2α)dx=α2x2α12α1+x2α+12α+1|10=.

      For α=1/2, we have

      u21,2=10(|u|2+|u|2)dx=10(14x3+x1)dx=x28+lnx|10=.

      Therefore, uH1.2(Ω) for and only for α>1/2.

  10. Prove that H1,p0(Rn)=H1,p(Rn) for 1p<.
  11. SolutionFor uC10(Rn), we have u1,p<, which implies

    C10(Rn){uC1(Rn):u1,p<}¯{uC1(Rn):u1,p<}=H1,p(Rn).

    Taking the clourse in the norm 1,p, we obtain H1,p0(Rn)=¯C10(Rn)H1,p(Rn). Conversely, let uH1,p(Rn), i.e., there exists a sequence {um}m=1 such that umC1(Rn) with limmumu1,p=0. Let ϕC0([0,)) satisfy ϕ(t)=1 for 0t1; ϕ(t)=0 for 2t< and 0ϕ(t)1 for t0. Then we define um,k(x)=um(x)ϕ(k1|x|) for xRn and m,kN. Clearly, um,kC10(Rn). For i{1,,n}, we have

    um,kxi(x)=umxi(x)ϕ(k1|x|)+um(x)ϕ(k1|x|)xik|x|for xRn.

    For any fixed mN, we find

    um,kxiumxipp=Rn|umxi(x)[ϕ(k1|x|)1]+um(x)ϕ(k1|x|)xik|x||pdx=|x|k|umxi(x)[ϕ(k1|x|)1]+um(x)ϕ(k1|x|)xik|x||pdx

    Recall an elementary inequality: (|a|+|b|)p2p1(|a|p+|b|p) for p1. Then we have

    um,kxiumxipp2p1(|x|k|umxi|pdx+sup[0,)|ϕ|pkp|x|k|um|pdx)0 as k.

    Thus, there exists k=k(m)N such that um,k(m)C10(Rn) satisfies limmum,k(m)u1,p=0, i.e., uH1,p0(Rn). The proof is complete.

    Remark. It is plausible to write the range of p based on the definition of H1,p0(Rn) and H1,p(Rn) at the page 166 in the textbook.


  12. Suppose Ω is a bounded domain, and let SC(ˉΩ)XLp(Ω). Pick x0Ω. Does the functional Fx0(u)=u(x0) for uS extend to a bounded linear functional on X? If not, why not?
  13. SolutionNo. Suppose by contradiction that Fx0 can be extended to a bounded linear functional ˜Fx0:XR. Then for any uX with up=1, we have |˜Fx0(u)|˜Fx0, where ˜Fx0 is a constant independent of u. It is clear that there exists a function ˉuC(ˉΩ) satisfying ˉu(x0)=˜Fx0+1 and ˉup=1. Then we get a contradiction that:

    ˜Fx0+1=|˜Fx0(ˉu)|˜Fx0.

    Therefore, Fx0 cannot be extended to a bounded linear functional on X.

  14. If X is a Hilbert space and S is any subset of X, define

    S={yX:x,y=0 for all xS}.

    1. Show that S is a closed subspace of X.
    2. Show that SS can contain only the zero vector.
    3. If ST are both subsets of X, show that TS.
    4. If ˉS is the closure of S in X, show that S=ˉS.
  15. Solution
    1. For y1,y2S and c1,c2R, we can find

      x,c1y1+c2y2=c1y1+c2y2,x=¯c1y1+c2y2,x=¯c1y1,x+c2y2,x=c1x,y1+c2x,y2for xS,

      which shows c1y1+c2y2S. To show the closeness of S, we let {yn}n=1 be a sequence in S such that {yn}n=1 converges to yX, i.e., limnyny=0. By the Cauchy-Schwarz inequality, we have

      |x,y|=|x,yyn|xyyn.

      By the squeeze theorem, we have x,y=0, which means yS. Therefore, S is a closed subspace.
    2. Let x0SS. Since x0S, we know x,x0=0 for all xS. In particular, x0S so x0,x0=0, which implies x0=0 by the definition of inner product. Thus, SS{0} and hence SS={0}.
    3. For yT, we have x,y=0 for all xT. Since ST, the equality x,y holds true for all xS. This means yS. Therefore, TS.
    4. Since SˉS, by (c), we have ˉSS. It suffices to show that SˉS. Fix yS arbitrarily. For xˉS, there exists a sequence {xn}n=1S such that limnxnx=0. Note that xn,y=0 for all nN. Then by Cauchy-Scharz inequality, we have

      |x,y|=|xxn,y|xxny.

      By the squeeze theorem, we have x,y=0 for any xˉS, which implies yˉS and hence SˉS. The proof is complete.

  16. For vector-valued functions u=(u1,,uN) on a domain ΩRn, it is natrual to define Lp(Ω,RN) as the functions u:ΩRN for which |u|Lp(Ω); that is,

    up(Ω|u|pdx)1/p<,where |u|2=Ni=1u2i.

    Simiarly, if each uiC1(Ω), we may define

    up=(Ω|u|pdx)1/p,where |u|2=Ni=1nj=1(uixj)2.

    1. Define H1,p0(Ω,RN).
    2. If N=n, show that div:H1,p0(Ω,Rn)Lp(Ω) is a continuous linear operator.
    3. Show that ˜H1,p0(Ω,Rn){uH1,p0(Ω,Rn):div(u)=0} is a closed subspace of H1,p0(Ω,Rn).
  17. Solution
    1. As for the definition of H1,p0(Rn), H1,p0(Ω,RN) can be defined by

      H1,p0(Ω,RN)=¯C10(Ω,RN)

      where the bar denotes the completion in the following norm

      u1,p=(upp+upp)1/p for uC10(Ω,RN).

    2. Recall that for u=(u1,,un)H1,p0(Ω,Rn), div(u)=ni=1uixi. Since ui/xiLp(Ω), the divergence operator is well-defined. For any u,vH1,p0(Ω,Rn) and cR, we have

      div(cu+v)=ni=1xi(cui+vi)=cni=1uixi+ni=1vixi=cdiv(u)+div(v),

      which means div is a linear operator. By Theorem 1 at page 167 in the textbook, the continuity of a linear operator is equivalent to its boundedness. For nonzero uH1,p0(Ω,Rn) with u1,p=1, the Cauchy–Schwarz inequality implies

      |ni=1uixi|pnp/2(ni=1(uixi)2)p/2np/2|u|p.

      Then we obtain

      div(u)p=(Ω|ni=1uixi|pdx)1/p(np/2Ω|u|pdx)1/p=nupnu1,p=n.

      Hence the operator div is bounded. The proof is complete.
    3. Clearly, ˜H1,p0(Ω,Rn) is a subset of H1,p0(Ω,Rn) and is nonempty because the zero function is in ˜H1,p0(Ω.Rn). By (b), it is easy to see that cu+v˜H1,p0(Ω,Rn) for any u,v˜H1,p0(Ω,Rn) and cR. Thus, ˜H1,p0(Ω,Rn) is a subspace of H1,p0(Ω,Rn). To see ˜H1,p0(Ω,Rn) is closed, we pick u¯˜H1,p0(Ω,Rn). By the definition of closure, there exists a sequence of functions {uk}k=1˜H1,p0(Ω,Rn) such that limkuku1,p=0. Since uk˜H1,p0(Ω,Rn), we have div(uk)=0. By (b), we have

      div(u)=div(limkuk)=limkdiv(uk)=limk0=0.

      This implies u˜H1,p0(Ω,Rn). The proof is complete.

      Remark. A direct observation is that ˜H1,p0(Ω,Rn)=H1,p0(Ω,Rn)div1({0}). Since div is continuous, the set div1({0}) is closed, which implies ˜H1,p0(Ω,Rn) is closed.

  18. In Lemma 2 in this section, the vector vY was claimed (but not proved) to be unique. Establish this uniqueness.
  19. SolutionSuppose by contradiction that there exist vY and wX such that u=v+w and w,Y=0 but vv. Then from v+w=u=v+w, we have ww=vvY. Since ww,Y=w,Yw,Y=0, we have ww,ww=0, which means w=w and hence v=v. This leads a contradiction and the uniqueness of v and w follows.

  20. If F:XY is a bounded linear operator between normed vector spaces X and Y, show that the nullspace N={xX:F(x)=0} is a closed subspace of X.
  21. SolutionFor x1,x2N and cR, we have F(cx1+x2)=cF(x1)+F(x2)=c0+0=0, which implies cx1+x2N. Moreover, since NX and 0N, N is a subspace of X. Note that F is continuous linear operator due to its boundedness by Theorem 1 at page 167 in the textbook. Since {0} is a closed set, we have N=F1({0}) is also closed. Therefore, N is a closed subspace and we complete the proof.

    Remark. Let {xn}n=1 be a sequence in N and converges to xX, i.e., F(xn)=0 for all nN. Then by the continuity of F, we have F(x)=F(limnxn)=limnF(xn)=limn0=0, which implies xN, i.e., N is a closed set. The proof is complete.


  22. If Y is a subspace of a Hilbert space X, define Y as in Exercise 8. Show (Y)=ˉY.
  23. SolutionRecall that the closure of a set A is the smallest closed set containing A, i.e., if AB and B is closed, then ˉAB. For yY, we know y,x=0 for all xY. Moreover, we have

    x,y=¯y,x=0 for any xY.

    This means y(Y), i.e., Y(Y). Hence we have ˉY(Y). It suffices to show that (Y)ˉY. For any y(Y), then we have x,y=0 for all xY, which implies yˉY, i.e., (Y)ˉY. The proof is complete.

  24. Suppose S is a subspace of a Hilbert space X and f:SR is a linear functional with |f(s)|Cs for all sS. Prove that there is a unique linear functional F:XR extending f (i.e., F(s)=f(s) for sS) and preserving the norm:

    F=supxX,x0|F(x)|x=supsS,s0|F(s)|s.

    (Notice that this special case of the Hahn-Banach theorem does not require the axiom of choice.)
  25. SolutionBy the Riesz Representation theorem (Theorem 3), there exists a unique element xfS such that

    f(s)=s,xffor all sS.

    Then we define the extension of f to X by

    F(x)=x,xffor xX.

    Clearly, F is linear functional and F(s)=f(s) for sS. Moreover, the norm of linear operator satisfies

    F=xf=f=supsS,s0|f(s)|s=supsS,s0|F(s)|s.

    Suppose there ia an another linear extension F of f to X. Then by the Riesz Representation Theorem again, there exists an element xFX such that F(x)=x,xF for all xX. Since F(s)=f(s)=F(s) for all sS, we have s,xfxF=0 for all sS and hence xfxFS. But we find

    xf=F=F=xF=xf+(xFxf)=xf2+xFxf2,

    which shows xFxf=0 and hence xF=xf and F=F.

  26. Suppose X is a Hilbert space and {xn}n=1 is a collection of orthonormal vectors. Given uX, define its Fourier coefficients by αn=u,xn.
    1. Prove Bessel's inequality: n=1α2nu2.
    2. Let Y be the finite-dimensional subspace of X generated by taking linear combinations of x1,,xN. Show that v=Nn=1αnxn is the element of Y that minimizes uv as in Lemma 1 of this section.
    3. Repeat (b) when Y is infinite dimensional subspace generated by taking linear combinations and limits of all the xn's.
  27. Solution
    1. For any NN, we have uNn=1αnxn20, which implies

      u2Nn=1α2n=u22Nn=1αnu,xn+Nn=1α2n0.

      Here we have used the fact that xn,xm=0 if nm and xn,xn=1 for all nN. Since the sequence Nn=1α2n is increasing in N and is bounded by u2, we obtain Bessel's inequality and complete the proof.
    2. For any vY, there exists c1,,cNR such that v=Nn=1cnxn. Then we find

      uv2=u22Nn=1cnu,xn+Nn=1c2n=u22Nn=1αncn+Nn=1c2n=u2+Nn=1[(cnαn)2α2n]u2Nn=1α2n.

      The equality holds when cn=αn for n=1,,N. Hence Nn=1αnxn is the unique element of Y that minimizes uv.
    3. It suffices to show that if n=1cnxn=u, i.e., limNNn=1cnxn=u, then cn=αn for all nN. Since the inner product , is continuous in both arguments because of the Cauchy-Schwarz inequality. Thus, for any yX we have

      u,y=n=1cnxn,y=limNNn=1cnxn,y=limNNn=1cnxn,y=n=1cnxn,y.

      For y=xm, we get αm=n=1cnxn,xm=n=1cnδnm=cm for mN. The proof is complete.

  28. A bounded bilinear form on a real Hilbert space X is a map B:X×XR satisfying
    1. B(αx+βy,z)=αB(x,z)+βB(y,z),
    2. B(x,αy+βz)=αB(x,y)+βB(x,z),
    3. |B(x,y)|Cxy for all x,y,zX and α,βR.
    Under these assumptions, show that there is a unique bounded linear operator A:XX such that B(x,y)=Ax,y for all x,yX, where , denotes the inner product on X.
  29. SolutionFix xX arbitrarily. Then we define Fx:XR by Fx(y)=B(x,y) for yX. By (ii), we know

    Fx(cy1+y2)=B(x,cy1+y2)=cB(x,y1)+B(x,y2)=cFx(y1)+Fx(y2),

    which shows Fx is a linear operator on X. In addition, by (iii), we know FxCx, which means Fx is bounded. Hence by Theorem 3 (Riesz Representation), there exists a unique vxX such that Fx(y)=y,vx for all yX. Note that y,vx=vx,y because X is a real Hilbert space. Now we define the operator A:XX by Ax=vx for all xX. It suffices to show that A is a bounded linear operator. For x1,x2X and dR, it remains to show vdx1+x2=dvx1+vx2, which is equivalent to verify that Fdx1+x2=dFx1+Fx2. This follows directly from (i):

    Fdx1+c2(y)=B(dx1+x2,y)=dB(x1,y)+B(x2,y)=dFx1(y)+Fx2(y).

    Hence A is a linear operator. By (iii), we have

    |Ax,y|=|B(x,y)|Cxy,

    which implies Ax2CxAx and Ax/xC. This means A is bounded. To end this proof, we need to establish the uniqueness of A. Suppose by contradicion that there exists an another bounded linear operator A:XX such that B(x,y)=Ax,y for all x,yX. Then we have (AA)x,y=0 for all x,yX. Taking y=(AA)x, it gives (AA)x=0 and hence Ax=Ax for all xX, i.e., A=A. This leads a contradiction. Therefore, we complete the proof.

    Remark. The linearity of A can be proved as follows. For x1,x2X and cR, we have

    A(cx1+x2),y=B(cx1+x2,y)=cB(x1,y)+B(x2,y)=cAx1,y+Ax2,y=cAx1+Ax2,y,

    which gives A(cx1+x2)(cAx1+Ax2),y=0 for all yX. Thus, A(cx1+x2)=cAx1+Ax2.


  30. If X is a Hilbert space and T:XX is a bounded linear operator, the adjoint of T is an operator T:XX defined as follows:
    1. For yX, use the Riesz representation theorem to define TyX satisfying Tx,y=x,Ty for all x,yX.
    2. Show that T:XX is a bounded linear operator with T=T.
  31. Solution
    1. Given yX. Then we define the linear functional fy:XR by fy(x)=Tx,y for xX. Since T is bounded, |fy(x)|TxyTxy, which implies |fy(x)|/xTy. This shows that fy is also bounded. Hence by Theorem 3 (Riesz Representation), there exists a unique element vy such that fy(x)=x,vy for xX. Hence we define T:XX by Ty=vy for yX.
    2. To get the linearity of T, we need to show vcy1+y2=cvy1+vy2 for y1,y2X and cR, which follows from fcy1+y2=cfy1+fy2. This can be verified by

      fcy1+y2(x)=Tx,cy1+y2=cTx,y1+Tx,y2=cfy1(x)+fy2(x)for xX.

      This shows that T is a linear operator. Let yX be a unit vector. If Ty=0, then surely TyT. If Ty0, then we have

      Ty2=Ty,Ty=TTy,yTTyy=TTyTTy,

      which gives TyT. Taking the supremum over all y with y=1, we get TT. On the other hand, we note that Tx,y=y,Tx=Ty,x=x,Ty, which implies T=(T) and hence T=(T)T. Therefore, T is bounded and T=T.

  32. If T:XX is a bounded linear operator on a Hilbert space X, let N={xX:T(x)=0} be the nullspace of T and R={Tx:xX} be the range of T. Similarly, let N and R denote the nullspace and range of the adjoint T defined in Exercise 16. Prove (N)=ˉR (where S is defined in Exercise 8).
  33. SolutionWe firstly prove that R(N). Let yR. Then by the definition of the range, there is an element xX such that y=Tx. For any zN, we find

    z,y=y,z=Tx,z=x,Tz=x,0=0.

    This means y(N) and R(N). By the part (a) of Exercise 8, ˉR(N). Here we have used the fact that if AB and B is closed, then ˉAB. On the other hand, we want to prove that (N)ˉR, which is equivalent to show that (ˉR)c((N))c. Here Ac denotes the complement set of A. Suppose by contradiction that y(ˉR)c but y(N). By Lemma 2 (The Projection Theorem), there exists a unique vyˉR and wyX such that y=vy+wy and wy,ˉR=0, where wy0. The condition wy,ˉR=0 implies wy,Tu=0 and hence Twy,u=0 for all uX. Thus, wyN. From y(N), we have

    0=z,y=z,vy+wy=z,vy+z,wy=z,wyfor zN,

    which means wy(N). Here we have used the facts that vyˉR and there is an element uyX such that Tuy=vy and

    z,vy=vy,z=Tuy,z=uy,Tz=uy,0=0.

    Hence we arrive at wyN(N). This means wy=0 and leads a contradiction. Therefore, we complete the proof of (N)=ˉR.

沒有留言:

張貼留言