Linear algebra in the context of Matrix multiplication

Algebra is a branch of mathematics that deals with abstract systems, known as algebraic structures, and the manipulation of expressions within those systems. It is a generalization of arithmetic that introduces variables and algebraic operations other than the standard arithmetic operations, such as addition and multiplication.

Elementary algebra is the main form of algebra taught in schools. It examines mathematical statements using variables for unspecified values and seeks to determine for which values the statements are true. To do so, it uses different methods of transforming equations to isolate variables. Linear algebra is a closely related field that investigates linear equations and combinations of them called systems of linear equations. It provides methods to find the values that solve all equations in the system at the same time, and to study the set of these solutions.

Tertiary education (also called higher education or post-secondary education) is the educational level following the completion of secondary education. The World Bank defines tertiary education as including universities, colleges, and vocational schools. Higher education is taken to include undergraduate and postgraduate education, while vocational education beyond secondary education is known as further education in the United Kingdom, or included under the category of continuing education in the United States.

Tertiary education generally culminates in the receipt of certificates, diplomas, or academic degrees. Higher education represents levels 5, 6, 7, and 8 of the 2011 version of the International Standard Classification of Education structure. Tertiary education at a nondegree level is sometimes referred to as further education or continuing education as distinct from higher education.

Mathematics emerged independently in China by the 11th century BCE. The Chinese independently developed a real number system that includes significantly large and negative numbers, more than one numeral system (binary and decimal), algebra, geometry, number theory and trigonometry.

Since the Han dynasty, as diophantine approximation being a prominent numerical method, the Chinese made substantial progress on polynomial evaluation. Algorithms like regula falsi and expressions like simple continued fractions are widely used and have been well-documented ever since. They deliberately find the principal nth root of positive numbers and the roots of equations. The major texts from the period, The Nine Chapters on the Mathematical Art and the Book on Numbers and Computation gave detailed processes for solving various mathematical problems in daily life. All procedures were computed using a counting board in both texts, and they included inverse elements as well as Euclidean divisions. The texts provide procedures similar to that of Gaussian elimination and Horner's method for linear algebra. The achievement of Chinese algebra reached a zenith in the 13th century during the Yuan dynasty with the development of tian yuan shu.

In linear algebra, a multilinear map is a function of several variables that is linear separately in each variable. More precisely, a multilinear map is a function

where ${\displaystyle V_{1},\ldots ,V_{n}}$ (${\displaystyle n\in \mathbb {Z} _{\geq 0}}$) and ${\displaystyle W}$ are vector spaces (or modules over a commutative ring), with the following property: for each ${\displaystyle i}$, if all of the variables but ${\displaystyle v_{i}}$ are held constant, then ${\displaystyle f(v_{1},\ldots ,v_{i},\ldots ,v_{n})}$ is a linear function of ${\displaystyle v_{i}}$. One way to visualize this is to imagine two orthogonal vectors; if one of these vectors is scaled by a factor of 2 while the other remains unchanged, the cross product likewise scales by a factor of two. If both are scaled by a factor of 2, the cross product scales by a factor of ${\displaystyle 2^{2}}$.

In mathematics, a linear combination or superposition is an expression constructed from a set of terms by multiplying each term by a constant and adding the results (e.g. a linear combination of x and y would be any expression of the form ax + by, where a and b are constants). The concept of linear combinations is central to linear algebra and related fields of mathematics. Most of this article deals with linear combinations in the context of a vector space over a field, with some generalizations given at the end of the article.

Differential geometry is a mathematical discipline that studies the geometry of smooth shapes and smooth spaces, otherwise known as smooth manifolds. It uses the techniques of vector calculus, linear algebra and multilinear algebra. The field has its origins in the study of spherical geometry as far back as antiquity. It also relates to astronomy, the geodesy of the Earth, and later the study of hyperbolic geometry by Lobachevsky. The simplest examples of smooth spaces are the plane and space curves and surfaces in the three-dimensional Euclidean space, and the study of these shapes formed the basis for development of modern differential geometry during the 18th and 19th centuries.

