線形代数において、ランク・ヌル性定理は、有限次元ベクトル空間間の任意の線形写像[latex]T: V to W[/latex]について、その定義域[latex]V[/latex]の次元は、ランク(像の次元)とヌル性(核の次元)の和に等しいことを述べている。式は[latex]dim(V) = text{rank}(T) + text{nullity}(T)[/latex]である。

(画像はイメージです)
線形代数において、ランク・ヌル性定理は、有限次元ベクトル空間間の任意の線形写像[latex]T: V to W[/latex]について、その定義域[latex]V[/latex]の次元は、ランク(像の次元)とヌル性(核の次元)の和に等しいことを述べている。式は[latex]dim(V) = text{rank}(T) + text{nullity}(T)[/latex]である。
The rank-nullity theorem provides a fundamental relationship between the dimensions of the key subspaces associated with a linear transformation. Let [latex]T: V to W[/latex] be a linear map. The kernel of T, denoted [latex]ker(T)[/latex], is the set of vectors in [latex]V[/latex] that are mapped to the zero vector in [latex]W[/latex]. The dimension of the kernel is called the nullity of T. The image of T, denoted [latex]text{im}(T)[/latex], is the set of all vectors in [latex]W[/latex] that are the output of T for some input vector from [latex]V[/latex]. The dimension of the image is the rank of T.
The theorem states [latex]dim(text{domain}(T)) = dim(ker(T)) + dim(text{im}(T))[/latex]. A common proof strategy involves constructing a basis. First, find a basis for the kernel, say [latex]{u_1, dots, u_k}[/latex], where [latex]k = text{nullity}(T)[/latex]. Since the kernel is a subspace of [latex]V[/latex], this basis can be extended to a basis for all of [latex]V[/latex]: [latex]{u_1, dots, u_k, v_1, dots, v_r}[/latex]. The dimension of [latex]V[/latex] is thus [latex]k+r[/latex]. The final step is to show that the set [latex]{T(v_1), dots, T(v_r)}[/latex] forms a basis for the image of T. This proves that the rank is [latex]r[/latex], and therefore [latex]dim(V) = k+r = text{nullity}(T) + text{rank}(T)[/latex].
For matrices, if [latex]A[/latex] is an [latex]m times n[/latex] matrix, it represents a linear map from [latex]mathbb{R}^n[/latex] to [latex]mathbb{R}^m[/latex]. The domain’s dimension is [latex]n[/latex]. The rank of [latex]A[/latex] is the dimension of its column space, and its nullity is the dimension of its null space. The theorem becomes [latex]n = text{rank}(A) + text{nullity}(A)[/latex].
The theorem is a core component of what is sometimes called the fundamental theorem of linear algebra, which provides a comprehensive description of the structure of the four fundamental subspaces associated with an [latex]m times n[/latex] matrix [latex]A[/latex]: the column space, the null space, the row space, and the left null space. It beautifully illustrates the trade-off that as the set of solutions to [latex]Ax=0[/latex] (the null space) grows larger, the set of possible outputs [latex]Ax[/latex] (the column space) must become smaller, with their dimensions summing to the total dimension of the input space.
ボットによるトラフィック(現在1日あたり4万件以上)を排除するため、このコンテンツはコミュニティメンバー限定となっています。
> ログイン < または > 登録 < (100%無料)でこれにアクセスできます。他のすべての制限付きコンテンツとツールも同様です。
ランク・ヌルティ定理
(日付が不明または関連性がない場合、例えば「流体力学」などでは、その注目すべき出現時期の概算値が提示されます。)
フルサイズの画像とダウンロードは、登録会員のみが100%無料で利用できます。
> ログイン <