hehe123 发表于 2004-11-27 12:38

<P align=center 0cm 0pt; TEXT-ALIGN: center?><FONT face="Times New Roman"><B>Exercise</B><B>
</B></FONT><p><P 0cm 0pt?>Ⅰ<FONT face="Times New Roman">.Translate the following passages into Chinese:</FONT></P><P 0cm 0pt?><FONT face="Times New Roman">  1.A differential M(x,y) dx +N(x,y) dy ,where M, N are real functions of two variables x and y, is called exact in a domain D when the line integral </FONT>∫<FONT face="Times New Roman"><SUB>c </SUB>M(x,y) dx +N(x,y) dy is the same for all paths of integration c in D, which have the same endpoints.</FONT></P><P 0cm 0pt; TEXT-INDENT: 37.5pt?><FONT face="Times New Roman">Mdx+Ndy is exact if and only if there exists a continuously differentiable function u(x,y) such that M= u/ x, N=u/ y.</FONT></P><P 0cm 0pt tab-stops: TEXT-INDENT: mso-list: level1 list -18.75pt; 18.75pt; l38 lfo20?><FONT face="Times New Roman">2.       For any normal first order DE y</FONT>ˊ<FONT face="Times New Roman">=F(x,y)  and any initial x<SUB>0  </SUB>, the initial valve problem consists of finding the solution or solutions of the DE ,for x&gt;x<SUB>0  </SUB>which assumes a given initial valve f(x<SUB>0</SUB>)=c.</FONT></P><P 0cm 0pt tab-stops: TEXT-INDENT: mso-list: level1 list -18.75pt; 18.75pt; l38 lfo20?><FONT face="Times New Roman">3.       To show that the initial valve problem is well-set requires proving theorems of existence (there is a solution), uniqueness (there is only one solution) and continuity (the solution depends continuously on the initial value).</FONT></P><P 0cm 0pt?><FONT face="Times New Roman"><p></FONT><p><P 0cm 0pt?>Ⅱ<FONT face="Times New Roman">. Translate the following sentences into English:</FONT></P><P 0cm 0pt tab-stops: TEXT-INDENT: mso-list: list level2 l38 lfo20? -24.75pt; 45.75pt;><FONT face="Times New Roman">1)           </FONT>因为<FONT face="Times New Roman">y=</FONT>ч<FONT face="Times New Roman">(x) </FONT>是微分方程<FONT face="Times New Roman">dy/ dx=f(x,y)</FONT>的解<FONT face="Times New Roman">,</FONT>故有</P><P 0cm 0pt 45.75pt?><FONT face="Times New Roman">d</FONT>ч<FONT face="Times New Roman">(x)/dx=f (x,</FONT>ч<FONT face="Times New Roman">(x))</FONT></P><P 0cm 0pt tab-stops: TEXT-INDENT: mso-list: list level2 l38 lfo20? -24.75pt; 45.75pt;><FONT face="Times New Roman">2)           </FONT>两边从<FONT face="Times New Roman">x<SUB>0</SUB></FONT>到<FONT face="Times New Roman">x</FONT>取定积分得</P><P 0cm 0pt 45.75pt?>ч<FONT face="Times New Roman">(x)-</FONT>ч<FONT face="Times New Roman">(x<SUB>0</SUB>)=</FONT>∫<FONT face="Times New Roman"><SUB>x0</SUB><SUP>x </SUP>f(x,</FONT>ч<FONT face="Times New Roman">(x)) dx   x<SUB>0</SUB>&lt;x&lt;x<SUB>0</SUB>+h</FONT></P><P 0cm 0pt tab-stops: TEXT-INDENT: mso-list: list level2 l38 lfo20? -24.75pt; 45.75pt;><FONT face="Times New Roman">3)           </FONT>把<FONT face="Times New Roman">y<SUB>0</SUB>=</FONT>ч<FONT face="Times New Roman">(x<SUB>0</SUB>)</FONT>代入上式<FONT face="Times New Roman">, </FONT>即有</P><P 0cm 0pt 45.75pt?>ч<FONT face="Times New Roman">(x)=y<SUB>0</SUB>+</FONT>∫<FONT face="Times New Roman"><SUB>x0</SUB><SUP>x  </SUP>f(x,</FONT>ч<FONT face="Times New Roman">(x)) dx           x<SUB>0</SUB>&lt;x&lt;x<SUB>0</SUB>+h</FONT></P><P 0cm 0pt tab-stops: TEXT-INDENT: mso-list: list level2 l38 lfo20? -24.75pt; 45.75pt;><FONT face="Times New Roman">4)           </FONT>因此<FONT face="Times New Roman"> y=</FONT>ч<FONT face="Times New Roman">(x) </FONT>是积分方程</P><P 0cm 0pt?><FONT face="Times New Roman">                        y=y<SUB>0</SUB>+</FONT>∫<FONT face="Times New Roman"><SUB>x0</SUB><SUP>x</SUP> f (x,y) dx</FONT></P><P 0cm 0pt?><FONT face="Times New Roman">         </FONT>定义于<FONT face="Times New Roman">x<SUB>0</SUB>&lt;x&lt;x<SUB>0</SUB>+h </FONT>的连续解<FONT face="Times New Roman">.</FONT></P><P 0cm 0pt?><FONT face="Times New Roman">    </FONT></P><P 0cm 0pt?><FONT face="Times New Roman">   </FONT>Ⅲ<FONT face="Times New Roman">.    Translate the following sentences into English:</FONT></P><P 0cm 0pt tab-stops: TEXT-INDENT: mso-list: level1 list -24.75pt; 46.5pt; l31 lfo21?><FONT face="Times New Roman">1)           </FONT>现在讨论型如<FONT face="Times New Roman">  y=f (x,y</FONT>ˊ<FONT face="Times New Roman">) </FONT>的微分方程的解<FONT face="Times New Roman">,</FONT>这里假设函数<FONT face="Times New Roman"> f (x, dy/dx)  </FONT>有连续的偏导数<FONT face="Times New Roman">.</FONT></P><P 0cm 0pt tab-stops: TEXT-INDENT: mso-list: level1 list -24.75pt; 46.5pt; l31 lfo21?><FONT face="Times New Roman">2)           </FONT>引入参数<FONT face="Times New Roman">dy/dx=p, </FONT>则已给方程变为<FONT face="Times New Roman"> y=f (x,p).</FONT></P><P 0cm 0pt tab-stops: TEXT-INDENT: mso-list: level1 list -24.75pt; 46.5pt; l31 lfo21?><FONT face="Times New Roman">3)           </FONT>在<FONT face="Times New Roman"> y=f (x,p)   x  p=dy/dx       p= f/ x+f/ p  dp/dx</FONT></P><P 0cm 0pt tab-stops: TEXT-INDENT: mso-list: level1 list -24.75pt; 46.5pt; l31 lfo21?><FONT face="Times New Roman">4)           </FONT>这是一个关于<FONT face="Times New Roman">x</FONT>和<FONT face="Times New Roman">p</FONT>的一阶微分方程<FONT face="Times New Roman">,</FONT>它的解法我们已经知道<FONT face="Times New Roman">.</FONT></P><P 0cm 0pt tab-stops: TEXT-INDENT: mso-list: level1 list -24.75pt; 46.5pt; l31 lfo21?><FONT face="Times New Roman">5)           </FONT>若<FONT face="Times New Roman">(A)</FONT>的通解的形式为<FONT face="Times New Roman">p=</FONT>ч<FONT face="Times New Roman">(x,c) ,</FONT>则原方程的通解为</P><P 0cm 0pt; TEXT-INDENT: 116.25pt?><FONT face="Times New Roman">y=f (x,</FONT>ч<FONT face="Times New Roman">(x,c)).</FONT></P><P 0cm 0pt tab-stops: TEXT-INDENT: mso-list: level1 list -24.75pt; 46.5pt; l31 lfo21?><FONT face="Times New Roman">6)           </FONT>若<FONT face="Times New Roman">(A) </FONT>有型如<FONT face="Times New Roman">x=</FONT>ψ<FONT face="Times New Roman">(x,c)</FONT>的通解<FONT face="Times New Roman">,</FONT>则原方程有参数形式的通解</P><P 0cm 0pt 21.75pt?><FONT face="Times New Roman">                  x=</FONT>ψ<FONT face="Times New Roman">(p,c)</FONT></P><P 0cm 0pt 21.75pt?><FONT face="Times New Roman">                  y=f(</FONT>ψ<FONT face="Times New Roman">(p,c)p)</FONT></P><P 0cm 0pt 21.75pt?><FONT face="Times New Roman">      </FONT>其中<FONT face="Times New Roman">p</FONT>是参数<FONT face="Times New Roman">,c</FONT>是任意常数<FONT face="Times New Roman">.</FONT></P><P 0cm 0pt?><FONT face="Times New Roman"><p></FONT><p><P 0cm 0pt?><FONT face="Times New Roman"><p></FONT><p><P 0cm 0pt?><FONT face="Times New Roman"><p></FONT><p>

hehe123 发表于 2004-11-27 12:45

数学专业英语[6]-Sequences and Series

<P><FONT face="Times New Roman" size=3>Series are a natural continuation of our study of functions. In the previous chapter we found how </FONT></P>
<P><FONT face="Times New Roman" size=3>to approximate our elementary functions by polynomials, with a certain error term. Conversely, one can define arbitrary functions by giving a series for them. We shall see how in the sections below.</FONT></P>
<P><FONT face="Times New Roman"><FONT size=3>   In practice, very few tests are used to determine convergence of series. Essentially, the comparision test is the most frequent. Furthermore, the most important series are those which converge absolutely. Thus we shall put greater emphasis on these.</FONT></FONT></P>
<P><FONT face="Times New Roman"><FONT size=3>

