Glanz: aiMOOC über GPT aiMOOC Action erstellt

2026-09-01T05:10:14Z

aiMOOC über GPT aiMOOC Action erstellt

Neue Seite

{{T}}
[[Category:English]]
[[Category:Linear Algebra]]

{{BR}}
= Introduction =

'''Linear algebra''' studies vectors, vector spaces, matrices, linear transformations, systems of linear equations, and structures such as eigenvalues and singular values. It is a foundational language for [[English:Mathematics|Mathematics]], [[English:Physics|Physics]], [[English:Engineering|Engineering]], [[English:Computer science|Computer science]], [[English:Data science|Data science]], [[English:Economics|Economics]], statistics, optimization, and machine learning.

In this university-level aiMOOC, you will connect symbolic calculations with geometry and applications. You will learn not only how to carry out procedures such as Gaussian elimination, but also why those procedures reveal subspaces, rank, invertibility, projection, and change of coordinates.

[[File:Vector Addition.svg|500px|frameless|center]]

The image above visualizes vector addition. Geometrically, placing vectors head-to-tail or completing a parallelogram gives the same sum.

{{#ev:youtube|https://www.youtube.com/watch?v=fNk_zzaMoSs|500|center}}

The video introduces vectors from several complementary viewpoints. As you study, keep moving between coordinates, geometric arrows, and abstract vector-space elements.

{{BR}}
== Learning Goals ==

After completing this aiMOOC, you should be able to explain and use [[English:Vector space|vector spaces]], linear combinations, span, linear independence, bases, coordinates, matrices, [[English:Linear transformation|linear transformations]], determinants, orthogonality, projections, eigenvalues, eigenvectors, diagonalization, least squares, and the [[English:Singular value decomposition|singular value decomposition]]. You should also be able to connect these ideas to data analysis, dynamical systems, networks, and numerical computation.

{{BR}}
== Prerequisites and Notation ==

You should be comfortable with algebraic manipulation, functions, coordinate geometry, and basic summation notation. Calculus is helpful for some applications but is not required for the central theory.

A vector in real coordinate space may be written as <math>\mathbf{x}=(x_1,\ldots,x_n)^T</math>. A matrix <math>A\in\mathbb{R}^{m\times n}</math> has <math>m</math> rows and <math>n</math> columns. The transpose is <math>A^T</math>. The identity matrix is <math>I</math>. The zero vector is <math>\mathbf{0}</math>. Throughout the course, you should check dimensions before multiplying matrices or applying formulas.

{{BR}}
= Vectors and Vector Spaces =

{{BR}}
== Vectors, Scalars, and Linear Combinations ==

A '''vector''' can represent displacement, force, velocity, a signal, a polynomial, an image, or a collection of measured features. A '''scalar''' is an element of the underlying field, usually <math>\mathbb{R}</math> or <math>\mathbb{C}</math>. If <math>\mathbf{v}_1,\ldots,\mathbf{v}_k</math> are vectors and <math>c_1,\ldots,c_k</math> are scalars, then
<math display="block">c_1\mathbf{v}_1+\cdots+c_k\mathbf{v}_k</math>
is a '''linear combination'''.

The set of all linear combinations of given vectors is their '''span'''. For example, two nonparallel vectors in <math>\mathbb{R}^2</math> span the whole plane, while two parallel nonzero vectors span only a line through the origin.

{{#ev:youtube|https://www.youtube.com/watch?v=k7RM-ot2NWY|500|center}}

{{BR}}
== Subspaces ==

A subset <math>W</math> of a vector space <math>V</math> is a '''subspace''' if it contains the zero vector and is closed under vector addition and scalar multiplication. Equivalently, every linear combination of vectors in <math>W</math> remains in <math>W</math>.

Important examples include solution sets of homogeneous systems, polynomial spaces of bounded degree, and spaces of functions satisfying linear constraints. A line in <math>\mathbb{R}^2</math> is a subspace only when it passes through the origin.

{{BR}}
== Linear Independence, Basis, and Dimension ==

Vectors <math>\mathbf{v}_1,\ldots,\mathbf{v}_k</math> are '''linearly independent''' if
<math display="block">c_1\mathbf{v}_1+\cdots+c_k\mathbf{v}_k=\mathbf{0}</math>
implies <math>c_1=\cdots=c_k=0</math>. A '''basis''' of a vector space is a linearly independent spanning set. Once a basis is chosen, every vector has a unique coordinate representation in that basis.

[[File:Basis for a plane.svg|500px|frameless|center]]

The number of vectors in any basis of a finite-dimensional vector space is its '''dimension'''. For example, the vectors <math>(1,0,1)^T</math> and <math>(0,1,1)^T</math> are independent, but adding <math>(1,1,2)^T</math> creates a dependent set because the third vector is the sum of the first two.

{{BR}}
= Matrices and Systems of Linear Equations =

{{BR}}
== Matrices as Data and as Operators ==

A matrix can store coefficients, data, or the coordinates of a linear map. Addition and scalar multiplication operate entrywise. Matrix multiplication is different: if <math>A</math> is <math>m\times n</math> and <math>B</math> is <math>n\times p</math>, then <math>AB</math> is <math>m\times p</math>. Its entries are
<math display="block">(AB)_{ij}=\sum_{k=1}^{n}a_{ik}b_{kj}.</math>

[[File:Matrix multiplication principle.svg|500px|frameless|center]]

Matrix multiplication represents composition of linear transformations, which explains why order matters. In general, <math>AB\neq BA</math>.

[[File:Matrix vector multiplication.svg|500px|frameless|center]]

{{BR}}
== Solving Ax = b by Elimination ==

A linear system can be written compactly as <math>A\mathbf{x}=\mathbf{b}</math>. Elementary row operations preserve the solution set. Gaussian elimination transforms the augmented matrix into row-echelon form, while Gauss-Jordan elimination continues to reduced row-echelon form.

For example,
<math display="block">\begin{aligned}x+2y&=5\\3x+4y&=11\end{aligned}</math>
has augmented matrix
<math display="block">\left[\begin{array}{cc|c}1&2&5\\3&4&11\end{array}\right].</math>
Replacing row two by row two minus three times row one gives <math>[0,-2|-4]</math>, so <math>y=2</math> and then <math>x=1</math>.

A system may have one solution, infinitely many solutions, or no solution. Pivot positions identify basic variables. Free variables parameterize families of solutions.

{{#ev:youtube|https://www.youtube.com/watch?v=J7DzL2_Na80|500|center}}

{{BR}}
== Rank, Column Space, and Null Space ==

The '''column space''' of <math>A</math> is the span of its columns and equals the set of all possible outputs <math>A\mathbf{x}</math>. The '''null space''' or kernel is
<math display="block">\mathcal{N}(A)=\{\mathbf{x}:A\mathbf{x}=\mathbf{0}\}.</math>

The '''rank''' of <math>A</math> is the dimension of its column space. If <math>A</math> has <math>n</math> columns, the rank-nullity theorem states
<math display="block">\operatorname{rank}(A)+\operatorname{nullity}(A)=n.</math>

This theorem connects the number of independent output directions with the number of input directions that are collapsed to zero.

{{BR}}
== Inverses and Factorizations ==

A square matrix <math>A</math> is '''invertible''' if there exists <math>A^{-1}</math> with <math>A^{-1}A=AA^{-1}=I</math>. For square matrices, invertibility is equivalent to full rank, a trivial null space, a nonzero determinant, and the existence of a unique solution to <math>A\mathbf{x}=\mathbf{b}</math> for every <math>\mathbf{b}</math>.

In practical computation, you normally solve a system using a factorization rather than explicitly forming the inverse. For example, elimination leads to an <math>LU</math> factorization, while orthogonalization leads to a <math>QR</math> factorization.

{{BR}}
= Linear Transformations and Coordinates =

{{BR}}
== What Makes a Transformation Linear? ==

A transformation <math>T:V\to W</math> is linear when
<math display="block">T(\mathbf{u}+\mathbf{v})=T(\mathbf{u})+T(\mathbf{v})</math>
and
<math display="block">T(c\mathbf{v})=cT(\mathbf{v})</math>
for all appropriate vectors and scalars. These two conditions are equivalent to preservation of every linear combination.

Once bases are chosen, every finite-dimensional linear transformation can be represented by a matrix. The columns of that matrix are the coordinate vectors of the transformed basis vectors.

[[File:2D affine transformation matrix.svg|500px|frameless|center]]

The figure includes several familiar matrix actions such as scaling, rotation, reflection, and shear. Translation is shown in homogeneous coordinates; ordinary translation in <math>\mathbb{R}^2</math> is affine rather than linear because it does not keep the origin fixed.

{{#ev:youtube|https://www.youtube.com/watch?v=kYB8IZa5AuE|500|center}}

{{BR}}
== Kernel, Image, and Rank-Nullity ==

For a linear map <math>T:V\to W</math>, the '''kernel''' is the set of inputs mapped to zero, while the '''image''' is the set of outputs that can actually be reached. If <math>V</math> is finite-dimensional, then
<math display="block">\dim(\ker T)+\dim(\operatorname{im}T)=\dim V.</math>

A linear transformation is one-to-one exactly when its kernel contains only the zero vector. It is onto exactly when its image equals the whole codomain.

{{BR}}
== Change of Basis ==

Coordinates depend on a basis, but the underlying vector does not. If the columns of an invertible matrix <math>P</math> are a new basis written in old coordinates, then
<math display="block">[\mathbf{v}]_{\text{old}}=P[\mathbf{v}]_{\text{new}}.</math>
For a linear operator represented by <math>A</math> in the old basis, its matrix in the new basis is
<math display="block">P^{-1}AP.</math>
This similarity transformation changes coordinates without changing intrinsic properties such as determinant, trace, or eigenvalues.

{{BR}}
= Determinants =

{{BR}}
== Geometric Meaning ==

For a square matrix, the determinant measures signed volume scaling. In two dimensions, <math>|\det A|</math> is the area-scaling factor; in three dimensions, it is the volume-scaling factor. A negative determinant reverses orientation, while a zero determinant means that the transformation collapses space into a lower-dimensional set.

[[File:Determinant-as-area.svg|500px|frameless|center]]

{{#ev:youtube|https://www.youtube.com/watch?v=Ip3X9LOh2dk|500|center}}

{{BR}}
== Algebraic Properties ==

For square matrices <math>A</math> and <math>B</math>,
<math display="block">\det(AB)=\det(A)\det(B).</math>
Swapping two rows changes the sign of the determinant, multiplying a row by a scalar multiplies the determinant by that scalar, and adding a multiple of one row to another leaves the determinant unchanged. A matrix is invertible exactly when its determinant is nonzero.

For a <math>2\times2</math> matrix,
<math display="block">\det\begin{pmatrix}a&b\\c&d\end{pmatrix}=ad-bc.</math>
For larger matrices, elimination is usually more efficient than a full cofactor expansion.

{{BR}}
= Inner Products, Orthogonality, and Least Squares =

{{BR}}
== Dot Products and Orthogonality ==

In <math>\mathbb{R}^n</math>, the standard inner product is
<math display="block">\mathbf{x}^T\mathbf{y}=\sum_{i=1}^{n}x_i y_i.</math>
The induced norm is <math>\|\mathbf{x}\|_2=\sqrt{\mathbf{x}^T\mathbf{x}}</math>. Two vectors are orthogonal when their inner product is zero.

[[File:Orthogonal transformation qtl1.svg|500px|frameless|center]]

An orthogonal matrix <math>Q</math> satisfies <math>Q^TQ=I</math>. Its columns form an orthonormal basis, and it preserves lengths and angles.

{{#ev:youtube|https://www.youtube.com/watch?v=LyGKycYT2v0|500|center}}

{{BR}}
== Orthogonal Projection ==

The projection of <math>\mathbf{b}</math> onto the line spanned by a nonzero vector <math>\mathbf{a}</math> is
<math display="block">\operatorname{proj}_{\mathbf{a}}\mathbf{b}=\frac{\mathbf{a}^T\mathbf{b}}{\mathbf{a}^T\mathbf{a}}\mathbf{a}.</math>
For a subspace with orthonormal basis columns collected in <math>Q</math>, the projection matrix is <math>QQ^T</math>.

Projection is characterized by an orthogonality condition: the error between the original vector and its projection is perpendicular to the target subspace.

{{BR}}
== Gram-Schmidt and QR Factorization ==

The Gram-Schmidt process converts a linearly independent set into an orthonormal set spanning the same subspace. Applied to the columns of a full-column-rank matrix <math>A</math>, it produces
<math display="block">A=QR,</math>
where <math>Q</math> has orthonormal columns and <math>R</math> is upper triangular. Numerically stable implementations typically use modified Gram-Schmidt or Householder reflections.

{{BR}}
== Least Squares ==

When <math>A\mathbf{x}=\mathbf{b}</math> is inconsistent, least squares chooses <math>\hat{\mathbf{x}}</math> to minimize
<math display="block">\|A\mathbf{x}-\mathbf{b}\|_2.</math>
At the optimum, the residual is orthogonal to the column space of <math>A</math>, giving the normal equations
<math display="block">A^TA\hat{\mathbf{x}}=A^T\mathbf{b}.</math>

[[File:Linear least squares.svg|500px|frameless|center]]

The normal equations clarify the geometry, but directly forming <math>A^TA</math> can worsen numerical conditioning. QR factorization or SVD is generally preferred for robust numerical least-squares computation.

{{#ev:youtube|https://www.youtube.com/watch?v=osh80YCg_GM|500|center}}

{{BR}}
= Eigenvalues, Eigenvectors, and Diagonalization =

{{BR}}
== Eigenvectors and Eigenvalues ==

For a square matrix <math>A</math>, a nonzero vector <math>\mathbf{v}</math> is an eigenvector with eigenvalue <math>\lambda</math> if
<math display="block">A\mathbf{v}=\lambda\mathbf{v}.</math>
The transformation may stretch, shrink, reverse, or preserve the direction of an eigenvector, but it does not move that vector away from its eigenvector line.

[[File:Eigenvectors.gif|500px|frameless|center]]

Eigenvalues are found from the characteristic equation
<math display="block">\det(A-\lambda I)=0.</math>

For example,
<math display="block">A=\begin{pmatrix}2&1\\1&2\end{pmatrix}</math>
has eigenvalue <math>3</math> with eigenvector direction <math>(1,1)^T</math> and eigenvalue <math>1</math> with eigenvector direction <math>(1,-1)^T</math>.

{{#ev:youtube|https://www.youtube.com/watch?v=PFDu9oVAE-g|500|center}}

{{BR}}
== Diagonalization and the Spectral Theorem ==

If a matrix has a basis of eigenvectors, then it can be diagonalized:
<math display="block">A=PDP^{-1},</math>
where the columns of <math>P</math> are eigenvectors and <math>D</math> contains the corresponding eigenvalues. Then
<math display="block">A^k=PD^kP^{-1},</math>
which makes repeated application easy to analyze.

Every real symmetric matrix has an orthonormal basis of real eigenvectors. Therefore, the spectral theorem gives
<math display="block">A=Q\Lambda Q^T</math>
for a real symmetric matrix <math>A</math>, with orthogonal <math>Q</math> and real diagonal <math>\Lambda</math>.

{{BR}}
== Dynamical Systems and Stability ==

In a discrete system <math>\mathbf{x}_{k+1}=A\mathbf{x}_k</math>, eigenvalues help determine long-term behavior. Components along eigenvectors are multiplied repeatedly by powers of their eigenvalues. In the differential equation <math>\mathbf{x}'=A\mathbf{x}</math>, eigenvalues determine exponential modes through terms such as <math>e^{\lambda t}</math>.

You should interpret these statements carefully when a matrix is not diagonalizable or is highly nonnormal, because eigenvalues alone may not capture every transient behavior.

{{BR}}
= Singular Value Decomposition =

{{BR}}
== The SVD of Any Matrix ==

Every real <math>m\times n</math> matrix has a singular value decomposition
<math display="block">A=U\Sigma V^T,</math>
where the columns of <math>U</math> and <math>V</math> are orthonormal and <math>\Sigma</math> is diagonal in the rectangular sense with nonnegative singular values.

[[File:Singular-Value-Decomposition.svg|500px|frameless|center]]

Geometrically, the SVD decomposes a linear map into an orthogonal change of coordinates, axis-aligned scaling, and another orthogonal change of coordinates. The nonzero singular values are the square roots of the nonzero eigenvalues of <math>A^TA</math>.

{{#ev:youtube|https://www.youtube.com/watch?v=TX_vooSnhm8|500|center}}

{{BR}}
== Rank, Compression, Pseudoinverse, and Conditioning ==

The number of nonzero singular values equals the rank of <math>A</math>. Keeping only the largest singular values gives a low-rank approximation, a key idea in compression, denoising, latent semantic analysis, and principal component methods.

The Moore-Penrose pseudoinverse uses reciprocal nonzero singular values and extends inverse-like solving to rectangular or rank-deficient matrices. In the Euclidean norm, the ratio of largest to smallest nonzero singular value measures sensitivity through a condition number. A large condition number warns that small input perturbations may cause much larger changes in a computed solution.

{{BR}}
= Applications and Connections =

{{BR}}
== Data Science and Principal Components ==

A data matrix places observations and features into rows and columns. After centering the data, principal component analysis identifies orthogonal directions of maximal variance. Computationally, these directions can be obtained from eigenvectors of a covariance matrix or from the SVD of the centered data matrix.

This application shows why basis choice matters: changing to a principal-component basis can concentrate information into fewer coordinates.

{{BR}}
== Networks and Graphs ==

Matrices encode networks through adjacency, incidence, and Laplacian matrices. Null spaces can represent conservation laws or connected components, while eigenvalues reveal structural and dynamical properties. These ideas connect [[English:Graph theory|Graph theory]] with linear algebra.

{{BR}}
== Markov Chains ==

A finite-state [[English:Markov chain|Markov chain]] can be represented by a stochastic matrix. Under a consistent row- or column-vector convention, repeated matrix multiplication evolves probability distributions. Stationary distributions correspond to eigenvectors associated with eigenvalue one, subject to normalization and suitable assumptions about the chain.

{{BR}}
== Differential Equations and Control ==

Systems of linear differential equations use matrix dynamics. Eigenvalues and invariant subspaces help you understand modes, stability, resonance, and long-term behavior. In control theory, matrices describe state evolution, inputs, outputs, controllability, and observability.

{{BR}}
== Computer Graphics and Geometry ==

Rotations, reflections, scalings, projections, and coordinate changes are linear transformations represented by matrices. Graphics pipelines often use homogeneous coordinates so that affine operations such as translations can be combined with linear operations through matrix multiplication.

{{BR}}
= Problem-Solving Strategy =

{{BR}}
== A Conceptual Workflow ==

When you face a new problem, first identify the spaces, dimensions, and map involved. Then ask which structure matters: a system of equations, a subspace, an orthogonality condition, an invariant direction, or a low-rank approximation. Choose a basis or factorization that exposes that structure. Finally, check the result geometrically, algebraically, and numerically when possible.

A useful habit is to distinguish three layers:
# [[English:Geometric interpretation|Geometric interpretation]]: What does the transformation do to directions, lengths, areas, or subspaces?
# [[English:Algebraic representation|Algebraic representation]]: Which matrix equation or factorization represents the structure?
# [[English:Numerical computation|Numerical computation]]: Which method is stable and efficient for the size and conditioning of the problem?

{{BR}}
== Common Misconceptions ==

'''A matrix is more than a table of numbers.''' It usually represents a linear map once bases are chosen.

'''Row operations do not preserve every matrix property.''' They preserve the solution set of a system, but they may change eigenvalues, eigenvectors, and the determinant unless you track the effects.

'''The determinant is not merely a formula.''' Its geometric meaning is signed volume scaling.

'''Eigenvectors need not form a basis.''' Diagonalization requires enough linearly independent eigenvectors.

'''The normal equations are not always the best numerical algorithm.''' QR or SVD methods are often more stable.

'''Zero dot product and zero matrix product are different ideas.''' Orthogonality concerns an inner product, while a zero matrix product may arise for other structural reasons.

{{BR}}
= Interactive Tasks =

{{BR}}
== Quiz: Test Your Knowledge ==

{{MC}}

'''What does the span of a set of vectors contain?'''
(All linear combinations of those vectors)
(!Only unit vectors)
(!Only orthogonal vectors)
(!Only the original vectors)

{{E}}
<br>

{{MC}}

'''What property must a basis have?'''
(It must be linearly independent and spanning)
(!It must contain only eigenvectors)
(!It must have determinant one)
(!It must contain infinitely many vectors)

{{E}}
<br>

{{MC}}

'''What does the rank of a matrix measure?'''
(The dimension of its column space)
(!The number of all matrix entries)
(!The size of its determinant)
(!The number of zero columns only)

{{E}}
<br>

{{MC}}

'''When is a square matrix invertible?'''
(When it has full rank)
(!When every entry is positive)
(!When it is symmetric)
(!When its trace is zero)

{{E}}
<br>

{{MC}}

'''What does a zero determinant indicate geometrically?'''
(The transformation collapses dimension)
(!The transformation preserves every length)
(!The transformation is always a rotation)
(!The transformation has no matrix representation)

{{E}}
<br>

{{MC}}

'''What condition defines orthogonal vectors?'''
(Their inner product is zero)
(!Their lengths are equal)
(!Their coordinates are positive)
(!Their spans are identical)

{{E}}
<br>

{{MC}}

'''What does least squares minimize?'''
(The Euclidean norm of the residual)
(!The determinant of the data matrix)
(!The number of variables)
(!The trace of the coefficient matrix)

{{E}}
<br>

{{MC}}

'''What equation defines an eigenvector direction?'''
(The matrix maps it to a scalar multiple of itself)
(!The matrix maps it to the zero vector in every case)
(!The vector has every coordinate equal)
(!The vector must be orthogonal to every other vector)

{{E}}
<br>

{{MC}}

'''What is guaranteed for every real matrix?'''
(A singular value decomposition)
(!A real eigenbasis)
(!A nonzero determinant)
(!A unique inverse)

{{E}}
<br>

{{MC}}

'''Why are QR or SVD methods often preferred for numerical least squares?'''
(They can be more numerically stable)
(!They always avoid matrix multiplication)
(!They require no arithmetic)
(!They make every system exactly solvable)

{{E}}
<br>

{{BR}}
== Memory Game ==

<div class="memo-quiz">
{|
|-
| Vector space || A set closed under vector addition and scalar multiplication
|-
| Span || The collection of all linear combinations generated by given vectors
|-
| Basis || An independent spanning set that gives unique coordinates
|-
| Rank || The dimension of the reachable output space of a matrix
|-
| Kernel || The set of inputs mapped to the zero vector
|-
| Orthogonal || Having inner product equal to zero
|-
| Eigenvector || A nonzero direction preserved up to scaling by a linear operator
|-
| Singular value || A nonnegative scale factor appearing in the SVD
|}
{{E}}
<br>

{{BR}}
== Drag and Drop ==

<div class="lueckentext-quiz">

{| class="wikitable"
! Match the correct terms.
! Topic
|-
| '''Linear independence'''
| No nontrivial linear combination produces the zero vector
|-
| '''Projection'''
| Closest-point representation in a subspace under an inner product
|-
| '''Determinant'''
| Signed volume scaling of a square linear transformation
|-
| '''Diagonalization'''
| Representation using an eigenvector basis and a diagonal matrix
|-
| '''Pseudoinverse'''
| Generalized inverse used for rectangular or rank-deficient problems
|}
{{E}}

<br>
...
<br />

{{BR}}
== Crossword Puzzle ==

<div class="kreuzwort-quiz">
{|
|-
| Vector || What object can be added and scaled in a vector space?
|-
| Basis || What independent spanning set gives unique coordinates?
|-
| Kernel || What set contains all inputs mapped to zero?
|-
| Rank || What is the dimension of the column space called?
|-
| Eigenvector || What nonzero direction is preserved up to scaling by an operator?
|-
| Determinant || What scalar measures signed volume scaling?
|}
{{E}}
<br>

{{BR}}
== LearningApps ==

<iframe> https://learningapps.org/index.php?s=Linear+Algebra </iframe>

{{BR}}
== Cloze Text ==

<quiz display=simple>
{'''Complete the text.'''<br>
|type="{}"}
A set closed under vector addition and scalar multiplication is a { vector space }. The set of all linear combinations of given vectors is their { span }. An independent spanning set is called a { basis }. The dimension of the column space of a matrix is its { rank }. The inputs mapped to zero form the { kernel }. A square matrix is invertible exactly when its determinant is { nonzero }. Vectors with zero inner product are { orthogonal }. Least squares chooses a solution that minimizes the norm of the { residual }. A preserved direction under a linear map is represented by an { eigenvector }. Every real matrix admits a { singular value decomposition }. The number of nonzero singular values equals the matrix { rank }. A large condition number indicates possible numerical { sensitivity }.
</quiz>

<br>

{{BR}}
= Open-Ended Tasks =

{{BR}}
=== Easy ===
# [[English:Vector visualization|Vector visualization]]: Draw two vectors and their sum using both the head-to-tail method and the parallelogram method, then explain why the constructions agree.
# [[English:Basis experiment|Basis experiment]]: Choose two different bases of the plane, represent the same vector in both bases, and create a labeled image showing how the coordinates change.
# [[English:Matrix transformation video|Matrix transformation video]]: Make a short video showing how one two-dimensional matrix transforms a grid, and identify the images of the standard basis vectors.
# [[English:Linear algebra interview|Linear algebra interview]]: Interview a student, researcher, engineer, or data professional about one place where matrices or vectors appear in their work, then summarize the example.

{{BR}}
=== Standard ===
# [[English:Gaussian elimination project|Gaussian elimination project]]: Create and solve a three-variable linear system, document every row operation, and interpret rank, pivots, and free variables.
# [[English:Least squares investigation|Least squares investigation]]: Collect a small real dataset, fit a line using least squares, plot the residuals, and explain the orthogonality condition behind the fit.
# [[English:Orthogonality experiment|Orthogonality experiment]]: Implement Gram-Schmidt on three independent vectors, verify the resulting dot products, and discuss the effect of rounding errors.
# [[English:Campus transformation hunt|Campus transformation hunt]]: Visit or photograph a campus, workplace, or public location where rotations, reflections, projections, grids, or coordinate transformations are visible, then model one example with a matrix.

{{BR}}
=== Advanced ===
# [[English:Eigenvalue dynamics study|Eigenvalue dynamics study]]: Compare two discrete dynamical systems with different eigenvalue patterns, simulate repeated matrix powers, and explain the observed long-term behavior.
# [[English:PCA data project|PCA data project]]: Center a multivariable dataset, compute principal directions using an eigenvalue method or SVD, and create a visual explanation of dimensionality reduction.
# [[English:SVD compression experiment|SVD compression experiment]]: Apply a truncated SVD to a grayscale image or numerical data matrix, compare several retained ranks, and evaluate the trade-off between compression and reconstruction error.
# [[English:Numerical stability investigation|Numerical stability investigation]]: Construct or find matrices with contrasting condition numbers, solve related systems with two computational approaches, and write a technical report explaining sensitivity and algorithm choice.

{{:Open Task - Create a MOOC}}

{{BR}}
= Learning Assessment =

# [[English:Model selection assessment|Model selection assessment]]: Given several real situations, decide whether each is best modeled by a linear system, projection, eigenvalue problem, or low-rank approximation, and justify every choice.
# [[English:Rank-nullity assessment|Rank-nullity assessment]]: Analyze a linear map from its matrix, determine bases for its kernel and image, verify rank-nullity, and explain what the dimensions mean geometrically.
# [[English:Transformation assessment|Transformation assessment]]: Given a matrix transformation, predict its effect on a basis, area, orientation, and invertibility before computing, then compare prediction with calculation.
# [[English:Least squares assessment|Least squares assessment]]: Derive the orthogonality condition for a least-squares fit and compare solving with normal equations and QR from the perspectives of geometry and numerical reliability.
# [[English:Spectral assessment|Spectral assessment]]: Determine when a matrix can be diagonalized, use the resulting form to analyze repeated powers, and explain how the conclusion changes if a full eigenbasis is unavailable.
# [[English:SVD transfer assessment|SVD transfer assessment]]: Explain how one SVD can simultaneously reveal rank, important directions, a pseudoinverse, conditioning information, and a low-rank approximation in an applied example.

<br>
<br>

{{BR}}
= Evidence of Learning =

Evidence of successful learning should show more than procedural speed. You should be able to demonstrate the following:

# '''Knowledge''': Explain central definitions, theorems, equivalences, and geometric meanings, including span, basis, rank, determinant, orthogonality, eigenstructure, and SVD.
# '''Skills''': Solve systems, compute and interpret subspaces, change coordinates, project vectors, use matrix factorizations, and check dimensions and assumptions.
# '''Products''': Produce clear mathematical explanations, annotated calculations, visualizations, computational notebooks or reports, and data-driven models.
# '''Reasoning''': Connect algebraic formulas with geometric structure, justify method choices, detect invalid assumptions, and distinguish exact mathematics from numerical approximation.
# '''Transfer''': Apply linear algebra to unfamiliar problems in data science, engineering, physics, networks, economics, graphics, or other disciplines.

<br>
<br>

{{BR}}
= OERs on the Topic =

<iframe> https://en.m.wikipedia.org/wiki/Linear_algebra </iframe>

<br>

You can deepen your study with [https://ocw.mit.edu/courses/18-06sc-linear-algebra-fall-2011/ MIT OpenCourseWare: Linear Algebra], which provides lecture videos, notes, problems, and solutions. You can also use [https://www.3blue1brown.com/topics/linear-algebra 3Blue1Brown linear algebra resources] for visual intuition.

{{BR}}
= Linked Learning Areas =

{| align=center
{{:D-Tab}}
'''[[English:Linear Algebra|Linear Algebra]]'''
# [[English:Vector space|Vector space]]
# [[English:Matrix|Matrix]]
# [[English:System of linear equations|System of linear equations]]
# [[English:Linear transformation|Linear transformation]]
# [[English:Determinant|Determinant]]
# [[English:Inner product space|Inner product space]]
# [[English:Eigenvalues and eigenvectors|Eigenvalues and eigenvectors]]
# [[English:Singular value decomposition|Singular value decomposition]]
# [[English:Numerical linear algebra|Numerical linear algebra]]
# [[English:Data science|Data science]]
|}

{{BR}}
= aiMOOC Projects =
[[Category:English]]
[[Category:Linear Algebra]]
[[Category:Higher Education]]
[[Category:Mathematics]]
[[Category:Applied Mathematics]]
[[Category:Computer Science]]
[[Category:Data Science]]
[[Category:Engineering]]
[[Category:AI_MOOC]]
[[Category:GPT aiMOOC]]
{{MT}}

English:Linear Algebra - Versionsgeschichte

Glanz: aiMOOC über GPT aiMOOC Action erstellt