Linear Algebra - Function (Set)

Card Puncher Data Processing

Definition

For each input element in a set <math>A</math> , a function assigns a single output element from another set <math>B</math> .

  • <math>A</math> is called the domain of the function
  • <math>B</math> is called the co-domain

!!!!!! Same as Set Theory - Function (Mathematical) !!!!!!

Syntax

<math>f(A) = B</math>

or in Mathese:

<math>f : A \rightarrow B</math>

Example

  • The function that doubles its input:
f({1, 2, 3,...}) = {(1,2),(2,4),(3,6),(4,8),....}

  • The function that multiplies the numbers forming its input:
f({1, 2, 3,...}x{1, 2, 3,...}) = {((1,1),2),((1,2),4),...,((2,2),4),(2,3),6), ....}

  • Caesar’s Cryptosystem

Function Domain Codomain Caesar Crypto

Each letter is mapped to one three places ahead, wrapping around, so MATRIX would map to PDWULA. The function mapping letter to letter can be written as:

{('A','D'),('B','E'),('C','F'),('D','G'),...,('W','Z'),('X','A'),('Y','B'),('Z','C')} 

Both the domain and the co-domain are {A,B, …,Z}

Image

for a function <math>f : V \mapsto W</math> , the image of f is the set of all images of elements of the domain: <MATH> {f (v) : v \in V} </MATH>

The image of a function is the set of all images of inputs. Mathese:

lm f

The output of a given input is called the image of that input. The image of A under the function f is denoted f(A).

There might be elements of the co-domain that are not images of any elements of the domain.

Example
A function f : {1, 2, 3, 4} −> {'A','B','C','D','E'}
The image of f is lm f = {'A','B','C','E'}
'D' is in the co-domain but not in the image
Domain Codomain Image

Set

Set of functions: For sets F and D, <math>F^D</math> denotes all functions from D to F.

For finite sets, the cardinality <math>|F^D| = |F|^{|D|}</math>

Function

Identity

Function - Identity

Composition

Linear Algebra - Function composition

Inverse

Functions f and g are functional inverses if f circ g and g circ f are defined and are identity functions.

Invertible

A function that has an inverse is invertible.

Invertible functions are:

Function Invertibility Theorem: A function f is invertible if and only if it is one-to-one and onto.

Linear-Function Invertibility Theorem: A function <math>f: V \mapsto W</math> is invertible iff

  • <math>\text{dim Ker f = 0 and dim lm f = dim W }</math>
  • <math>\text{dim Ker f = 0 and dim V = dim W }</math> (For f to be invertible, need dim V = dim W)

Extracting an invertible function:

Let <math>A = \begin{bmatrix} \begin{array}{r|r|r} 1 & 2 & 1 \\ 2 & 1 & 1 \\ 1 & 2 & 1 \\ \end{array} \end{bmatrix} </math> and define <math>f : \mathbb{R}^3 \mapsto \mathbb{R}^3</math> by <math>f (x) = Ax</math>

Define <math>W^* = lm f = Col A = Span \{[1, 2, 1], [2, 1, 2], [1, 1, 1]\}</math>

One basis for <math>W^*</math> is:

  • <math>w_1 = [0, 1, 0]</math> ,
  • <math>w_2 = [1, 0, 1]</math>

Pre-images for <math>w_1</math> and <math>w_2</math> :

  • <math>v_1 = [\frac{1}{2},−\frac{1}{2},\frac{1}{2}]</math>
  • and <math>v_2 = [−\frac{1}{2},\frac{1}{2},\frac{1}{2}]</math>

for then <math>A.v_1 = w_1</math> and <math>A.v_2 = w_2</math>

Let <math>V^* = Span \{v_1, v_2\}</math> Then <math>f : V^* \mapsto lm f </math> is onto and one-to-one and therefore invertible.

Linear

Linear Algebra - Linear Function (Weighted sum)

Relationship

One-to-one

Function Not One To One

<math>f : V \rightarrow W</math> is one-to-one if f (x) = f (y) implies x = y

One-to-One Lemma: A linear function is one-to-one if and only if its kernel is a trivial vector space. Equivalent: if its kernel has dimension zero.

f is one-to-one iff <math>\href{dimension}{dim} \text{ } \href{#kernel}{Ker} \text{ } f = 0</math>

Onto

Function Not Onto

<math>f : V \rightarrow W</math> is onto if for every <math>z \in F</math> there exists an a such that <math>f(a) = z</math>

f is onto if its image equals its co-domain

For any linear function <math>f : V \mapsto W</math> , f is onto if <math>\href{dimension}{dim} \text{ } \href{#image}{lm} f = \href{dimension}{dim} \text{ } W</math>





Discover More
Model Funny
(Function | Operator | Map | Mapping | Transformation | Method | Rule | Task | Subroutine)

Section computable function. A function is a callable unit that may be called: a procedure, a subrontine a routine, a method (belong to an objectmacrocomputablalgorithreusable blocargumentdevelopment...
Model Funny
(Function|Operator) - Associative Property

An operator or functionop is associative if the following holds: The importance of this to parallel evaluation can be seen if we expand this to four terms: So we can evaluate (a op b) in parallel...
Analytics Functions Snapshot
Analytic (Data Analyst)

A Data Analyst sees what data he has. A Data Scientist imagines what data he is lacking. Information analysis provides insight into : the past the present and the future of the business. See...
Identity Function
Function - Identity

An identity function is an algebraic law that defines when the output of the function is equal to the input. identity function. For any domain D: each domain element d map to itself: Addition...
Card Puncher Data Processing
Linear Algebra - Basis of a Vector Space

A basis for vector space V is a linearly independent set of generators for V. Thus a set S of vectors of V is a basis for V if S satisfies two properties: Property B1 (Spanning) Span S = V, and Property...
Card Puncher Data Processing
Linear Algebra - Dimension of a vector space

The dimension of a vector space V is the size of a basis for that vector space written: dim V. rank If U is a subspace of W then D1: (or ) and D2: if then Example: Suppose V = Span...
Function Composition
Linear Algebra - Function composition

Functions + and the functional composition of f and g is the function: defined by: Example is the Caesar cypher Associativity of function composition:...
Card Puncher Data Processing
Linear Algebra - Linear Function (Weighted sum)

f is a linear function if she is defined by where: M is an R x C matrix and A Linear function can be expressed as a matrix-vector product: If a function can be expressed as a matrix-vector product...
Linear Binary Block Code
Linear Algebra - Linear binary code

In a linear binary code, the set C of codewords is a vector space over GF(2). In such a code, there is a matrix H, called the check matrix, such that C is the null space of H. When the Receiver receives...
Card Puncher Data Processing
Linear Algebra - Matrix

The Traditional notion of a matrix is: a two-dimensional array a rectangular table of known or unknown numbers One simple role for a matrix: packing together a bunch of columns or rows Matrix...



Share this page:
Follow us:
Task Runner