</FONT></FONT>
<p>
<P><FONT face="Times New Roman" size=3>Convergent Series</FONT></P>
<P><FONT face="Times New Roman"><FONT size=3>
<p></FONT></FONT>
<p>
<P><FONT face="Times New Roman" size=3>Suppose that we are given a sequcnce of numbers</FONT></P>
<P><FONT size=3><FONT face="Times New Roman">a<SUB>1</SUB>,a<SUB>2</SUB>,a<SUB>3</SUB></FONT>…<FONT face="Times New Roman"> </FONT></FONT></P>
<P><FONT size=3><FONT face="Times New Roman">i.e. we are given a number a<SUB>n</SUB>, for each integer </FONT>n><FONT face="Times New Roman">1.We form the sums</FONT></FONT></P>
<P><FONT size=3><FONT face="Times New Roman">                         S<SUB>n</SUB>=a<SUB>1</SUB>+a<SUB>2</SUB>+</FONT>…<FONT face="Times New Roman">+a<SUB>n
<p></SUB></FONT></FONT>
<p>
<P><FONT face="Times New Roman" size=3>It would be meaningless to form an infinite sum</FONT></P>
<P><FONT size=3><FONT face="Times New Roman">a<SUB>1</SUB>+a<SUB>2</SUB>+a<SUB>3</SUB>+</FONT>…</FONT></P>
<P><FONT face="Times New Roman" size=3>because we do not know how to add infinitely many numbers. However, if our sums S<SUB>n</SUB> approach a limit as n becomes large, then we say that the sum of our sequence converges, and we now define its sum to be that limit.</FONT></P>
<P><FONT face="Times New Roman"><FONT size=3>   The symbols </FONT></FONT></P>
<P><FONT size=3>∑<SUB><FONT face="Times New Roman">a=1 </FONT></SUB><SUP>∞<FONT face="Times New Roman"> </FONT></SUP><FONT face="Times New Roman">a<SUB>n</SUB><SUP>                 
<p></SUP></FONT></FONT>
<p>
<P><FONT face="Times New Roman"><FONT size=3><SUP></SUP>will be called a series. We shall say that the series converges if the sums approach a limit as n becomes large. Otherwise, we say that it does not converge, or diverges. If the seriers converges, we say that the value of the series is </FONT></FONT></P>
<P><FONT size=3>∑<SUB><FONT face="Times New Roman">a=1</FONT></SUB><SUP>∞</SUP><FONT face="Times New Roman">=lim<SUB>a</SUB></FONT><SUB>→∞</SUB><FONT face="Times New Roman">S<SUB>n</SUB>=lim<SUB>a</SUB></FONT><SUB>→∞</SUB><FONT face="Times New Roman">(a<SUB>1</SUB>+a<SUB>2</SUB>+</FONT>…<FONT face="Times New Roman">+a<SUB>n</SUB>)</FONT></FONT></P>
<P><FONT face="Times New Roman" size=3>In view of the fact that the limit of a sum is the sum of the limits, and other standard properties of limits, we get:</FONT></P>
<P><FONT size=3><FONT face="Times New Roman">THEOREM 1. Let{ a<SUB>n</SUB> }and { b<SUB>n</SUB> }(n=1,2,</FONT>…<FONT face="Times New Roman">)</FONT></FONT></P>
<P><FONT face="Times New Roman" size=3>be two sequences and assume that the series </FONT></P>
<P><FONT size=3>∑<FONT face="Times New Roman"><SUB>a=1</SUB><SUP> </SUP></FONT><SUP>∞<FONT face="Times New Roman"> </FONT></SUP><FONT face="Times New Roman">a<SUB>n</SUB></FONT>∑<SUB><FONT face="Times New Roman">a=1</FONT></SUB><SUP>∞<FONT face="Times New Roman"> </FONT></SUP><FONT face="Times New Roman">b<SUB>n</SUB><SUP>
<p></SUP></FONT></FONT>
<p>
<P><FONT size=3><FONT face="Times New Roman">converge. Then </FONT>∑<SUB><FONT face="Times New Roman">a=1</FONT></SUB><SUP>∞</SUP><FONT face="Times New Roman">(a<SUB>n </SUB>+ b<SUB>n </SUB>) also converges, and is equal to the sum of the two series. If c is a number, then </FONT></FONT></P>
<P><FONT size=3>∑<FONT face="Times New Roman"> <SUB>a=1</SUB></FONT><SUP>∞</SUP><FONT face="Times New Roman">c a<SUB>n</SUB> =c</FONT>∑<FONT face="Times New Roman"><SUB>a=1</SUB> </FONT><SUP>∞</SUP><FONT face="Times New Roman">a<SUB>n
<p></SUB></FONT></FONT>
<p>
<P><FONT size=3><FONT face="Times New Roman">Finally, if s<SUB>n</SUB>=a<SUB>1</SUB>+a<SUB>2</SUB>+</FONT>…<FONT face="Times New Roman">+a<SUB>n</SUB> and t<SUB>n</SUB>=b<SUB>1</SUB>+b<SUB>2</SUB>+</FONT>…<FONT face="Times New Roman">+b<SUB>n</SUB> then</FONT></FONT></P>
<P><FONT size=3><FONT face="Times New Roman">                           </FONT>∑<SUB><FONT face="Times New Roman">a=1</FONT></SUB><SUP>∞</SUP><FONT face="Times New Roman">a<SUB>n </SUB></FONT>∑<SUB><FONT face="Times New Roman"> a=1</FONT></SUB><SUP>∞</SUP><FONT face="Times New Roman">b<SUB>n</SUB>=lim<SUB>a</SUB></FONT><SUB>→∞<FONT face="Times New Roman"> </FONT></SUB><FONT face="Times New Roman">s<SUB>n </SUB>t<SUB>n </SUB></FONT></FONT></P>
<P><FONT face="Times New Roman"><FONT size=3>   In particular, series can be added term by term. Of course , they cannot be multiplied term by term.</FONT></FONT></P>
<P><FONT face="Times New Roman"><FONT size=3>   We also observe that a similar theorem holds for the difference of two series.</FONT></FONT></P>
<P><FONT size=3><FONT face="Times New Roman">   If a series </FONT>∑<FONT face="Times New Roman">a<SUB>n</SUB> converges, then the numbers a<SUB>n</SUB> must approach 0 as n becomes large. However, there are examples of sequences {an} for which the series does not converge, and yet lim<SUB>a</SUB></FONT><SUB>→∞</SUB><FONT face="Times New Roman">a<SUB>n</SUB>=0</FONT></FONT></P>
<P><FONT face="Times New Roman"><FONT size=3>
<p></FONT></FONT>
<p>
<P><FONT face="Times New Roman" size=3>Series with Positive Terms</FONT></P>
<P><FONT face="Times New Roman"><FONT size=3>
<p></FONT></FONT>
<p>
<P><FONT size=3><FONT face="Times New Roman">Throughout this section, we shall assume that our numbers a<SUB>n</SUB> are </FONT>><FONT face="Times New Roman"> 0. Then the partial sums</FONT></FONT></P>
<P><FONT size=3><FONT face="Times New Roman">                           S<SUB>n</SUB>=a<SUB>1</SUB>+a<SUB>2</SUB>+</FONT>…<FONT face="Times New Roman">+a<SUB>n</SUB></FONT></FONT></P>
<P><FONT face="Times New Roman" size=3>are increasing, i.e.</FONT></P>
<P><FONT size=3><FONT face="Times New Roman">s<SUB>1</SUB></FONT><<FONT face="Times New Roman">s<SUB>2 </SUB></FONT><<FONT face="Times New Roman">s<SUB>3</SUB></FONT><…<<FONT face="Times New Roman">s<SUB>n</SUB></FONT><<FONT face="Times New Roman">s<SUB>n+1</SUB></FONT><…</FONT></P>
<P><FONT face="Times New Roman" size=3>If they are approach a limit at all, they cannot become arbitrarily large. Thus in that case there is a  number B such that </FONT></P>
<P><FONT face="Times New Roman"><FONT size=3>                         S<SUB>n</SUB>&lt; B</FONT></FONT></P>
<P><FONT face="Times New Roman" size=3>for all n. The collection of numbers {s<SUB>n</SUB>} has therefore a least upper bound ,i.e. there is a smallest number S such that </FONT></P>
<P><FONT face="Times New Roman"><FONT size=3>                          s<SUB>n</SUB>&lt;S</FONT></FONT></P>
<P><FONT size=3><FONT face="Times New Roman">for all n. In that case , the partial sums s<SUB>n</SUB> approach S as a limit. In other words, given any positive number </FONT>ε<FONT face="Times New Roman">&gt;0, we have </FONT></FONT></P>
<P><FONT size=3><FONT face="Times New Roman">S –</FONT>ε<FONT face="Times New Roman">&lt; s<SUB>n </SUB>&lt; S</FONT></FONT></P>
<P><FONT face="Times New Roman" size=3>for all n .sufficiently large. This simply expresses the fact that S is the least of all upper bounds for our collection of numbers s<SUB>n</SUB>. We express this as a theorem.</FONT></P>
<P><FONT size=3><FONT face="Times New Roman">THEOREM 2. Let{a<SUB>n</SUB>}(n=1,2,</FONT>…<FONT face="Times New Roman">)be a sequence of numbers&gt;0 and let </FONT></FONT></P>
<P><FONT size=3><FONT face="Times New Roman">                 S<SUB>n</SUB>=a<SUB>1</SUB>+a<SUB>2</SUB>+</FONT>…<FONT face="Times New Roman">+a<SUB>n</SUB></FONT></FONT></P>
<P><FONT face="Times New Roman" size=3>If the sequence of numbers {s<SUB>n</SUB>} is bounded, then it approaches a limit S , which is its least upper bound.</FONT></P>
<P><FONT face="Times New Roman" size=3>Theorem 3 gives us a very useful criterion to determine when a series with positive terms converges:</FONT></P>
<P><FONT size=3><FONT face="Times New Roman">THEOREM 3. Let</FONT>∑<SUB><FONT face="Times New Roman">a=1</FONT></SUB><SUP>∞</SUP><FONT face="Times New Roman">a<SUB>n</SUB> and</FONT>∑<SUB><FONT face="Times New Roman">a=1</FONT></SUB><SUP>∞</SUP><FONT face="Times New Roman"> b<SUB>n</SUB> be two series , with a<SUB>n</SUB>&gt;0 for all n and b<SUB>n</SUB>&gt;0 for all n. Assume that there is a number c such that </FONT></FONT></P>
<P><FONT face="Times New Roman"><FONT size=3>                 a<SUB>n</SUB>&lt; c b<SUB>n</SUB></FONT></FONT></P>
<P><FONT size=3><FONT face="Times New Roman">for all n, and that</FONT>∑<SUB><FONT face="Times New Roman">a=1</FONT></SUB><SUP>∞</SUP><FONT face="Times New Roman">b<SUB>n</SUB> converges. Then </FONT>∑<SUB><FONT face="Times New Roman">a=1</FONT></SUB><SUP>∞</SUP><FONT face="Times New Roman"> a<SUB>n</SUB> converges, and </FONT></FONT></P>
<P><FONT size=3>∑<SUB><FONT face="Times New Roman">a=1</FONT></SUB><SUP>∞</SUP><FONT face="Times New Roman">a<SUB>n </SUB>≤ c</FONT>∑<SUB><FONT face="Times New Roman">a=1</FONT></SUB><SUP>∞</SUP><FONT face="Times New Roman">b<SUB>n</SUB></FONT></FONT></P>
<P><FONT face="Times New Roman" size=3>PROOF. We have </FONT></P>
<P><FONT size=3><FONT face="Times New Roman">              a<SUB>1</SUB>+</FONT>…<FONT face="Times New Roman">+a<SUB>n</SUB></FONT>≤<FONT face="Times New Roman">cb<SUB>1</SUB>+</FONT>…<FONT face="Times New Roman">+cb<SUB>n</SUB></FONT></FONT></P>
<P><FONT size=3><FONT face="Times New Roman">              =c(b<SUB>1</SUB>+</FONT>…<FONT face="Times New Roman">+b<SUB>n</SUB>)</FONT>≤<FONT face="Times New Roman"> c</FONT>∑<SUB><FONT face="Times New Roman">a=1</FONT></SUB><SUP>∞</SUP><FONT face="Times New Roman">b<SUB>n</SUB> </FONT></FONT></P>
<P><FONT size=3><FONT face="Times New Roman">This means that c</FONT>∑<SUB><FONT face="Times New Roman">a=1</FONT></SUB><SUP>∞</SUP><FONT face="Times New Roman">b<SUB>n</SUB> is a bound for the partial sums a<SUB>1</SUB>+</FONT>…<FONT face="Times New Roman">+a<SUB>n</SUB>.The least upper bound of these sums is therefore </FONT>≤<FONT face="Times New Roman"> c</FONT>∑<SUB><FONT face="Times New Roman">a=1</FONT></SUB><SUP>∞</SUP><FONT face="Times New Roman">b<SUB>n</SUB>, thereby proving our theorem.</FONT></FONT></P>
<P><FONT face="Times New Roman" size=3>Differentiation and Intergration of Power Series.</FONT></P>
<P><FONT face="Times New Roman" size=3>If we have a polynomial</FONT></P>
<P><FONT size=3><FONT face="Times New Roman">                           a<SUB>0</SUB>+a<SUB>1</SUB>x+</FONT>…<FONT face="Times New Roman">+a<SUB>n</SUB>x<SUP>n</SUP></FONT></FONT></P>
<P><FONT size=3><FONT face="Times New Roman">with numbers a<SUB>0</SUB>,a<SUB>1</SUB>,</FONT>…<FONT face="Times New Roman">,a<SUB>n</SUB> as coefficients, then we know how to find its derivative. It is a<SUB>1</SUB>+2a<SUB>2</SUB>x+</FONT>…<FONT face="Times New Roman">+na<SUB>n</SUB>x<SUP>n</SUP></FONT><SUP>–<FONT face="Times New Roman">1</FONT></SUP><FONT face="Times New Roman">. We would like to say that the derivative of a series can be taken in the same way, and that the derivative converges whenever the series does.</FONT></FONT></P>
<P><FONT size=3><FONT face="Times New Roman">   THEOREM 4. Let r be a number &gt;0 and let </FONT>∑<FONT face="Times New Roman">a<SUB>n</SUB>x<SUP>n</SUP> be a series which converges absolutely for </FONT>∣<FONT face="Times New Roman">x</FONT>∣<FONT face="Times New Roman">&lt;r. Then the series </FONT>∑<FONT face="Times New Roman">na<SUB>n</SUB>x<SUP>n-1</SUP> also converges absolutely for</FONT>∣<FONT face="Times New Roman">x</FONT>∣<FONT face="Times New Roman">&lt;r.</FONT></FONT></P>
<P><FONT size=3><FONT face="Times New Roman">A similar result holds for integration, but trivially. Indeed, if we have a series </FONT>∑<SUB><FONT face="Times New Roman">a=1</FONT></SUB><SUP>∞</SUP><FONT face="Times New Roman">a<SUB>n</SUB>x<SUP>n </SUP>which converges absolutely for </FONT>∣<FONT face="Times New Roman">x</FONT>∣<FONT face="Times New Roman">&lt;r, then the series </FONT></FONT></P>
<P><FONT size=3><FONT face="Times New Roman">                  </FONT>∑<SUB><FONT face="Times New Roman">a=1</FONT></SUB><SUP>∞</SUP><FONT face="Times New Roman">a<SUB>n</SUB>/n+1 x<SUP>n+1</SUP>=x</FONT>∑<SUB><FONT face="Times New Roman">a=1</FONT></SUB><SUP>∞</SUP><FONT face="Times New Roman">a<SUB>n</SUB>x<SUP>n</SUP><SUB> </SUB></FONT>∕<FONT face="Times New Roman">n+1 </FONT></FONT></P>
<P><FONT face="Times New Roman" size=3>has terms whose absolute value is smaller than in the original series.</FONT></P>
<P><FONT face="Times New Roman"><FONT size=3>   The preceding result can be expressed by saying that an absolutely convergent series can be integrated and differentiated term by term and and still yields an absolutely convergent power series.</FONT></FONT></P>
<P><FONT face="Times New Roman" size=3>It is natural to expect that if </FONT></P>
<P><FONT size=3><FONT face="Times New Roman">                              f (x)=</FONT>∑<SUB><FONT face="Times New Roman">a=1</FONT></SUB><SUP>∞</SUP><FONT face="Times New Roman">a<SUB>n</SUB>x<SUP>n</SUP>,</FONT></FONT></P>
<P><FONT face="Times New Roman" size=3>then f is differentiable and its derivative is given by differentiating the series term by term. The next theorem proves this.</FONT></P>
<P><FONT face="Times New Roman"><FONT size=3>   THEOREM 5. Let </FONT></FONT></P>
<P><FONT size=3><FONT face="Times New Roman">                                 f (x)=</FONT>∑<SUB><FONT face="Times New Roman">a=1</FONT></SUB><SUP>∞</SUP><FONT face="Times New Roman"> a<SUB>n</SUB>x<SUP>n</SUP></FONT></FONT></P>
<P><FONT size=3><FONT face="Times New Roman">be a power series, which converges absolutely for</FONT>∣<FONT face="Times New Roman">x</FONT>∣<FONT face="Times New Roman">&lt;r. Then f is differentiable for </FONT>∣<FONT face="Times New Roman">x</FONT>∣<FONT face="Times New Roman">&lt;r, and </FONT></FONT></P>
<P><FONT size=3><FONT face="Times New Roman">                                 f</FONT>′<FONT face="Times New Roman">(x)=</FONT>∑<SUB><FONT face="Times New Roman">a=1</FONT></SUB><SUP>∞</SUP><FONT face="Times New Roman">na<SUB>n</SUB>x<SUP>n-1</SUP>.</FONT></FONT></P>
<P><FONT size=3><FONT face="Times New Roman">   THEOREM 6. Let f (x)=</FONT>∑<SUB><FONT face="Times New Roman">a=1</FONT></SUB><SUP>∞</SUP><FONT face="Times New Roman">a<SUB>n</SUB>x<SUP>n</SUP> be a power series, which converges absolutely for </FONT>∣<FONT face="Times New Roman">x</FONT>∣<FONT face="Times New Roman">&lt;r. Then the relation </FONT></FONT></P>
<P><FONT size=3>∫<FONT face="Times New Roman">f (x)d x=</FONT>∑<SUB><FONT face="Times New Roman">a=1</FONT></SUB><SUP>∞</SUP><FONT face="Times New Roman">a<SUB>n</SUB>x<SUP>n+1</SUP></FONT>∕<FONT face="Times New Roman">n+1</FONT></FONT></P>
<P><FONT size=3><FONT face="Times New Roman">is valid in the interval </FONT>∣<FONT face="Times New Roman">x</FONT>∣<FONT face="Times New Roman">&lt;r.</FONT></FONT></P>
<P><FONT face="Times New Roman" size=3>We omit the proofs of theorems 4,5 and 6.</FONT></P>
<P><FONT size=3><FONT face="Times New Roman">
<p></FONT></FONT>
<p>