Since the late 19th century, differential geometry has grown into a field concerned more generally with geometric structures on differentiable manifolds. A geometric structure is one which defines some notion of size, distance, shape, volume, or other rigidifying structure. For example, in Riemannian geometry distances and angles are specified, in symplectic geometry volumes may be computed, in conformal geometry only angles are specified, and in gauge theory certain fields are given over the space. Differential geometry is closely related to, and is sometimes taken to include, differential topology, which concerns itself with properties of differentiable manifolds that do not rely on any additional geometric structure (see that article for more discussion on the distinction between the two subjects). Differential geometry is also related to the geometric aspects of the theory of differential equations, otherwise known as geometric analysis.

In projective geometry, a homography is an isomorphism of projective spaces, induced by an isomorphism of the vector spaces from which the projective spaces derive. It is a bijection that maps lines to lines, and thus a collineation. In general, some collineations are not homographies, but the fundamental theorem of projective geometry asserts that is not so in the case of real projective spaces of dimension at least two. Synonyms include projectivity, projective transformation, and projective collineation.

Historically, homographies (and projective spaces) have been introduced to study perspective and projections in Euclidean geometry, and the term homography, which, etymologically, roughly means "similar drawing", dates from this time. At the end of the 19th century, formal definitions of projective spaces were introduced, which extended Euclidean and affine spaces by the addition of new points called points at infinity. The term "projective transformation" originated in these abstract constructions. These constructions divide into two classes that have been shown to be equivalent. A projective space may be constructed as the set of the lines of a vector space over a given field (the above definition is based on this version); this construction facilitates the definition of projective coordinates and allows using the tools of linear algebra for the study of homographies. The alternative approach consists in defining the projective space through a set of axioms, which do not involve explicitly any field (incidence geometry, see also synthetic geometry); in this context, collineations are easier to define than homographies, and homographies are defined as specific collineations, thus called "projective collineations".

In linear algebra, linear transformations can be represented by matrices. If ${\displaystyle T}$ is a linear transformation mapping ${\displaystyle \mathbb {R} ^{n}}$ to ${\displaystyle \mathbb {R} ^{m}}$ and ${\displaystyle \mathbf {x} }$ is a column vector with ${\displaystyle n}$ entries, then there exists an ${\displaystyle m\times n}$ matrix ${\displaystyle A}$, called the transformation matrix of ${\displaystyle T}$, such that:$${\displaystyle T(\mathbf {x} )=A\mathbf {x} }$$Note that ${\displaystyle A}$ has ${\displaystyle m}$ rows and ${\displaystyle n}$ columns, whereas the transformation ${\displaystyle T}$ is from ${\displaystyle \mathbb {R} ^{n}}$ to ${\displaystyle \mathbb {R} ^{m}}$. There are alternative expressions of transformation matrices involving row vectors that are preferred by some authors.

In mathematics, and more specifically in linear algebra, a linear map (or linear mapping) is a particular kind of function between vector spaces, which respects the basic operations of vector addition and scalar multiplication. A standard example of a linear map is an ${\displaystyle m\times n}$ matrix, which takes vectors in ${\displaystyle n}$-dimensions into vectors in ${\displaystyle m}$-dimensions in a way that is compatible with addition of vectors, and multiplication of vectors by scalars.

