Formal linear combination
From Maths
Stub grade: B
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:
Needs fleshing out?
Contents
[hide]Definition
Let S be a set and let F be a field[Note 1], then[1]:
- Informally[Note 2] a formal linear combination is an expression of the form:
- λ1s1+λ2s2+⋯+λm−1sm−1+λmsm=m∑i=1λisi
- for some m∈N, some λi∈F and some si∈S
- We never actually define λs (the multiplication of s∈S by a λ∈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: (λ1s1+λ2s2)+(μ1s1+μ2s3+μ3s4)=αs1+λ2s2+μ2s3+μ3s4 say, where α:=λ1+μ1 - which is defined as λi,μj∈F remember. And
- For example: μ(λ1s1+⋯+λnsn)=α1s1+⋯+αnsn where αi:=μλi - which is defined as λi,μ∈F of course.
- Even though we can never give it a value
- λ1s1+λ2s2+⋯+λm−1sm−1+λmsm=m∑i=1λisi
- Formally, a formal linear combination of elements of S with respect to the field F is a function[1]:
- f:S→F such that |{s∈S | f(s)≠0}|∈NWarning:[Note 3], [Note 4] (where |⋅| denotes cardinality)
- That is to say f takes non-zero values a finite number of times only, it is zero "almost everywhere"
- f represents ∑s∈Sf(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 ∑s∈Sf(s)s means ∑s∈Sf(s)≠0f(s)s, hence the requirement that f only maps finitely many things to non-zero things.
- f:S→F such that |{s∈S | f(s)≠0}|∈NWarning:[Note 3], [Note 4] (where |⋅| denotes cardinality)
See also
- Free vector space generated by - for which this is a precursor. The vector space of all formal linear combinations.
Notes
- 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 |{f(s)≠0 | s∈S}|∈N is different to |{s∈S | f(s)≠0}|∈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:N→N given by f:n↦{0if n is odd1otherwise then |{f(n)≠0 | n∈N}|∈N indeed holds, as |{1}|=1 however |{n∈N | f(n)≠0}|∈N doesn't hold as the set of even numbers is not finite.
- Jump up ↑ Zero here denotes the "additive identity" of the field, F