hehe123 发表于 2004-11-27 12:46

<P align=center 0cm 0pt; TEXT-ALIGN: center?><B><FONT face="Times New Roman">Vocabulary
</FONT></B><p><P 0cm 0pt; TEXT-INDENT: 21.75pt?><FONT face="Times New Roman"><p></FONT><p><P 0cm 0pt; TEXT-INDENT: 21.75pt?><FONT face="Times New Roman">sequence   </FONT>序列<FONT face="Times New Roman">                           positive term  </FONT>正项</P><P 0cm 0pt; TEXT-INDENT: 21.75pt?><FONT face="Times New Roman">series  </FONT>级数<FONT face="Times New Roman">                               alternate term  </FONT>交错项</P><P 0cm 0pt; TEXT-INDENT: 21.75pt?><FONT face="Times New Roman">approximate </FONT>逼近<FONT face="Times New Roman">,</FONT>近似<FONT face="Times New Roman">                      partial sum  </FONT>部分和</P><P 0cm 0pt; TEXT-INDENT: 21.75pt?><FONT face="Times New Roman">elementary functions </FONT>初等函数<FONT face="Times New Roman">                criterion  </FONT>判别准则<FONT face="Times New Roman">(</FONT>单数<FONT face="Times New Roman">)</FONT></P><P 0cm 0pt; TEXT-INDENT: 21.75pt?><FONT face="Times New Roman">section  </FONT>章节<FONT face="Times New Roman">                              criteria   </FONT>判别准则<FONT face="Times New Roman">(</FONT>多数<FONT face="Times New Roman">)</FONT></P><P 0cm 0pt; TEXT-INDENT: 21.75pt?><FONT face="Times New Roman">convergence  </FONT>收敛<FONT face="Times New Roman">(</FONT>名词<FONT face="Times New Roman">)                    power series </FONT>幂级数</P><P 0cm 0pt; TEXT-INDENT: 21.75pt?><FONT face="Times New Roman">convergent   </FONT>收敛<FONT face="Times New Roman">(</FONT>形容词<FONT face="Times New Roman">)                   coefficient </FONT>系数</P><P 0cm 0pt; TEXT-INDENT: 21.75pt?><FONT face="Times New Roman">absolute convergence </FONT>绝对收敛<FONT face="Times New Roman">                Cauchy sequence </FONT>哥西序列</P><P 0cm 0pt; TEXT-INDENT: 21.75pt?><FONT face="Times New Roman">diverge  </FONT>发散<FONT face="Times New Roman">                               radius of convergence </FONT>收敛半径</P><P 0cm 0pt; TEXT-INDENT: 21.75pt?><FONT face="Times New Roman">term by term  </FONT>逐项<FONT face="Times New Roman">                           M-test  M—</FONT>判别法</P><P 0cm 0pt; TEXT-INDENT: 21.75pt?><FONT face="Times New Roman"><p></FONT><p>