A linear map is a homomorphism of vector spaces. Thus, a linear map ${\displaystyle T:V\to W}$ satisfies ${\displaystyle T(ax+by)=aTx+bTy}$, where ${\displaystyle a}$ and ${\displaystyle b}$ are scalars, and ${\displaystyle x}$ and ${\displaystyle y}$ are vectors (elements of the vector space ${\displaystyle V}$). A linear mapping always maps the origin of ${\displaystyle V}$ to the origin of ${\displaystyle W}$, and linear subspaces of ${\displaystyle V}$ onto linear subspaces in ${\displaystyle W}$ (possibly of a lower dimension); for example, it maps a plane through the origin in ${\displaystyle V}$ to either a plane through the origin in ${\displaystyle W}$, a line through the origin in ${\displaystyle W}$, or just the origin in ${\displaystyle W}$. Linear maps can often be represented as matrices, and simple examples include rotation and reflection linear transformations.

In mathematics and physics, a vector space (also called a linear space) is a set whose elements, often called vectors, can be added together and multiplied ("scaled") by numbers called scalars. The operations of vector addition and scalar multiplication must satisfy certain requirements, called vector axioms. Real vector spaces and complex vector spaces are kinds of vector spaces based on different kinds of scalars: real numbers and complex numbers. Scalars can also be, more generally, elements of any field.

Vector spaces generalize Euclidean vectors, which allow modeling of physical quantities (such as forces and velocity) that have not only a magnitude, but also a direction. The concept of vector spaces is fundamental for linear algebra, together with the concept of matrices, which allows computing in vector spaces. This provides a concise and synthetic way for manipulating and studying systems of linear equations.

The orientation of a real vector space or simply orientation of a vector space is the arbitrary choice of which ordered bases are "positively" oriented and which are "negatively" oriented. In the three-dimensional Euclidean space, right-handed bases are typically declared to be positively oriented, but the choice is arbitrary, as they may also be assigned a negative orientation. A vector space with an orientation selected is called an oriented vector space, while one not having an orientation selected is called unoriented.

In mathematics, orientability is a broader notion that, in two dimensions, allows one to say when a cycle goes around clockwise or counterclockwise, and in three dimensions when a figure is left-handed or right-handed. In linear algebra over the real numbers, the notion of orientation makes sense in arbitrary finite dimension, and is a kind of asymmetry that makes a reflection impossible to replicate by means of a simple displacement. Thus, in three dimensions, it is impossible to make the left hand of a human figure into the right hand of the figure by applying a displacement alone, but it is possible to do so by reflecting the figure in a mirror. As a result, in the three-dimensional Euclidean space, the two possible basis orientations are called right-handed and left-handed (or right-chiral and left-chiral).

In mathematics, particularly linear algebra, an orthogonal basis for an inner product space ${\displaystyle V}$ is a basis for ${\displaystyle V}$ whose vectors are mutually orthogonal. If the vectors of an orthogonal basis are normalized, the resulting basis is an orthonormal basis.

In mathematics, the term linear function refers to two distinct but related notions:

• In calculus and related areas, a linear function is a function whose graph is a straight line, that is, a polynomial function of degree zero or one. For distinguishing such a linear function from the other concept, the term affine function is often used.
• In linear algebra, mathematical analysis, and functional analysis, a linear function is a linear map.

In mathematics, scalar multiplication is one of the basic operations defining a vector space in linear algebra (or more generally, a module in abstract algebra). In common geometrical contexts, scalar multiplication of a real Euclidean vector by a positive real number multiplies the magnitude of the vector without changing its direction. Scalar multiplication is the multiplication of a vector by a scalar (where the product is a vector), and is to be distinguished from inner product of two vectors (where the product is a scalar).

A scalar is an element of a field which is used to define a vector space.In linear algebra, real numbers or generally elements of a field are called scalars and relate to vectors in an associated vector space through the operation of scalar multiplication (defined in the vector space), in which a vector can be multiplied by a scalar in the defined way to produce another vector. Generally speaking, a vector space may be defined by using any field instead of real numbers (such as complex numbers). Then scalars of that vector space will be elements of the associated field (such as complex numbers).

A scalar product operation – not to be confused with scalar multiplication – may be defined on a vector space, allowing two vectors to be multiplied in the defined way to produce a scalar. A vector space equipped with a scalar product is called an inner product space.