Free vector space generated by
From Maths
Stub grade: A
This page is a stub
This page is a stub, so it contains little or minimal information and is on a to-do list for being expanded.The message provided is:
Review and demote
Contents
[hide]Definition
Let S be a set and let F be a field. The "free vector space over F generated by S", denoted FF(S)[Note 1] or F(S;F)[Note 1] is defined as follows[1]:\newcommand{\freevec}[2][\mathbb{F}]{\mathcal{F}(#2;#1)}
- \freevec{S} is the set of all formal linear combinations of elements of S
- \freevec{S} is a vector space under the operations of pointwise addition and the obvious scalar multiplication as follows:
- Addition: let f,g\in\freevec{S} then (f+g):S\rightarrow\mathbb{F} is given by (f+g):s\mapsto f(s)+g(s)
- This addition is defined as both f(s),g(s)\in\mathbb{F} and a field has addition
- Scalar multiplication: let \lambda\in\mathbb{F} and f\in\freevec{S} be given, then we define (\lambda f):S\rightarrow\mathbb{F} by (\lambda f):s\mapsto \lambda f(s)
- Again, \lambda,f(s)\in\mathbb{F} and as \mathbb{F} is a field, this notion of multiplication is defined.
- Addition: let f,g\in\freevec{S} then (f+g):S\rightarrow\mathbb{F} is given by (f+g):s\mapsto f(s)+g(s)
Formal linear combinations
Let S be a set and let \mathbb{F} be a field[Note 2], then[1]:
- Informally[Note 3] a formal linear combination is an expression of the form:
- \lambda_1 s_1 + \lambda_2 s_2 + \cdots + \lambda_{m-1} s_{m-1} + \lambda_m s _m\eq \sum^m_{i\eq 1}\lambda_i s_i
- for some m\in\mathbb{N} , some \lambda_i\in\mathbb{F} and some s_i\in S
- We never actually define \lambda s (the multiplication of s\in S by a \lambda\in\mathbb{F} ) nor do we define any sort of "addition" operation, this is simply an expression.
- We want it to behave as a linear combination normally would, i.e.:
- For example: \big(\lambda_1 s_1+\lambda_2 s_2\big)+\big(\mu_1 s_1 + \mu_2 s_3 + \mu_3 s_4\big)\eq \alpha s_1 + \lambda_2 s_2 + \mu_2 s_3 + \mu_3 s_4 say, where \alpha:\eq \lambda_1 + \mu_1 - which is defined as \lambda_i,\mu_j\in\mathbb{F} remember. And
- For example: \mu(\lambda_1 s_1 + \cdots + \lambda_n s_n)\eq \alpha_1 s_ 1 + \cdots + \alpha_n s_n where \alpha_i:\eq \mu\lambda_i - which is defined as \lambda_i,\mu\in\mathbb{F} of course.
- Even though we can never give it a value
- \lambda_1 s_1 + \lambda_2 s_2 + \cdots + \lambda_{m-1} s_{m-1} + \lambda_m s _m\eq \sum^m_{i\eq 1}\lambda_i s_i
- Formally, a formal linear combination of elements of S with respect to the field \mathbb{F} is a function[1]:
- f:S\rightarrow\mathbb{F} such that \big\vert\{s\in S\ \vert\ f(s)\neq 0\}\big\vert\in\mathbb{N} Warning:[Note 4], [Note 5] (where \big\vert\cdot\big\vert denotes cardinality)
- That is to say f takes non-zero values a finite number of times only, it is zero "almost everywhere"
- f represents \sum_{s\in S}f(s)s as a linear combination, even if the sum were formally defined to have meaning, we still use the usual abuse of notation when only finitely many elements of the summation are non-zero whereby \sum_{s\in S}f(s)s means \sum_{\begin{array}{cc}s\in S\\ f(s)\neq 0\end{array} }f(s)s, hence the requirement that f only maps finitely many things to non-zero things.
- f:S\rightarrow\mathbb{F} such that \big\vert\{s\in S\ \vert\ f(s)\neq 0\}\big\vert\in\mathbb{N} Warning:[Note 4], [Note 5] (where \big\vert\cdot\big\vert denotes cardinality)
Characteristic property
Characteristic property of the free vector space/Statement
Notes
- ↑ Jump up to: 1.0 1.1 From Books:Introduction to Smooth Manifolds - John M. Lee's notation \mathcal{F}(S) for the free vec space over \mathbb{R} , we don't specify the field though, so both of these are sensible notations
- Jump up ↑ We could probably step back and define this the same way on a ring, as a field is itself a ring it'd be the same thing. Modules are very similar to vec spaces after all
- Jump up ↑ Ignore the "informally a formal ..."
- Jump up ↑ Caveat:Be aware that \big\vert\{f(s)\neq 0\ \vert\ s\in S\}\big\vert\in\mathbb{N} is different to \big\vert\{s\in S\ \vert\ f(s)\neq 0\}\big\vert\in\mathbb{N} as the first set is the number of non-zero things the function maps to not the number of things that map to non-zero things. For example:
- if we take the function f:\mathbb{N}\rightarrow\mathbb{N} given by f:n\mapsto\left\{\begin{array}{lr}0 & \text{if }n\text{ is odd}\\ 1 & \text{otherwise}\end{array}\right. then \big\vert\{f(n)\neq 0\ \vert\ n\in \mathbb{N}\}\big\vert\in\mathbb{N} indeed holds, as \vert\{1\}\vert\eq 1 however \big\vert\{n\in \mathbb{N}\ \vert\ f(n)\neq 0\}\big\vert\in\mathbb{N} doesn't hold as the set of even numbers is not finite.
- Jump up ↑ Zero here denotes the "additive identity" of the field, \mathbb{F}