Definition:Linearly Independent/Set

From ProofWiki
Jump to navigation Jump to search


This article is complete as far as it goes, but it could do with expansion.
In particular: Make a separate definition for Vector Space
You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by adding this information.
To discuss this page in more detail, feel free to use the talk page.
When this work has been completed, you may remove this instance of {{Expand}} from the code.
If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page.


Definition

Let $G$ be an abelian group whose identity is $e$.

Let $R$ be a ring with unity whose zero is $0_R$ and whose unity is $1_R$.


Let $\struct {G, +_G, \circ}_R$ be a unitary $R$-module.


Let $S \subseteq G$.


Then $S$ is a linearly independent set (over $R$) if and only if every finite sequence of distinct terms in $S$ is a linearly independent sequence.

That is, such that:

$\ds \forall \sequence {\lambda_n} \subseteq R: \sum_{k \mathop = 1}^n \lambda_k \circ a_k = e \implies \lambda_1 = \lambda_2 = \cdots = \lambda_n = 0_R$

where $a_1, a_2, \ldots, a_k$ are distinct elements of $S$.


Linearly Independent Set on a Real Vector Space

Let $\struct {\R^n, +, \cdot}_\R$ be a real vector space.

Let $S \subseteq \R^n$.


Then $S$ is a linearly independent set of real vectors if and only if every finite sequence of distinct terms in $S$ is a linearly independent sequence.

That is, such that:

$\ds \forall \set {\lambda_k: 1 \le k \le n} \subseteq \R: \sum_{k \mathop = 1}^n \lambda_k \mathbf v_k = \mathbf 0 \implies \lambda_1 = \lambda_2 = \cdots = \lambda_n = 0$

where $\mathbf v_1, \mathbf v_2, \ldots, \mathbf v_n$ are distinct elements of $S$.


Linearly Independent Set on a Complex Vector Space

Let $\struct {\C^n, +, \cdot}_\C$ be a complex vector space.

Let $S \subseteq \C^n$.


Then $S$ is a linearly independent set of complex vectors if and only if every finite sequence of distinct terms in $S$ is a linearly independent sequence.

That is, such that:

$\ds \forall \set {\lambda_k: 1 \le k \le n} \subseteq \C: \sum_{k \mathop = 1}^n \lambda_k \mathbf v_k = \mathbf 0 \implies \lambda_1 = \lambda_2 = \cdots = \lambda_n = 0$

where $\mathbf v_1, \mathbf v_2, \ldots, \mathbf v_n$ are distinct elements of $S$.


Also see


Sources

Retrieved from "https://proofwiki.org/w/index.php?title=Definition:Linearly_Independent/Set&oldid=696104"