Formal linear combination

In many areas of mathematics, especially in Algebra and its applications, such as Complex Analysis and Topology, it is often helpful to consider "linear combinations" of elements of a set that does not have a module structure. In this article, we aim to briefly explain how these linear combinations can be mathematically represented as actual linear combinations.

Let be a set and a ring (in many classical cases, is a field or the ring of integers).

Classical Definition

edit

A formal linear combination of elements from   over   is a sum of the form  , where   and  , with the   being pairwise distinct. Two sums of this form are considered equal if the same elements of   appear with the same coefficients (with a coefficient of   meaning that the element does not appear). The set of these sums forms, with the operations

  •   (any two such sums can be written so that they contain the same elements of  ; if necessary, terms of the form   with   can be added), with  ,  ,  ,
  •   with  ,  ,  ,

a natural  -module (in the case of a field, this is a vector space; in the case of integers, an abelian group). This  -module is also called the free  -module over  .


The definition is somewhat unsatisfactory in that the elements of the free  -module are undefined sums  ; note that we can only define the operations once we have the elements, but we need the operations to describe the elements. One could argue that the sums are merely "formal," but this is mathematically unsatisfactory since it is unclear what a formal sum actually is. The main idea of the precise definition is to assign the formal sums an exact meaning.

Preliminary Considerations for the Exact Definition

edit

How can we assign the sum   a mathematically precise object with the same meaning? The idea is to think about what we actually need from the sums. These are the pairs  . Remembering that the   were pairwise distinct, we see that we are dealing with a map  . Extending this map to all of   by assigning   to other elements gives us a map   with the property that its so-called support  , i.e., the set of elements not mapped to zero, is finite. Conversely, if   is a map with finite support  , we can assign it the formal sum  . One can see that these constructions are inverses of each other, so formal sums correspond exactly to maps with finite support. We can thus define:

Definition

edit

A formal linear combination of elements from   over   is a map   with

 

The set of all such maps is denoted by   and is an  -submodule of  . It is called the free  -module over  .

Notation

edit

Let  . Since sums are more convenient to work with than maps (as the sum compactly encodes all the information), we want to write   as a sum. For  , consider the map  , which maps   to   and   to  . If   is a listing of the support of   with pairwise distinct  , then   (note that this is an actual sum in the  -module   with pointwise operations). The notation is often further simplified by identifying the elements   with the map  , so   is simply called  . Then  , allowing us to work with convenient sums while ensuring that everything rests on a solid mathematical foundation.

Translation and Version Control

edit

This page was translated based on the following [https://de.wikiversity.org/wiki/Kurs:Funktionentheorie/Formale Linearkombination Wikiversity source page] and uses the concept of Translation and Version Control for a transparent language fork in a Wikiversity:

https://de.wikiversity.org/wiki/Formale Linearkombination

  • Date: 12/17/2024