the null space is one of the most intuitive ways to understand what a matrix actually does. think of a matrix not as a grid of numbers, but as a machine that transforms space. it can rotate directions, stretch them, compress them, or completely erase them. the null space is the collection of all input directions that this transformation cannot see: feed any vector from the null space into the matrix and the output collapses to zero.
this tells you something deeper about information. if two different inputs differ only along a direction in the null space, the transformation produces the same output for both. that information has been destroyed. this is why the null space connects directly to rank, invertibility and solving linear systems. a matrix with only the zero vector in its null space loses no input directions and is one to one. a nontrivial null space means some degrees of freedom disappear under the transformation, making perfect reconstruction impossible without additional information.
this idea appears everywhere once you recognize it. in robotics, the null space of a jacobian contains joint motions that do not change the end effector motion, letting a robot reposition itself while preserving its primary task. in optimization, null spaces describe directions that preserve linear constraints. in estimation and sensing, they reveal states that measurements cannot distinguish. null space is therefore not merely “the vectors that map to zero.” it is a map of what a system is fundamentally blind to.
¬¬ retweeted
A twist is a rotation whose angle grows along its own axis: Tₓ(s) turns the point (x, y, z) about the x axis through the angle sx.
The face x = 0 stays put, each slice x = c turns rigidly through sc, and edges along the axis bend into helices. With s = cos θ and side 2, the far face swings through ±2 radians, about ±115°.
The map is not linear, yet its Jacobian has determinant 1 everywhere, so the twist keeps volume.
¬¬ retweeted
These 9 algorithms are why your phone predicts your next move.
- Linear Regression finds the best line through data points.
- Logistic Regression turns numbers into probabilities.
- Decision Trees classify by asking sequential questions.
- SVM draws the widest gap between classes.
- KNN lets closest neighbors vote.
- Dimensionality Reduction keeps only what matters.
- Random Forest averages many trees.
- K-means finds natural groups in data.
- Naive Bayes multiplies probabilities for quick classification.