|
|
| Line 1: |
Line 1: |
| {{Refimprove|date=September 2013}}
| | Have we ever heard that someone said "My computer is getting slower, Assist me?" Are you seeking ways on how do I accelerate my computer? Are we tired of wasting too much time considering the loading procedure is truly slow? If you like to recognize how to boost and speed up computer performance, then this article might enable show you certain concepts plus strategies "What is the cause?" plus How to prevent your computer getting slower?<br><br>Install an anti-virus software. If you already have which on you computer then carry out a full program scan. If it finds any viruses found on the computer, delete those. Viruses invade the computer and create it slower. To protect the computer from different viruses, it happens to be better to keep the anti-virus software running when you use the internet. You may additionally fix the security settings of the internet browser. It might block unknown plus risky websites and block off any spyware or malware struggling to receive into a computer.<br><br>Naturally, the next logical step is to get these false entries cleaned out. Fortunately, this really is not a difficult task. It is the 2nd thing you should do when you noticed the computer has lost speed. The first is to make sure there are no viruses or severe spyware present.<br><br>The problem with most of the persons is the fact that they do not like to invest money. In the damaged version one refuses to have to pay anything plus can download it from web easily. It is simple to install as well. But, the issue comes whenever it is unable to detect all possible viruses, spyware and malware inside the system. This is because it is obsolete in nature plus does not receive any regular updates from the site downloaded. Thus, a program is accessible to problems like hacking.<br><br>In a word, to accelerate windows XP, Vista business, it's very significant to disable certain business items plus clean and optimize the registry. We can follow the procedures above to disable unwanted programs. To optimize the registry, I suggest you utilize a [http://bestregistrycleanerfix.com/tune-up-utilities tuneup utilities] software. Because it is truly risky for you to edit the registry by oneself.<br><br>2)Fix your Windows registry to accelerate PC- The registry is a complex section of the computer that holds different kinds of data within the elements we do on your computer each day. Coincidentally, over time the registry may become cluttered with info and/or may obtain some sort of virus. This is truly important and you MUST get this issue fixed right away, otherwise you run the risk of your computer being permanently damage and/or the sensitive information (passwords, etc.) is stolen.<br><br>When the registry is corrupt or full of errors, the signs is felt by the computer owner. The slow performance, the frequent program crashes plus the nightmare of all computer owners, the blue screen of death.<br><br>A system and registry cleaner may be downloaded from the web. It's user friendly plus the process does not take lengthy. All it does is scan and then whenever it finds errors, it may fix and clean those errors. An error free registry may safeguard the computer from mistakes plus give you a slow PC fix. |
| | |
| {{redirect|Rank theorem|the rank theorem of multivariable calculus|constant rank theorem}}
| |
| In [[mathematics]], the '''rank–nullity theorem''' of [[linear algebra]], in its simplest form, states that the [[rank (matrix theory)|rank]] and the [[kernel (matrix)|nullity]] of a matrix add up to the number of columns of the matrix. Specifically, if ''A'' is an ''n''-by-''n'' matrix (with ''n'' rows and ''n'' columns) over some [[field (mathematics)|field]], then
| |
| | |
| <math>\text{rk}(A) + \text{nul}(A) = \text{n}.</math>.<ref>{{harvtxt|Meyer|2000}}, page 199.</ref> | |
| | |
| This applies to [[linear map]]s as well. Let ''V'' and ''W'' be [[vector space]]s over some field and let ''T'' : ''V'' → ''W'' be a linear map. Then the rank of ''T'' is the [[dimension (vector space)|dimension]] of the image of ''T'' and the nullity of ''T'' is the dimension of the [[kernel (algebra)|kernel]] of ''T'', so we have
| |
| | |
| <math>\text{dim}(\text{im} (T)) + \text{dim} (\text{ker} (T)) = \text{dim} (V).</math>
| |
| | |
| or, equivalently, | |
| | |
| <math>\text{rk}(T) + \text{nul}(T) = \text{dim}(V).</math> | |
| | |
| One can refine this statement (via the [[splitting lemma]] or the below proof) to be a statement about an [[isomorphism]] of spaces, not just dimensions.
| |
| | |
| More generally, one can consider the image, kernel, coimage, and cokernel, which are related by the [[fundamental theorem of linear algebra]].
| |
| | |
| == Proofs ==
| |
| We give two proofs. The first proof uses notations for linear transformations, but can be easily adapted to matrices by writing ''T''('''x''') = '''Ax''', where '''A''' is ''m'' × ''n''. The second proof looks at the homogeneous system '''Ax''' = '''0''' associated with an ''m'' × ''n'' matrix '''A''' of [[rank (linear algebra)|rank]] ''r'' and shows explicitly that there exist a set of ''n'' − ''r'' [[linearly independent]] solutions that span the null space of '''A'''.
| |
| | |
| '''First proof:''' Suppose <math>\{\mathbf{u}_1, \ldots, \mathbf{u}_m\}</math> forms a basis of ''ker T''. We can extend this to form a basis of ''V'': <math> \{\mathbf{u}_1, \ldots, \mathbf{u}_m, \mathbf{w}_1, \ldots, \mathbf{w}_n\}</math>. Since the dimension of ker ''T'' is ''m'' and the dimension of ''V'' is ''m+n'', it suffices to show that the dimension of ''image T'' is ''n''.
| |
| | |
| Let us see that <math>\{T\mathbf{w}_1, \ldots, T\mathbf{w}_n \}</math> is a basis of ''image T''. Let ''v'' be an arbitrary vector in ''V''. There exist unique scalars such that:
| |
| | |
| : <math>\mathbf{v}=a_1 \mathbf{u}_1 + \cdots + a_m \mathbf{u}_m + b_1 \mathbf{w}_1 +\cdots + b_n \mathbf{w}_n</math>
| |
| : <math>\Rightarrow T\mathbf{v} = a_1 T\mathbf{u}_1 + \cdots + a_m T\mathbf{u}_m + b_1 T\mathbf{w}_1 +\cdots + b_n T\mathbf{w}_n</math>
| |
| : <math>\Rightarrow T\mathbf{v} = b_1 T\mathbf{w}_1 + \cdots + b_n T\mathbf{w}_n \; \; \because T\mathbf{u}_i = 0</math>
| |
| | |
| Thus, <math>\{T\mathbf{w}_1, \ldots, T\mathbf{w}_n \}</math> spans ''image T''. | |
| | |
| We only now need to show that this list is not redundant; that is, that <math>\{T\mathbf{w}_1, \ldots, T\mathbf{w}_n \}</math> are linearly independent. We can do this by showing that a linear combination of these vectors is zero if and only if the coefficient on each vector is zero. Let:
| |
| | |
| : <math>c_1 T\mathbf{w}_1 + \cdots + c_n T\mathbf{w}_n = 0 \Leftrightarrow T\{c_1 \mathbf{w}_1 + \cdots + c_n \mathbf{w}_n\}=0</math>
| |
| : <math>\therefore c_1 \mathbf{w}_1 + \cdots + c_n \mathbf{w}_n \in \operatorname{ker} \; T</math>
| |
| | |
| Then, since '''u'''<sub>''i''</sub> span ker ''T'', there exists a set of scalars ''d<sub>i</sub>'' such that:
| |
| | |
| : <math>c_1 \mathbf{w}_1 + \cdots + c_n \mathbf{w}_n = d_1 \mathbf{u}_1 + \cdots + d_m \mathbf{u}_m</math>
| |
| | |
| But, since <math>\{\mathbf{u}_1, \ldots, \mathbf{u}_m, \mathbf{w}_1, \ldots, \mathbf{w}_n\}</math> form a basis of ''V'', all ''c<sub>i</sub>'', ''d<sub>i</sub>'' must be zero. Therefore, <math>\{T\mathbf{w}_1, \ldots, T\mathbf{w}_n \}</math> is linearly independent and indeed a basis of ''image T''. This proves that the dimension of ''image T'' is ''n'', as desired.
| |
| | |
| In more abstract terms, the map ''T'': ''V'' → image ''T'' ''[[Split short exact sequence|splits]]''.
| |
| | |
| '''Second proof:''' Let '''A''' be an ''m'' × ''n'' matrix with ''r'' [[linearly independent]] columns (i.e. rank of '''A''' is ''r''). We will show that: (i) there exists a set of ''n'' − ''r'' linearly independent solutions to the homogeneous system '''Ax''' = '''0''', and (ii) that every other solution is a linear combination of these ''n'' − ''r'' solutions. In other words, we will produce an ''n'' × (''n'' − ''r'') matrix '''X''' whose columns form a [[basis (linear algebra)|basis]] of the null space of '''A'''.
| |
| | |
| Without loss of generality, assume that the first ''r'' columns of '''A''' are linearly independent. So, we can write '''A''' = ['''A'''<sub>1</sub>:'''A'''<sub>2</sub>], where '''A'''<sub>1</sub> is ''m'' × ''r'' with ''r'' linearly independent column vectors and '''A'''<sub>2</sub> is ''m'' × (''n'' − ''r''), each of whose ''n'' − ''r'' columns are linear combinations of the columns of '''A'''<sub>1</sub>. This means that '''A'''<sub>2</sub> = '''A'''<sub>1</sub> '''B''' for some ''r'' × (''n'' − ''r'') matrix '''B''' (see [[rank factorization]]) and, hence, '''A''' = ['''A'''<sub>1</sub>:'''A'''<sub>1</sub>'''B''']. Let <math>\displaystyle \mathbf{X} =
| |
| \begin{pmatrix}
| |
| -\mathbf{B} \\ | |
| \mathbf{I}_{n-r}
| |
| \end{pmatrix}
| |
| </math>, where <math>\mathbf{I}_{n-r}</math> is the (''n'' − ''r'') × (''n'' − ''r'') [[identity matrix]]. We note that '''X''' is an ''n'' × (''n'' − ''r'') matrix that satisfies
| |
| :<math>
| |
| \mathbf{A}\mathbf{X} = [\mathbf{A}_1:\mathbf{A}_1\mathbf{B}]\begin{pmatrix}
| |
| -\mathbf{B} \\
| |
| \mathbf{I}_{n-r}
| |
| \end{pmatrix} = -\mathbf{A}_1\mathbf{B} + \mathbf{A}_1\mathbf{B} = \mathbf{O}\; . </math>
| |
| Therefore, each of the ''n'' − ''r'' columns of '''X''' are particular solutions of '''Ax''' = '''0'''. Furthermore, the ''n'' − ''r'' columns of '''X''' are [[linearly independent]] because '''Xu''' = '''0''' will imply '''u''' = '''0''':
| |
| :<math> \mathbf{X}\mathbf{u} = \mathbf{0} \Rightarrow \begin{pmatrix}
| |
| -\mathbf{B} \\
| |
| \mathbf{I}_{n-r}
| |
| \end{pmatrix}\mathbf{u} = \mathbf{0} \Rightarrow \begin{pmatrix}
| |
| -\mathbf{B}\mathbf{u} \\
| |
| \mathbf{u}
| |
| \end{pmatrix} = \begin{pmatrix}
| |
| \mathbf{0} \\
| |
| \mathbf{0}
| |
| \end{pmatrix} \Rightarrow \mathbf{u} = \mathbf{0}\; .</math>
| |
| Therefore, the column vectors of '''X''' constitute a set of ''n'' − ''r'' linearly independent solutions for '''Ax''' = '''0'''.
| |
| | |
| We next prove that ''any'' solution of '''Ax''' = '''0''' must be a [[linear combination]] of the columns of '''X''' For this, let <math>\displaystyle \mathbf{u} = \begin{pmatrix}
| |
| \mathbf{u}_1 \\
| |
| \mathbf{u}_2
| |
| \end{pmatrix}</math>
| |
| be any vector such that '''Au''' = '''0'''. Note that since the columns of '''A'''<sub>1</sub> are linearly independent, '''A'''<sub>1</sub>'''x''' = '''0''' implies '''x''' = '''0'''. Therefore,
| |
| :<math>
| |
| \mathbf{A}\mathbf{u} = \mathbf{0} \Rightarrow [\mathbf{A}_1:\mathbf{A}_1\mathbf{B}]\begin{pmatrix}
| |
| \mathbf{u}_1 \\
| |
| \mathbf{u}_2
| |
| \end{pmatrix} = \mathbf{0} \Rightarrow \mathbf{A}_1(\mathbf{u}_1 + \mathbf{B}\mathbf{u}_2) = \mathbf{0}
| |
| \Rightarrow \mathbf{u}_1 + \mathbf{B}\mathbf{u}_2 = \mathbf{0} \Rightarrow \mathbf{u}_1 = -\mathbf{B}\mathbf{u}_2 </math>
| |
| : <math> \Rightarrow \mathbf{u} = \begin{pmatrix}
| |
| \mathbf{u}_1 \\
| |
| \mathbf{u}_2
| |
| \end{pmatrix} = \begin{pmatrix}
| |
| -\mathbf{B} \\
| |
| \mathbf{I}_{n-r}
| |
| \end{pmatrix}\mathbf{u}_2 = \mathbf{X}\mathbf{u}_2. </math>
| |
| This proves that any vector '''u''' that is a solution of '''Ax''' = '''0''' must be a linear combination of the ''n'' − ''r'' special solutions given by the columns of '''X'''. And we have already seen that the columns of '''X''' are linearly independent. Hence, the columns of '''X''' constitute a basis for the [[null space]] of '''A'''. Therefore, the [[kernel (matrix)|nullity]] of '''A''' is ''n'' − ''r''. Since ''r'' equals rank of '''A''', it follows that rank('''A''') + nullity('''A''') = ''n''. QED.
| |
| | |
| == Reformulations and generalizations ==
| |
| This theorem is a statement of the [[first isomorphism theorem]] of algebra to the case of vector spaces; it generalizes to the [[splitting lemma]]. | |
| | |
| In more modern language, the theorem can also be phrased as follows: if
| |
| :0 → ''U'' → ''V'' → ''R'' → 0
| |
| is a [[short exact sequence]] of vector spaces, then
| |
| :dim(''U'') + dim(''R'') = dim(''V'').
| |
| Here ''R'' plays the role of im ''T'' and ''U'' is ker ''T'', i.e.
| |
| : <math> 0 \rightarrow \ker T~\overset{Id}{\rightarrow}~V~\overset{T}{\rightarrow}~\operatorname{im} T \rightarrow 0</math>
| |
| | |
| In the finite-dimensional case, this formulation is susceptible to a generalization: if
| |
| :0 → ''V''<sub>1</sub> → ''V''<sub>2</sub> → ... → ''V''<sub>''r''</sub> → 0
| |
| is an [[exact sequence]] of finite-dimensional vector spaces, then | |
| :<math>\sum_{i=1}^r (-1)^i\dim(V_i) = 0.</math>{{Citation needed|date=September 2013}}
| |
| | |
| The rank–nullity theorem for finite-dimensional vector spaces may also be formulated in terms of the ''index'' of a linear map. The index of a linear map ''T'' : ''V'' → ''W'', where ''V'' and ''W'' are finite-dimensional, is defined by
| |
| | |
| :index ''T'' = dim(ker ''T'') − dim([[cokernel|coker]] ''T'').
| |
| | |
| Intuitively, dim(ker ''T'') is the number of independent solutions ''x'' of the equation ''Tx'' = 0, and dim(coker ''T'') is the number of independent restrictions that have to be put on ''y'' to make ''Tx'' = ''y'' solvable. The rank–nullity theorem for finite-dimensional vector spaces is equivalent to the statement
| |
| | |
| :index ''T'' = dim(''V'') − dim(''W'').
| |
| | |
| We see that we can easily read off the index of the linear map ''T'' from the involved spaces, without any need to analyze ''T'' in detail. This effect also occurs in a much deeper result: the [[Atiyah–Singer index theorem]] states that the index of certain differential operators can be read off the geometry of the involved spaces.
| |
| | |
| == Notes ==
| |
| <references/> | |
| | |
| == References ==
| |
| * {{Citation | last1=Meyer | first1=Carl D. | title=Matrix Analysis and Applied Linear Algebra | url=http://www.matrixanalysis.com/ | publisher=[[Society for Industrial and Applied Mathematics|SIAM]] | isbn=978-0-89871-454-8 | year=2000}}.
| |
| | |
| {{DEFAULTSORT:Rank-nullity theorem}}
| |
| [[Category:Theorems in linear algebra]]
| |
| [[Category:Isomorphism theorems]]
| |
| [[Category:Articles containing proofs]]
| |
Have we ever heard that someone said "My computer is getting slower, Assist me?" Are you seeking ways on how do I accelerate my computer? Are we tired of wasting too much time considering the loading procedure is truly slow? If you like to recognize how to boost and speed up computer performance, then this article might enable show you certain concepts plus strategies "What is the cause?" plus How to prevent your computer getting slower?
Install an anti-virus software. If you already have which on you computer then carry out a full program scan. If it finds any viruses found on the computer, delete those. Viruses invade the computer and create it slower. To protect the computer from different viruses, it happens to be better to keep the anti-virus software running when you use the internet. You may additionally fix the security settings of the internet browser. It might block unknown plus risky websites and block off any spyware or malware struggling to receive into a computer.
Naturally, the next logical step is to get these false entries cleaned out. Fortunately, this really is not a difficult task. It is the 2nd thing you should do when you noticed the computer has lost speed. The first is to make sure there are no viruses or severe spyware present.
The problem with most of the persons is the fact that they do not like to invest money. In the damaged version one refuses to have to pay anything plus can download it from web easily. It is simple to install as well. But, the issue comes whenever it is unable to detect all possible viruses, spyware and malware inside the system. This is because it is obsolete in nature plus does not receive any regular updates from the site downloaded. Thus, a program is accessible to problems like hacking.
In a word, to accelerate windows XP, Vista business, it's very significant to disable certain business items plus clean and optimize the registry. We can follow the procedures above to disable unwanted programs. To optimize the registry, I suggest you utilize a tuneup utilities software. Because it is truly risky for you to edit the registry by oneself.
2)Fix your Windows registry to accelerate PC- The registry is a complex section of the computer that holds different kinds of data within the elements we do on your computer each day. Coincidentally, over time the registry may become cluttered with info and/or may obtain some sort of virus. This is truly important and you MUST get this issue fixed right away, otherwise you run the risk of your computer being permanently damage and/or the sensitive information (passwords, etc.) is stolen.
When the registry is corrupt or full of errors, the signs is felt by the computer owner. The slow performance, the frequent program crashes plus the nightmare of all computer owners, the blue screen of death.
A system and registry cleaner may be downloaded from the web. It's user friendly plus the process does not take lengthy. All it does is scan and then whenever it finds errors, it may fix and clean those errors. An error free registry may safeguard the computer from mistakes plus give you a slow PC fix.