Skip to content
Hub Nexus

No author yetClaim it

Version 1Updated 2 min read

Support

Notation

ℝ, {ℝ}^{+}, {ℝ}^{n}real numbers, reals greater than 0, ordered n-tuples of reals
ℕnatural numbers: \{ 0 , 1 , 2 , … \}
ℂcomplex numbers
\{ … \ | \ … \}set of . . . such that . . .
( a \ .. \ b ), [ a \ .. \ b ]interval (open or closed) of reals between a and b
⟨ … ⟩sequence; like a set but order matters
V , W , Uvector spaces
\overset{→}{v} , \overset{→}{w}vectors
\overset{→}{0}, {\overset{→}{0}}_{V}zero vector, zero vector of V
B , Dbases
{ℰ}_{n} = ⟨ {\overset{→}{e}}_{1} , \ … , \ {\overset{→}{e}}_{n} ⟩standard basis for {ℝ}^{n}
\overset{→}{β} , \overset{→}{δ}basis vectors
{R e p}_{B} ( \overset{→}{v} )matrix representing the vector
{𝒫}_{n}set of n-th degree polynomials
{ℳ}_{n \ × \ m}set of n \ × \ m matrices
[ S ]span of the set S
M ⊕ Ndirect sum of subspaces
V ≅ Wisomorphic spaces
h , ghomomorphisms, linear maps
H , Gmatrices
t , stransformations; maps from a space to itself
T , Ssquare matrices
{R e p}_{B , D} ( h )matrix representing the map h
{h}_{i , j}matrix entry from row i, column j
| T |determinant of the matrix T
ℛ ( h ) , 𝒩 ( h )rangespace and nullspace of the map h
{ℛ}_{∞} ( h ) , {𝒩}_{∞} ( h )generalized rangespace and nullspace

Lower case Greek alphabet

\begin{matrix}\text{name} & \text{character} & \text{name} & \text{character} & \text{name} & \text{character} \\ \text{alpha} & α & \text{iota} & ι & \text{rho} & ρ \\ \text{beta} & β & \text{kappa} & κ & \text{sigma} & σ \\ \text{gamma} & γ & \text{lambda} & λ & \text{tau} & τ \\ \text{delta} & δ & \text{mu} & μ & \text{upsilon} & υ \\ \text{epsilon} & ϵ & \text{nu} & ν & \text{phi} & ϕ \\ \text{zeta} & ζ & \text{xi} & ξ & \text{chi} & χ \\ \text{eta} & η & \text{omicron} & o & \text{psi} & ψ \\ \text{theta} & θ & \text{pi} & π & \text{omega} & ω\end{matrix}

About the Cover.
This is Cramer's Rule for the system {x}_{1} + 2 {x}_{2} = 6, {}3 {x}_{1} + {x}_{2} = 8. The size of the first box is the determinant shown
(the absolute value of the size is the area). The size of the second box is {x}_{1} times that, and equals the size of the final box. Hence, {x}_{1} is the final determinant divided by the first determinant.

Where this page came from

This page was imported from Wikibooks. From “Linear Algebra” on Wikibooks, by its contributors, under CC BY-SA 4.0. Changed here: set as a page; navigation and edit links left out; each image under its own licence, credited in its caption.

Nobody has written it yet — it is the source material at a new address, which is why search engines are asked to skip it and why no one earns from it. It is up for grabs: take it on, and it is yours to rewrite and to earn from.

Comments

Spinner Logo

Next in Linear Algebra

CC BY-SA 4.0
This book helps students to master the material of a standard undergraduate linear algebra course. The material is standard in that the topics covered are Gaussian reduction, vector spaces, linear maps, determinants, and eigenvalues and eigenvectors. The audience is also standard: sophomores or juni
CC BY-SA 4.0
Systems of linear equations are common in science and mathematics. These two examples from high school science (O'Nan 1990) give a sense of how they arise. The first example is from Physics. Suppose that we are given three objects, one with a mass known to be 2 kg, and are asked to find the unknown
CC BY-SA 4.0
Definition 1.1 A **linear equation** in variables ${x}_{1} , {x}_{2} , … , {x}_{n}$ has the form ${a}_{1} {x}_{1} + {a}_{2} {x}_{2} + {a}_{3} {x}_{3} + ⋯ + {a}_{n} {x}_{n} = d$ where the numbers ${a}_{1} , … , {a}_{n} ∈ ℝ$ are the equation's **coefficients** and $d ∈ ℝ$ is the **constant**. An n-tup
CC BY-SA 4.0
A linear system with a unique solution has a solution set with one element. A linear system with no solution has a solution set that is empty. In these cases the solution set is easy to describe. Solution sets are a challenge to describe only when they contain many elements.
CC BY-SA 4.0
$\{ {{( \begin{matrix}0 \\ 4 \\ 0 \\ 0 \\ 0\end{matrix} )}_{⏟}}_{\begin{matrix} \\ \text{particular} \\ \text{solution}\end{matrix}} + {{w ( \begin{matrix}1 \\ − 1 \\ 3 \\ 1 \\ 0\end{matrix} ) + u ( \begin{matrix}1 / 2 \\ − 1 \\ 1 / 2 \\ 0 \\ 1\end{matrix} )}_{⏟}}_{\begin{matrix} \\ \text{unrestrict
CC BY-SA 4.0
This subsection is optional. Later material will not require the work here. ## Comparing Set Descriptions A set can be described in many different ways. Here are two different descriptions of a single set: $\{ ( \begin{matrix}1 \\ 2 \\ 3\end{matrix} ) z \ | \ z ∈ ℝ \} \ \text{and} \ \{ ( \begin{matr