hehe123 发表于 2004-11-27 12:46

<P align=center 0cm 0pt; TEXT-ALIGN: center?><B><FONT face="Times New Roman">Notes
</FONT></B><p><P 0cm 0pt tab-stops: TEXT-INDENT: mso-list: level1 list -18pt; 29.25pt; l7 lfo22?><FONT face="Times New Roman">1.       series</FONT>一词的单数和复数形式都是同一个字<FONT face="Times New Roman">.</FONT>例如<FONT face="Times New Roman">:</FONT></P><P 0cm 0pt TEXT-INDENT: 32.25pt? 11.25pt;><FONT face="Times New Roman">One can define arbitrary functions by giving a series for them(</FONT>单数<FONT face="Times New Roman">)</FONT></P><P 0cm 0pt TEXT-INDENT: 32.25pt? 11.25pt;><FONT face="Times New Roman">The most important series are those which converge absolutely(</FONT>复数<FONT face="Times New Roman">)</FONT></P><P 0cm 0pt tab-stops: TEXT-INDENT: mso-list: level1 list -18pt; 29.25pt; l7 lfo22?><FONT face="Times New Roman">2.       In view of the fact that the limit of a sum of the limits, and other standard properties of limits, we get:</FONT></P><P 0cm 0pt TEXT-INDENT: 37.5pt? 11.25pt;><FONT face="Times New Roman">Theorem 1…</FONT></P><P 0cm 0pt; TEXT-INDENT: 10.5pt? mso-char-indent-count: mso-char-indent-size: 1.57; 16.5pt;>这是叙述定理的一种方式<FONT face="Times New Roman">: </FONT>即先将事实说明在前面<FONT face="Times New Roman">,</FONT>再引出定理<FONT face="Times New Roman">. </FONT>此句用<FONT face="Times New Roman">in view of the fact that </FONT>说明事实<FONT face="Times New Roman">,</FONT>再用<FONT face="Times New Roman">we get </FONT>引出定理<FONT face="Times New Roman">.</FONT></P><P 0cm 0pt tab-stops: TEXT-INDENT: mso-list: level1 list -18pt; 29.25pt; l7 lfo22?><FONT face="Times New Roman">3.       We express this as a theorem.</FONT></P><P 0cm 0pt; TEXT-INDENT: 10.5pt? mso-char-indent-count: mso-char-indent-size: -21pt; -2.0;><FONT face="Times New Roman">         </FONT>这是当需要证明的事实已再前面作了说明或加以证明后<FONT face="Times New Roman">,</FONT>欲吧已证明的事实总结成定理时<FONT face="Times New Roman">,</FONT>常用倒的一个句子<FONT face="Times New Roman">,</FONT>类似的句子还有<FONT face="Times New Roman">(</FONT>参看附录Ⅲ<FONT face="Times New Roman">):</FONT></P><P 0cm 0pt; TEXT-INDENT: 10.5pt? mso-char-indent-count: mso-char-indent-size: -21pt; -2.0;><FONT face="Times New Roman">         We summarize this as the following theorem; Thus we come to the following theorem</FONT>等等<FONT face="Times New Roman">.</FONT></P><P 0cm 0pt tab-stops: TEXT-INDENT: mso-list: level1 list -18pt; 29.25pt; l7 lfo22?><FONT face="Times New Roman">4.       The least upper bound of these sums is therefore </FONT>≤<FONT face="Times New Roman">c</FONT>∑<SUB><FONT face="Times New Roman">a=1</FONT></SUB><SUP>∞</SUP><FONT face="Times New Roman">b<SUB>n</SUB>, thereby proving our theorem.</FONT></P><P 0cm 0pt; TEXT-INDENT: 10.5pt? mso-char-indent-count: mso-char-indent-size: -21pt; -2.0;><FONT face="Times New Roman">        </FONT>最一般的定理证明格式是<FONT face="Times New Roman">”</FONT>给出定理<FONT face="Times New Roman">…</FONT>定理证明<FONT face="Times New Roman">…</FONT>定理证毕<FONT face="Times New Roman">”,</FONT>即<FONT face="Times New Roman">thereby proving our theorem;</FONT>或<FONT face="Times New Roman">we have thus proves the theorem</FONT>或<FONT face="Times New Roman">This completes the proof</FONT>等等作结尾<FONT face="Times New Roman">(</FONT>参看附录Ⅲ<FONT face="Times New Roman">).</FONT></P><P 0cm 0pt tab-stops: TEXT-INDENT: mso-list: level1 list -18pt; 29.25pt; l7 lfo22?><FONT face="Times New Roman">5.       </FONT>本课文使用较多插入语<FONT face="Times New Roman">.</FONT>数学上常见的插入语有<FONT face="Times New Roman">:conversely; in practice; essentially; in particular; indeed; in other words; in short; generally speaking </FONT>等等<FONT face="Times New Roman">.</FONT>插入语通常与句中其它成份没有语法上的关系<FONT face="Times New Roman">,</FONT>一般用逗号与句子隔开<FONT face="Times New Roman">,</FONT>用来表示说话者对句子所表达的意思的态度<FONT face="Times New Roman">.</FONT>插入语可以是一个词<FONT face="Times New Roman">,</FONT>一个短语或者一个句子<FONT face="Times New Roman">.</FONT></P><P 0cm 0pt 11.25pt?><FONT face="Times New Roman"><p></FONT><p>

hehe123 发表于 2004-11-27 12:46

<b><FONT face="Times New Roman">Exercise </FONT></b>
<P><b><FONT face="Times New Roman"></FONT></b></P><P 0cm 0pt?>Ⅰ<FONT face="Times New Roman">. Translate the following exercises into Chinese:</FONT></P><P 0cm 0pt tab-stops: TEXT-INDENT: mso-list: level1 list -18pt; 34.5pt; l22 lfo23?><FONT face="Times New Roman">1.       In exercise 1 through 4,a sequence f (n) is defined by the formula given. In each case, (</FONT>ⅰ<FONT face="Times New Roman">)</FONT></P><P 0cm 0pt?><FONT face="Times New Roman">Determine whether the sequence (the formulae are omitted).</FONT></P><P 0cm 0pt tab-stops: TEXT-INDENT: mso-list: level1 list -18pt; 34.5pt; l22 lfo23?><FONT face="Times New Roman">2.       Assume f  is a non</FONT>–<FONT face="Times New Roman">negative function defined for all x&gt;1. Use the method</FONT></P><P 0cm 0pt; 21pt; TEXT-INDENT: 10.5pt? mso-char-indent-count: 2.0; mso-char-indent-size:><FONT face="Times New Roman">suggested by the proof of the integral test to show that </FONT></P><P 0cm 0pt; 21pt; TEXT-INDENT: 10.5pt? mso-char-indent-count: 2.0; mso-char-indent-size:><FONT face="Times New Roman">               </FONT>∑<FONT face="Times New Roman"><SUB>k=1</SUB><SUP>n-1</SUP>f(k)</FONT>≤∫<FONT face="Times New Roman"><SUB>1</SUB><SUP>n</SUP>f(x)d x </FONT>≤∑<FONT face="Times New Roman"><SUB>k=2</SUB><SUP>n</SUP>f(k)</FONT></P><P 0cm 0pt; 21pt; TEXT-INDENT: 10.5pt? mso-char-indent-count: 2.0; mso-char-indent-size:><FONT face="Times New Roman">Take f(x)=log x and deduce the inequalities</FONT></P><P 0cm 0pt; 21pt; TEXT-INDENT: 10.5pt? mso-char-indent-count: 2.0; mso-char-indent-size:><FONT face="Times New Roman">                c</FONT>•<FONT face="Times New Roman">n<SUP>n</SUP></FONT>•<FONT face="Times New Roman">c<SUP>-n</SUP>&lt; n</FONT>!<FONT face="Times New Roman">&lt;c</FONT>•<FONT face="Times New Roman">n<SUP>n+1</SUP></FONT>•<FONT face="Times New Roman">c<SUP>-n</SUP></FONT></P><P 0cm 0pt 21pt; TEXT-INDENT: 10.5pt? mso-char-indent-count: mso-char-indent-size: -21pt; -2.0;>Ⅱ<FONT face="Times New Roman">. The proof of theorem 4 is given in English as follows(Read the proof through and try to learn how a theorem is proved, then translate this proof into Chinese ):</FONT></P><P 0cm 0pt 21pt; TEXT-INDENT: 10.5pt? mso-char-indent-count: mso-char-indent-size: -21pt; -2.0;><FONT face="Times New Roman">        Proof of theorem 4 Since we are interested in the absolute convergence. We may assume that a<SUB>n</SUB>&gt;0 for all n. Let 0&lt;x&lt;r, and let c be a number such that x&lt;c&lt;r. Recall that lim<SUB>a</SUB></FONT><SUB>→∞</SUB><FONT face="Times New Roman">n<SUP>1/n</SUP>=1.</FONT></P><P 0cm 0pt 21pt; TEXT-INDENT: 10.5pt? mso-char-indent-count: mso-char-indent-size: -21pt; -2.0;><FONT face="Times New Roman">        We may write n a<SUB>n </SUB>x<SUP>n </SUP>=a<SUB>n</SUB>(n<SUP>1/n</SUP>x)<SUP>n</SUP>. Then for all n sufficiently large, we conclude that n<SUP>1/n</SUP>x&lt;c. This is because n1/n comes arbitrarily close to x and x&lt;c. Hence for all n sufficiently large, we have na<SUB>n</SUB>x<SUP>n</SUP>&lt;a<SUB>n</SUB>c<SUP>n</SUP>. We can then compare the series </FONT>∑<FONT face="Times New Roman">na<SUB>n</SUB>x<SUP>n </SUP>with</FONT>∑<FONT face="Times New Roman">a<SUB>n</SUB>c<SUP>n</SUP> to conclude that</FONT>∑<FONT face="Times New Roman">na<SUB>n</SUB>x<SUP>n</SUP> converges. Since</FONT>∑<FONT face="Times New Roman">na<SUB>n</SUB>x<SUP>n-1</SUP>=1/x</FONT>∑<FONT face="Times New Roman">na<SUB>n</SUB>x<SUP>n</SUP>, we have proved theorem 4.</FONT></P><P 0cm 0pt 21pt; TEXT-INDENT: 10.5pt? mso-char-indent-count: mso-char-indent-size: -21pt; -2.0;>Ⅲ<FONT face="Times New Roman">. Recall from what you have learned in Calculus about (</FONT>ⅰ<FONT face="Times New Roman">) Cauchy sequence and (</FONT>ⅱ<FONT face="Times New Roman">) the radius of convergence of a power series.</FONT></P><P 0cm 0pt 21pt; TEXT-INDENT: 10.5pt? mso-char-indent-count: mso-char-indent-size: -21pt; -2.0;><FONT face="Times New Roman">      Now give the definitions of these two terms respectively.</FONT></P><P 0cm 0pt 21pt; TEXT-INDENT: 10.5pt? mso-char-indent-count: mso-char-indent-size: -21pt; -2.0;>Ⅳ<FONT face="Times New Roman">.  Translate the following sentences into Chinese:</FONT></P><P 0cm 0pt tab-stops: TEXT-INDENT: mso-list: level1 list -18pt; 45pt; 45.0pt; l15 lfo24?><FONT face="Times New Roman">1.       </FONT>一旦我们能证明<FONT face="Times New Roman">,</FONT>幂级数∑<FONT face="Times New Roman">a<SUB>n</SUB>z<SUP>n</SUP> </FONT>在点<FONT face="Times New Roman">z=z<SUB>1</SUB></FONT>收敛<FONT face="Times New Roman">,</FONT>则容易证明<FONT face="Times New Roman">,</FONT>对每一<FONT face="Times New Roman">z<SUB>1</SUB></FONT>∣<FONT face="Times New Roman">z</FONT>∣<FONT face="Times New Roman">&lt;</FONT>∣<FONT face="Times New Roman">z<SUB>1</SUB></FONT>∣<FONT face="Times New Roman"> ,</FONT>级数绝对收敛<FONT face="Times New Roman">;</FONT></P><P 0cm 0pt tab-stops: TEXT-INDENT: mso-list: level1 list -18pt; 45pt; 45.0pt; l15 lfo24?><FONT face="Times New Roman">2.       </FONT>因为∑<FONT face="Times New Roman">a<SUB>n</SUB>z<SUP>n</SUP></FONT>在<FONT face="Times New Roman">z=z<SUB>1</SUB></FONT>收敛<FONT face="Times New Roman">,</FONT>于是<FONT face="Times New Roman">,</FONT>由<FONT face="Times New Roman">weierstrass</FONT>的<FONT face="Times New Roman">M—</FONT>判别法可立即得到∑<FONT face="Times New Roman">a<SUB>n</SUB>z<SUP>n</SUP></FONT>在点<FONT face="Times New Roman">z,</FONT>∣<FONT face="Times New Roman">z</FONT>∣<FONT face="Times New Roman">&lt;z<SUB>1</SUB></FONT>的绝对收敛性<FONT face="Times New Roman">;</FONT></P><P 0cm 0pt tab-stops: TEXT-INDENT: mso-list: level1 list -18pt; 45pt; 45.0pt; l15 lfo24?><FONT face="Times New Roman">3.       </FONT>我们知道有限项和中各项可以重新安排而不影响和的值<FONT face="Times New Roman">,</FONT>但对于无穷级数<FONT face="Times New Roman">,</FONT>上述结论却不总是真的</P>

hehe123 发表于 2004-11-27 12:47

数学专业英语[7]-Linear Algebra

<P><FONT face="Times New Roman"><FONT size=3>For the definition that follows we assume that we are given a particular field K. The scalars to be used are to be elements of K.</FONT></FONT></P>
<P><FONT face="Times New Roman"><FONT size=3>   DEFINITION.    A vector space is a set  V  of elements called vectors satisfying the following axioms.</FONT></FONT></P>
<P><FONT face="Times New Roman"><FONT size=3>   (A)    To every pair,   x  and  y ,of vectors in  V  corresponds a vector x+y,called the sum of  x  and  y, in such a way that.</FONT></FONT></P>
<P><FONT face="Times New Roman" size=3>(1)  addition is commutative, x + y = y + x.</FONT></P>
<P><FONT face="Times New Roman" size=3>(2)  addition is associative, x + ( y + z ) = ( x + y ) + z.</FONT></P>
<P><FONT face="Times New Roman" size=3>(3)  there exists in  V  a unique vector 0 (called the origin ) such that x + 0 = x for every vector x , and</FONT></P>
<P><FONT face="Times New Roman" size=3>(4)  to every vector x in  V  there corresponds a unique vector - x such that x + ( - x ) = 0.</FONT></P>
<P><FONT size=3><FONT face="Times New Roman">(B)   To every pair,</FONT>α<FONT face="Times New Roman">and x , where </FONT>α<FONT face="Times New Roman"> is a scalar and x is a vector in  V  ,there corresponds a vector </FONT>α<FONT face="Times New Roman">x in  V  , called the product of </FONT>α<FONT face="Times New Roman"> and x , in such a way that </FONT></FONT></P>
<P><FONT size=3><FONT face="Times New Roman">(1)  multiplication by scalars is associative,</FONT>α<FONT face="Times New Roman">(</FONT>β<FONT face="Times New Roman">x ) = (</FONT>αβ<FONT face="Times New Roman">) x</FONT></FONT></P>
<P><FONT face="Times New Roman" size=3>(2)  1 x = x for every vector x.</FONT></P>
<P><FONT size=3><FONT face="Times New Roman">(C)  (1) multiplication by scalars is distributive with respect to vector addition,</FONT>α<FONT face="Times New Roman">( x + y ) = </FONT>α<FONT face="Times New Roman">x+</FONT>β<FONT face="Times New Roman">y , and</FONT></FONT></P>
<P><FONT size=3><FONT face="Times New Roman">(2)multiplication by vectors is distributive with respect to scalar addition,(</FONT>α<FONT face="Times New Roman">+</FONT>β<FONT face="Times New Roman">) x = </FONT>α<FONT face="Times New Roman">x + </FONT>β<FONT face="Times New Roman">x .</FONT></FONT></P>
<P><FONT size=3><FONT face="Times New Roman">The relation between a vector space  V  and the underlying field  K  is usually described by saying that  V  is a vector space over  K . The associated field of scalars is usually either the real numbers  R or the complex numbers  C . If  V is linear space and  M</FONT>真包含于<FONT face="Times New Roman">V , and if </FONT>α<FONT face="Times New Roman"> u -v belong to  M  for every  u  and  v  in  M     and every </FONT>α∈<FONT face="Times New Roman">  K  , then   M  is linear subspace of  V . If U = { u 1,u 2,</FONT>…<FONT face="Times New Roman">} is a collection of points in a linear space  V , then the (linear) span of the set  U  is the set of all points o the form </FONT>∑<FONT face="Times New Roman"> c <SUB>i</SUB> u <SUB>i</SUB> , where c <SUB>i</SUB></FONT>∈<FONT face="Times New Roman">  K ,and all but a finite number of the scalars c<SUB>i</SUB> are 0.The span of U is always a linear subspace of  V.</FONT></FONT></P>
<P><FONT size=3><FONT face="Times New Roman">    A key concept in linear algebra is independence. A finite set { u <SUB>1</SUB>,u <SUB>2</SUB>,</FONT>…<FONT face="Times New Roman">, u <SUB>k </SUB>} is said to be linearly independent in  V if the only way to write 0 = </FONT>∑<FONT face="Times New Roman"> c <SUB>i</SUB> u <SUB>i </SUB>  is by choosing all the c <SUB>i</SUB> = 0 . An infinite set is linearly independent if every finite set is independent . If a set is not independent, it is linearly dependent, and in this case, some point in the set can be written as a linear combination of other points in the set. A basis for a linear space  M  is an independent set that spans  M .  A space  M  is finite-dimensional if it can be spanned by a finite set; it can then be shown that every spanning set contains a basis, and every basis for  M  has the same number of points in it. This common number is called the dimension of  M  .</FONT></FONT></P>
<P><FONT size=3><FONT face="Times New Roman">Another key concept is that of linear transformation. If  V  and  W  are linear spaces with the same scalar field  K , a mapping  L  from  V  into  W  is called linear if  L (u + v ) =  L( u ) + L ( v ) and  L ( </FONT>α<FONT face="Times New Roman">u ) = </FONT>α<FONT face="Times New Roman"> L ( u )  for every  u  and  v  in  V  and </FONT>α<FONT face="Times New Roman"> in  K . With any  I , are associated two special linear spaces:</FONT></FONT></P>
<P><FONT face="Times New Roman"><FONT size=3>               ker (  L  ) = null space of  L  =  L<SUP>-1  </SUP>(0)</FONT></FONT></P>
<P><FONT size=3><FONT face="Times New Roman">                    = { all x </FONT>∈<FONT face="Times New Roman"> V  such that  L ( X ) = 0 }</FONT></FONT></P>
<P><FONT size=3><FONT face="Times New Roman">      Im ( L ) = image of  L  =  L( V )  = { all L( x ) for x</FONT>∈<FONT face="Times New Roman"> V }.</FONT></FONT></P>
<P><FONT face="Times New Roman" size=3>Then  r = dimension of Im ( L ) is called the rank of  L. If  W also has dimension  n, then the following useful criterion results: L is 1-to-1 if and only if L is onto.In particular, if  L is a linear map of  V into itself, and the only solution of  L( x ) = 0 is 0, then L IS onto and is therefore an isomorphism of V onto  V , and has an inverse  L <SUP>-1</SUP> . Such a transformation  V  is also said to be nonsingular.</FONT></P>
<P><FONT size=3><FONT face="Times New Roman">Suppose now that  L  is a linear transformation from  V  into  W  where dim ( V ) = n and  dim  ( W ) =   m . Choose a basis {</FONT>υ<FONT face="Times New Roman"><SUB>1 </SUB>,</FONT>υ<SUB><FONT face="Times New Roman">2 ,</FONT></SUB>…<FONT face="Times New Roman">,</FONT>υ<FONT face="Times New Roman"><SUB>n</SUB>} for  V and a basis {w <SUB>1 </SUB>,w<SUB>2 </SUB>,</FONT>…<FONT face="Times New Roman">,w <SUB>m</SUB>} for  W . Then these define isomorphisms of  V onto  K<SUP>n  </SUP>and  W onto  K<SUP>m</SUP> , respectively, and these in turn induce a linear transformation  A  between these.  Any linear transformation ( such as  A  ) between  K<SUP>n  </SUP>and  K<SUP>m </SUP>is described by means of a matrix ( a<SUB>ij </SUB>), according to the formula  A ( x )  = y , where  x = { x<SUB>1</SUB> , x <SUB>2</SUB>,</FONT>…<FONT face="Times New Roman">, x<SUB>n</SUB> }    y = { y<SUB>1</SUB> , y <SUB>2</SUB>,</FONT>…<FONT face="Times New Roman">, y <SUB>m</SUB>} and    </FONT></FONT></P>
<P><FONT face="Times New Roman" size=3>     </FONT></P>
<P><FONT size=3><FONT face="Times New Roman">                 Y <SUB>j</SUB>  =</FONT>Σ<FONT face="Times New Roman"><SUP>n</SUP><SUB>j=i</SUB>  a<SUB>ij</SUB> x<SUB>i         </SUB>  I=1,2,</FONT>…<FONT face="Times New Roman">,m.</FONT></FONT></P>
<P><FONT face="Times New Roman" size=3>The matrix A is said to represent the transformation  L and to be the representation induced by the particular basis chosen for         V and  W .</FONT></P>
<P><FONT face="Times New Roman" size=3>If S and T are linear transformations of  V into itself, so is the compositic transformation  ST . If we choose a basis in  V , and use this to obtain matrix representations for these, with  A  representing  S and  B representing  T , then ST must have a matrix representation  C  . This is defined to be the product  AB of the matrixes  A  and  B , and leads to the standard formula for matrix multiplication.</FONT></P>
<P><FONT size=3><FONT face="Times New Roman">The least satisfactory aspect of linear algebra is still the theory of determinants even though this is the most ancient portion of the theory, dating back to Leibniz if not to early China. One standard approach to determinants is to regard an n -by- n matrix as an ordered array of vectors( u <SUB>1 </SUB>, u <SUB>2</SUB> ,</FONT>…<FONT face="Times New Roman">, u <SUB>n</SUB> ) and then its determinant det ( A ) as a function F( u <SUB>1 </SUB>, u <SUB>2 </SUB>,</FONT>…<FONT face="Times New Roman">, u <SUB>n</SUB> ) of these n vectors which obeys certain rules.</FONT></FONT></P>
<P><FONT size=3><FONT face="Times New Roman">The determinant of such an array  A turns out to be a convenient criterion  for characterizing the nonsingularity of the associated linear transformation, since det ( A ) = F ( u <SUB>1</SUB> , u <SUB>2</SUB> ,</FONT>…<FONT face="Times New Roman">, u <SUB>n</SUB> ) = 0 if and only if the set of vectors  u<SUB>i </SUB>are linearly dependent. There are many other useful and elegant properties  of determinants, most of which will be found in any classic book on linear algebra. Thus, det ( AB ) = det ( A ) det ( B ), and det ( A ) = det ( A') ,where  A' is the transpose of  A , obtained by the formula  A' =( a <SUB>ji </SUB>), thereby rotating the array about the main diagonal. If a square matrix is triangular, meaning that all its entries above the main diagonal are 0,then det ( A ) turns out to be exactly the product of the diagonal entries.</FONT></FONT></P>
<P><FONT size=3><FONT face="Times New Roman">Another useful concept is that of eigenvalue. A scalar is said to be an eigenvalue for a transformation  T if there is a nonzero vector  </FONT>υ<FONT face="Times New Roman"> with  T (</FONT>υ<FONT face="Times New Roman">)  </FONT>λυ<FONT face="Times New Roman"> . It is then clear that the eigenvalues will be those numbers </FONT>λ∈<FONT face="Times New Roman">  K such that  T -</FONT>λ<FONT face="Times New Roman"> I is a singular transformation. Any vector in the null space of  T -</FONT>λ<FONT face="Times New Roman"> I is called an eigenvector of  T associated with eigenvalue </FONT>λ<FONT face="Times New Roman">, and their span the eigenspace,  E </FONT><SUB>λ<FONT face="Times New Roman">.</FONT></SUB><FONT face="Times New Roman">  It is invariant under the action of  T , meaning that  T carries  E</FONT><SUB>λ</SUB><FONT face="Times New Roman"> into itself. The eigenvalues of  T  are then  exactly the set of roots of the polynomial  p(</FONT>λ<FONT face="Times New Roman">) =det ( T  -</FONT>λ<FONT face="Times New Roman"> I ).If  A is a matrix representing  T ,then one has  p (</FONT>λ<FONT face="Times New Roman">) det ( A -</FONT>λ<FONT face="Times New Roman">I ), which permits one to find the eigenvalues of  T easily if the dimension of  V is not too large, or if the matrix  A is simple enough. The eigenvalues and eigenspaces of   T provide a means by which the nature and structure of the linear transformation  T can be examined in detail.</FONT></FONT></P>

hehe123 发表于 2004-11-27 12:48

<P align=center 0cm 0pt; TEXT-ALIGN: center?><B><FONT face="Times New Roman">Vocabulary</FONT></B></P><P mso-layout-grid-align: none? 0cm 0pt;><FONT face="Times New Roman">
</FONT><p><P mso-layout-grid-align: none? 0cm 0pt; 21pt; TEXT-INDENT:><FONT face="Times New Roman">linear algebra     </FONT>线性代数<FONT face="Times New Roman">               non-singular    </FONT>非奇异</P><P mso-layout-grid-align: none? 0cm 0pt; 21pt; TEXT-INDENT:><FONT face="Times New Roman">field    </FONT>域<FONT face="Times New Roman">                               isomorphism     </FONT>同构</P><P mso-layout-grid-align: none? 0cm 0pt; 21pt; TEXT-INDENT:><FONT face="Times New Roman">vector   </FONT>向量<FONT face="Times New Roman">                             isomorphic    </FONT>同构</P><P mso-layout-grid-align: none? 0cm 0pt; 21pt; TEXT-INDENT:><FONT face="Times New Roman">scalar   </FONT>纯量<FONT face="Times New Roman">,</FONT>无向量<FONT face="Times New Roman">                      matrix    </FONT>矩阵<FONT face="Times New Roman">(</FONT>单数<FONT face="Times New Roman">)</FONT></P><P mso-layout-grid-align: none? 0cm 0pt; 21pt; TEXT-INDENT:><FONT face="Times New Roman">vector space   </FONT>向量空间<FONT face="Times New Roman">                   matrices    </FONT>矩阵<FONT face="Times New Roman">(</FONT>多数<FONT face="Times New Roman">)</FONT></P><P mso-layout-grid-align: none? 0cm 0pt; 21pt; TEXT-INDENT:><FONT face="Times New Roman">span    </FONT>生成<FONT face="Times New Roman">,</FONT>长成<FONT face="Times New Roman">                         determinant      </FONT>行列式</P><P mso-layout-grid-align: none? 0cm 0pt; 21pt; TEXT-INDENT:><FONT face="Times New Roman">independence   </FONT>无关<FONT face="Times New Roman">(</FONT>性<FONT face="Times New Roman">),</FONT>独立<FONT face="Times New Roman">(</FONT>性<FONT face="Times New Roman">)          array    </FONT>阵列</P><P mso-layout-grid-align: none? 0cm 0pt; 21pt; TEXT-INDENT:><FONT face="Times New Roman">dependence    </FONT>有关<FONT face="Times New Roman">(</FONT>性<FONT face="Times New Roman">)                    diagonal    </FONT>对角线</P><P mso-layout-grid-align: none? 0cm 0pt; 21pt; TEXT-INDENT:><FONT face="Times New Roman">linear combination    </FONT>线性组合<FONT face="Times New Roman">            triangular    </FONT>三角形的</P><P mso-layout-grid-align: none? 0cm 0pt; 21pt; TEXT-INDENT:><FONT face="Times New Roman">basis    </FONT>基<FONT face="Times New Roman">(</FONT>单数<FONT face="Times New Roman">)                         entry       </FONT>表值<FONT face="Times New Roman">,</FONT>元素</P><P mso-layout-grid-align: none? 0cm 0pt; 21pt; TEXT-INDENT:><FONT face="Times New Roman">basis    </FONT>基<FONT face="Times New Roman">(</FONT>多数<FONT face="Times New Roman">)                         eigenvalue   </FONT>特征值<FONT face="Times New Roman">,</FONT>本征值</P><P mso-layout-grid-align: none? 0cm 0pt; 21pt; TEXT-INDENT:><FONT face="Times New Roman">dimension  </FONT>维<FONT face="Times New Roman">                             eigenvector    </FONT>特征向量</P><P mso-layout-grid-align: none? 0cm 0pt; 21pt; TEXT-INDENT:><FONT face="Times New Roman">linear transformation   </FONT>线性变换<FONT face="Times New Roman">          invariant     </FONT>不变<FONT face="Times New Roman">,</FONT>不变量</P><P mso-layout-grid-align: none? 0cm 0pt; 21pt; TEXT-INDENT:><FONT face="Times New Roman">null space    </FONT>零空间<FONT face="Times New Roman">                      row    </FONT>行</P><P mso-layout-grid-align: none? 0cm 0pt; 21pt; TEXT-INDENT:><FONT face="Times New Roman">rank    </FONT>秩<FONT face="Times New Roman">                                column  </FONT>列</P><P mso-layout-grid-align: none? 0cm 0pt; 21pt; TEXT-INDENT:><FONT face="Times New Roman">singular    </FONT>奇异<FONT face="Times New Roman">                          system of equations   </FONT>方程组</P><P mso-layout-grid-align: none? 0cm 0pt; 21pt; TEXT-INDENT:><FONT face="Times New Roman">                                          homogeneous      </FONT>齐次</P>

hehe123 发表于 2004-11-27 12:48

<P align=center 0cm 0pt; TEXT-ALIGN: center?><B><FONT face="Times New Roman">Notes</FONT></B></P><P mso-layout-grid-align: none? 0cm 0pt; tab-stops: 0cm;><FONT face="Times New Roman">1.    If U = { u <SUB>1</SUB> , u <SUB>2</SUB> ,</FONT>…<FONT face="Times New Roman">}is a collection of points in a linear</FONT></P><P mso-layout-grid-align: none? 0cm 0pt; tab-stops: 0cm;><FONT face="Times New Roman">space  V , then the (linear) span of the set U is the set of all points of the form </FONT>∑<FONT face="Times New Roman"> c<SUB> i</SUB> u<SUB> i , w</SUB>where c <SUB>i</SUB></FONT>∈<FONT face="Times New Roman"> K ,and all but a finite number of scalars c<SUB> I </SUB>are 0.</FONT></P><P mso-layout-grid-align: none? 0cm 0pt;>意思是<FONT face="Times New Roman">:</FONT>如果<FONT face="Times New Roman">   U  = { u <SUB>1</SUB> , u <SUB>2</SUB> ,</FONT>…<FONT face="Times New Roman">}</FONT>是线性空间<FONT face="Times New Roman">     V    </FONT>的点集<FONT face="Times New Roman">,</FONT>那么集<FONT face="Times New Roman">  U </FONT>的<FONT face="Times New Roman">(</FONT>线性<FONT face="Times New Roman">)</FONT>生成是所有形如<FONT face="Times New Roman"> </FONT>∑<FONT face="Times New Roman"> c <SUB>i</SUB> u <SUB>i</SUB> </FONT>的点集<FONT face="Times New Roman">,</FONT>这里<FONT face="Times New Roman"> c <SUB>i  </SUB></FONT>∈<FONT face="Times New Roman">  K ,</FONT>且除了有限个<FONT face="Times New Roman"> c<SUB>i</SUB>  </FONT>外均为<FONT face="Times New Roman">0.</FONT></P><P mso-layout-grid-align: none? 0cm 0pt;><FONT face="Times New Roman">
</FONT><p><P mso-layout-grid-align: none? 0cm 0pt; tab-stops: 0cm;><FONT face="Times New Roman">2.    A  finite set { u <SUB>1</SUB> , u <SUB>2</SUB> ,</FONT>…<FONT face="Times New Roman">, u <SUB>k</SUB>}<SUB>  </SUB>is said to be linearly independent if the only way to write 0 = </FONT>∑<FONT face="Times New Roman"> c <SUB>i</SUB> u <SUB>I</SUB> is by choosing all the c <SUB>i</SUB>= 0.</FONT></P><P mso-layout-grid-align: none? 0cm 0pt; TEXT-INDENT: 26.25pt;>这一句可以用更典型的句子表达如下<FONT face="Times New Roman">: A finite set { u <SUB>1</SUB>, u <SUB>2</SUB> ,</FONT>…<FONT face="Times New Roman">, u <SUB>k</SUB> } is said to be linearly independent in  V if </FONT>∑<FONT face="Times New Roman">c <SUB>i</SUB> u <SUB>i</SUB> is by choosing all the c <SUB>i</SUB> = 0.</FONT></P><P mso-layout-grid-align: none? 0cm 0pt; TEXT-INDENT: 26.25pt;>这里<FONT face="Times New Roman">independent </FONT>是形容词<FONT face="Times New Roman">,</FONT>故用<FONT face="Times New Roman">linearly</FONT>修饰它<FONT face="Times New Roman">. </FONT>试比较<FONT face="Times New Roman">F(x) is a continuous periodic function.</FONT>这里<FONT face="Times New Roman">periodic </FONT>是形容词但它前面的词却用<FONT face="Times New Roman">continuous </FONT>而不用<FONT face="Times New Roman">continuously,</FONT>这是因为<FONT face="Times New Roman">continuous </FONT>这个词不是修饰<FONT face="Times New Roman">periodic</FONT>而是修饰作为整体的名词<FONT face="Times New Roman">periodic function.</FONT></P><P mso-layout-grid-align: none? 0cm 0pt; TEXT-INDENT: 26.25pt;><FONT face="Times New Roman"><p></FONT><p><P mso-layout-grid-align: none? 0cm 0pt; tab-stops: 0cm;><FONT face="Times New Roman">3.    Then these define isomorphisms of  V onto  K<SUP>n</SUP>  and  W onto  K<SUP>M</SUP> respectively, and these in turn induce a linear transformation  A between these.</FONT></P><P mso-layout-grid-align: none? 0cm 0pt; TEXT-INDENT: 21.75pt;>这里第一个<FONT face="Times New Roman">these</FONT>代表前句的两个基<FONT face="Times New Roman">(basis);</FONT>第二个<FONT face="Times New Roman">these</FONT>代表<FONT face="Times New Roman">isomorphisms;</FONT>第三个<FONT face="Times New Roman">these</FONT>代表什么留给读者自己分析<FONT face="Times New Roman">.</FONT></P><P mso-layout-grid-align: none? 0cm 0pt; TEXT-INDENT: 21.75pt;><FONT face="Times New Roman"><p></FONT><p><P mso-layout-grid-align: none? 0cm 0pt;><FONT face="Times New Roman">4.  The least satisfactory aspect of linear algebra is still the theory of determinants-</FONT></P><P mso-layout-grid-align: none? 0cm 0pt;><FONT face="Times New Roman">   </FONT>意思是<FONT face="Times New Roman">:</FONT>线性代数最令人不满意的方面仍是有关行列式的理论<FONT face="Times New Roman">.least satisfactory </FONT>意思是<FONT face="Times New Roman">:</FONT>最令人不满意<FONT face="Times New Roman">.</FONT></P><P mso-layout-grid-align: none? 0cm 0pt;><FONT face="Times New Roman"><p></FONT><p><P mso-layout-grid-align: none? 0cm 0pt tab-stops: TEXT-INDENT: 18.0pt; 18pt; -18pt;><FONT face="Times New Roman">5.   If  a square matrix is triangular, meaning that all its entries above the main diagonal are 0,then det ( A ) turns out to be exactly the product of the diagonal entries.</FONT></P><P mso-layout-grid-align: none? 0cm 0pt; TEXT-INDENT: 32.25pt;>意思是<FONT face="Times New Roman">:</FONT>如果方阵是三角形的<FONT face="Times New Roman">,</FONT>即所有在主对角线上方的元素均为零<FONT face="Times New Roman">,</FONT>那末<FONT face="Times New Roman">det( A ) </FONT>刚好就是对角线元素的乘积<FONT face="Times New Roman">.</FONT>这里<FONT face="Times New Roman">meaning that </FONT>可用<FONT face="Times New Roman">that is to say </FONT>代替<FONT face="Times New Roman">,turns out to be</FONT>解为<FONT face="Times New Roman">”</FONT>结果是</P>

hehe123 发表于 2004-11-27 12:49

<P align=center 0cm 0pt; TEXT-ALIGN: center?><B><FONT face="Times New Roman">Exercise</FONT></B></P><P mso-layout-grid-align: none? 0cm 0pt tab-stops: TEXT-INDENT: -36pt; 36pt; 36.0pt;><FONT face="Times New Roman">I.          Answer the following questions:</FONT></P><P mso-layout-grid-align: none? 0cm 0pt;><FONT face="Times New Roman">  1. How can we define the linear independence of an infinite set?</FONT></P><P mso-layout-grid-align: none? 0cm 0pt;><FONT face="Times New Roman">  2. Let  T  be a linear transformation (T:   V </FONT>→<FONT face="Times New Roman"> W  ) whose associated matrix is A.Give a criterion for the non-singularity of the transformation  T.</FONT></P><P mso-layout-grid-align: none? 0cm 0pt;><FONT face="Times New Roman">3. Where is the entry a<SUB>45</SUB> of a  m -by-  n  matrix( m&gt;4; n&gt;5) located ?</FONT></P><P mso-layout-grid-align: none? 0cm 0pt;><FONT face="Times New Roman">4. Let  A  , B  be two rectangular matrices.Under what condition is the product matrix well-defined ?</FONT></P><P mso-layout-grid-align: none? 0cm 0pt;><FONT face="Times New Roman">
</FONT><p><P mso-layout-grid-align: none? 0cm 0pt;><FONT face="Times New Roman">II.Translate the following two examples and their proofs into Chinese:</FONT></P><P mso-layout-grid-align: none? 0cm 0pt;><FONT face="Times New Roman">  1.Example1.   Let   u<SUB>k</SUB>=     t<SUP>k</SUP>  ,k=0,1,2,...  and   t   real. Show that the set    </FONT>{<FONT face="Times New Roman">u <SUB>0</SUB>,u<SUB>1</SUB>,u<SUB>2</SUB>,…</FONT>}<FONT face="Times New Roman"> is independent.</FONT></P><P mso-layout-grid-align: none? 0cm 0pt;><FONT face="Times New Roman"><p></FONT><p><P mso-layout-grid-align: none? 0cm 0pt;><FONT face="Times New Roman">Proof:   By the definition of independence of an infinite set, it suffices to show that for each  n  ,the n+1   polynomials   u<SUB>0</SUB>,u<SUB>1</SUB>,...,u<SUB>n</SUB>     are independent.A  relation of the form   </FONT>∑<FONT face="Times New Roman"><SUP>n</SUP><SUB>k=0</SUB> c<SUB>k</SUB>u<SUB>k</SUB>=0 means </FONT>∑<FONT face="Times New Roman"><SUP>n</SUP><SUB>k=0</SUB> c<SUB>k</SUB> t<SUP>k</SUP>=0 for all   t.When   t=0,this gives c<SUB>0</SUB> =0.Differentiating both sides of    </FONT>∑<FONT face="Times New Roman"><SUP>n</SUP><SUB>k=0</SUB> c<SUB>k</SUB> t<SUP>k</SUP> =0 and setting    t=0,we find that  c<SUB>1</SUB>=0.Repeating the process,we find that each cocfficient is zero</FONT></P><P mso-layout-grid-align: none? 0cm 0pt;><FONT face="Times New Roman">2.  Example 2.   Let  V  be afinite dimensional linear space, Then every finite basis for  V has the same number of elements.</FONT></P><P mso-layout-grid-align: none? 0cm 0pt;><FONT face="Times New Roman">Proof:    Let  S  and  T be two finite bases for V. Suppose  S consists of  k elemnts and T consists of   m  elements.Since  S   is independent and spans  V  ,every set of  k+1  elements in  V  is dependent.Therefore every set of more than k   elements in V  is dependent. Since T  is an independent set , we must have m&lt;k. The same argument with S and T  interchanged shows that   k&lt;m. Hence   k=m.</FONT></P><P mso-layout-grid-align: none? 0cm 0pt;><FONT face="Times New Roman"><p></FONT><p><P mso-layout-grid-align: none? 0cm 0pt;><FONT face="Times New Roman">III.Translate the following sentences into English:</FONT></P><P mso-layout-grid-align: none? 0cm 0pt;><FONT face="Times New Roman">     1.</FONT>设<FONT face="Times New Roman">  A   </FONT>是一矩阵。若其行数<FONT face="Times New Roman">  n   </FONT>等于其列数<FONT face="Times New Roman"> m  </FONT>,则称<FONT face="Times New Roman">  A </FONT>是一方阵;若<FONT face="Times New Roman">n  </FONT>≠<FONT face="Times New Roman">m</FONT>,则称<FONT face="Times New Roman">A </FONT>是一矩形阵。 <p><p><P mso-layout-grid-align: none? 0cm 0pt;><FONT face="Times New Roman">   2.</FONT>设<FONT face="Times New Roman"> T </FONT>是一线性变换,则<FONT face="Times New Roman"> T </FONT>的特征值刚好是多项式<FONT face="Times New Roman">  P</FONT>(λ)<FONT face="Times New Roman">=det</FONT>(<FONT face="Times New Roman">T- </FONT>λ<FONT face="Times New Roman">E </FONT>)的根。 <p><p><P mso-layout-grid-align: none? 0cm 0pt;><FONT face="Times New Roman">   3.</FONT>形如Σ<FONT face="Times New Roman"><SUP>n</SUP><SUB>k=1</SUB>c<SUB>ik</SUB> x<SUB>k</SUB> =c<SUB>i</SUB>  i=1</FONT>,<FONT face="Times New Roman">2</FONT>,<FONT face="Times New Roman">...,m  </FONT>的一组方程称为<FONT face="Times New Roman">  m  </FONT>个线性方程,<FONT face="Times New Roman">n  </FONT>个未知数的方程组。若所有<FONT face="Times New Roman">  c<SUB>i</SUB>=0</FONT>,则称上述方程组为一齐次方程组。 <p><p>

hehe123 发表于 2004-11-27 12:49

数学专业英语[8]-Statistics

<b>数学专业英语-Statistics
</b>
<P><FONT face="Times New Roman" size=3>The term statistics is used in either of two senses.In common parlance it is generally employed synonymously with the word data.Thus someone may say that he has seen”statistics of industrial accidents in the United States.” It would be conducive to greater precision of meaning if we were not to use statistics in this sense,but rather to say “data (or figures ) of industrial accidents in the United States.”</FONT></P>
<P><FONT face="Times New Roman" size=3>“Statistics” also refers to the statistical principles and methods which have been developed for handling numerical data and which form the subject matter of this text.Statistical methods,or statistics, range form the most elementary descriptive devices, which may be understood by anyone , to those extremely complicated mathematical procedures which are comprehended by only the most expert theoreticians.It is the purpose of this volume not to enter into the highly mathematical and theoretical aspects of the subject but rather to treat of its more elementary and more frequently used phases.</FONT></P>
<P><FONT face="Times New Roman" size=3>Statistics may be defined as the collection, presentation, analysis, and interpretation of numerical data.The facts which are dealt with must be capable of numerical expression.We can make little use statistically of the information that dwellings are built of brick, stone, wood, and other materials; however, if we are able to determine how many or what proportion of,dwellings are constructed of each type of material, we have numerical data suitable for statistical analysis.</FONT></P>
<P><FONT face="Times New Roman" size=3>Statistics should not be thought of as a subject correlative with physics, chemistry, economics, and sociology. Statistics is not a science; it is a scientific method. The methods and procedures which we are about to examine constitute a useful and often indispensable tool for the research worker. Without an adequate understanding of statistics, the investigator in the social sciences may frequently be like the blind man groping in a dark closet for a black cat that isn’t there. The methods of statistics are useful in an ever---widening range of human activities, in any field of thought in which numerical data may be had.</FONT></P>
<P><FONT face="Times New Roman" size=3>In defining statistics it was pointed out that the numerical data are collected, presented, analyzed, and interpreted. Let us briefly examine each of these four procedures.</FONT></P>
<P><FONT face="Times New Roman" size=3>COLLECTION   Statistical data may be obtained from existing published or unpublished sources, such as government agencies, trade associations, research bureaus, magazines, newspapers, individual research workers, and elsewhere. On the other hand, the investigator may collect his own information, going perhaps from house to house or from firm to firm to obtain his data. The first-hand collection of statistical data is one of the most difficult and important tasks which a statistician must face. The soundness of his procedure determines in an overwhelming degree the usefulness of the data which he obtains.</FONT></P>
<P><FONT face="Times New Roman" size=3>It should be emphasized, however, that the investigator who has experience and good common sense is at a distinct advantage if original data must be collected. There is much which may be taught about this phase of statistics, but there is much more which can be learned only through experience. Although a person may never collect statistical data for his own use and may always use published sources, it is essential that he have a working knowledge of the processes of collection and that he be able to evaluate the reliability of the data he proposes to use. Untrustworthy data do not constitute a satisfactory base upon which to rest a conclusion.</FONT></P>
<P><FONT face="Times New Roman" size=3>It is to be regretted that many people have a tendency to accept statistical data without question. To them, any statement which is presented in numerical terms is correct and its authenticity is automatically established.</FONT></P>
<P><FONT face="Times New Roman" size=3>PRESENTATION    Either for one’s own use or for the use of others, the data must be presented in some suitable form. Usually the figures are arranged in tables or presented by graphic devices.</FONT></P>
<P><FONT face="Times New Roman" size=3>ANALYSIS    In the process of analysis, data must be classified into useful and logical categories. The possible categories must be considered when plans are made for collecting the data, and the data must be classified as they are tabulated and before they can be shown graphically. Thus the process of analysis is partially concurrent with collection and presentation.</FONT></P>
<P><FONT face="Times New Roman" size=3>There are four important bases of classification of statistical data: (1) qualitative, (2) quantitative, (3) chronological, and (4) geographical, each of which will be examined in turn.</FONT></P>
<P><FONT face="Times New Roman" size=3>Qualitative   When, for example, employees are classified as union or non—union, we have a qualitative differentiation. The distinction is one of kind rather than of amount. Individuals may be classified concerning marital status, as single, married, widowed, divorced, and separated. Farm operators may be classified as full owners, part owners, managers, and tenants. Natural rubber may be designated as plantation or wild according to its source.</FONT></P>
<P><FONT face="Times New Roman" size=3>Quantitative   When items vary in respect to some measurable characteristics, a quantitative classification is appropriate. Families may be classified according to the number of children. Manufacturing concerns may be classified according to the number of workers employed, and also according to the values of goods produced. Individuals may be classified according to the amount of income tax paid.</FONT></P>
<P><FONT face="Times New Roman" size=3>Chronological   Chronological data or time series show figures concerning a particular phenomenon at various specified times. For example, the closing price of a certain stock may be shown for each day over a period of months of years; the birth rate in the United States may be listed for each of a number of years; production of coal may be shown monthly for a span of years. The analysis of time series, involving a consideration of trend, cyclical period (seasonal ), and irregular movements, will be discussed.</FONT></P>
<P><FONT face="Times New Roman" size=3>In a certain sense, time series are somewhat akin to quantitative distributions in that each succeeding year or month of a series is one year or one month further removed from some earlier point of reference. However, periods of time—or, rather, the events occurring within these periods—differ qualitatively from each other also. The essential arrangement of the figures in a time sequence is inherent in the nature of the data under consideration.</FONT></P>
<P><FONT face="Times New Roman" size=3>Geographical   The geographical distribution is essentially a type of qualitative distribution, but is generally considered as a distinct classification. When the population is shown for each of the states in the United States, we have data which are classified geographically. Although there is a qualitative difference between any two states, the distinction that is being made is not so much of kind as of location.</FONT></P>
<P><FONT face="Times New Roman" size=3>The presentation of classified data in tabular and graphic form is but one elementary step in the analysis of statistical data. Many other processes are described in the following passages of this book. Statistical investigation frequently endeavors to ascertain what is typical in a given situation. Hence all type of occurrences must be considered, both the usual and the unusual.</FONT></P>
<P><FONT face="Times New Roman" size=3>In forming an opinion, most individuals are apt to be unduly influenced by unusual occurrences and to disregard the ordinary happenings. In any sort or investigation, statistical or otherwise, the unusual cases must not exert undue influence. Many people are of the opinion that to break a mirror brings bad luck. Having broken a mirror, a person is apt to be on the lookout for the unexpected”bad luck “ and to attribute any untoward event to the breaking of the mirror. If nothing happens after the mirror has been broken, there is nothing to remember and this result (perhaps the usual result )is disregarded. If bad luck occurs, it is so unusual that it is remembered, and consequently the belief is reinforced. The scienticfic procedure would include all happenings following the breaking of the mirror, and would compare the “resulting” bad luck to the amount of bad luck occurring when a mirror has not been broken.</FONT></P>
<P><FONT face="Times New Roman" size=3>Statistics, then, must include in its analysis all sorts of happenings. If we are studying the duration of cases of pncumonia, we may study what is typical by determining the average length and possibly also the divergence below and above the average. When considering a time series showing steel—mill activity, we may give attention to the typical seasonal pattern of the series, to the growth factor( trend) present, and to the cyclical behaviour. Sometimes it is found that two sets of statistical data tend to be associated.</FONT></P>
<P><FONT face="Times New Roman" size=3>Occasionlly a statistical investigation may be exhaustive and include all possible occurrences. More frequently, however, it is necessary to study a small group or sample. If we desire to study the expenditures of lawyers for life insurance, it would hardly be possible to include all lawyers in the United States. Resort must be had to a sample;and it is essential that the sample be as nearly representative as possible of the entire group, so that we may be able to make a reasonable inference as to the results to be expected for an entire population. The problem of selecting a sample is discussed in the following chapter.</FONT></P>
<P><FONT face="Times New Roman" size=3>Sometimes the statistician is faced with the task of forecasting. He may be required to prognosticate the sales of automobile tires a year hence, or to forecast the population some years in advance. Several years ago a student appeared in summer session class of one of the writers. In a private talk he announced that he had come to the course for a single purpose: to get a formula which would enable him to forecast the price of cotton. It was important to him and his employers to have some advance information on cotton prices, since the concern purchased enormous quantities of cotton. Regrettably, the young man had to be disillusioned. To our knowledge, there are no magic formulae for forecasting. This does not mean that forecasting is impossible; rather it means that forecasting is a complicated process of which a formula is but a small part. And forecasting is uncertain and dangerous. To attempt to say what will happen in the future requires a thorough grasp of the subject to be forecast, up-to-the-minute knowledge of developments in allied fields, and recognition of the limitations of any mechanica forecasting device.</FONT></P>
<P><FONT face="Times New Roman" size=3>INTERPRETATION   The final step in an investigation consists of interpreting the data which have been obtained. What are the conclusions growing out of the analysis? What do the figures tell us that is new or that reinforces or casts doubt upon previous hypotheses? The results must be interpreted in the light of the limitations of the original material. Too exact conclusions must not be drawn from data which themselves are but approximations. It is essential, however, that the investigator discover and clarify all the useful and applicable meaning which is present in his data.</FONT></P>
<P><FONT size=3><FONT face="Times New Roman">

</FONT></FONT>
<p>
<P><FONT size=3><FONT face="Times New Roman">
<p></FONT></FONT>
<p>
页: 1 2 [3] 4 5 6 7 8 9 10 11 12
查看完整版本: 数学专业英语[1]-The Real Number System