Загрузка видео...

Не удалось загрузить видео

На главную

In 1843, Hamilton realized complex numbers needed not one more dimension but two. One real part, three imaginary - i, j, k. He carved the equation into a Dublin bridge on October 16th. That number system now runs inside every 3D graphics engine, every robotics controller, and every LLM...

24,975 просмотров • 3 дней назад •via X (Twitter)

Комментарии: 9

Фото профиля Bart Christner
Bart Christner3 дней назад

Plagiarized content without attribution from Three Brown One Blue, Youtube, Sep 6, 2018. Visualizing the 4d numbers Quaternions.

Фото профиля Aaron M Kinder
Aaron M Kinder3 дней назад

That's what I said, I'm setting booby traps via @TheYTPro

Фото профиля David Minor
David Minor3 дней назад

This is not quite right complex numbers. Don’t need these, but Hamilton invented a whole Nother type of complex number which can have three or even more imaginary roots. Normal complex math and physics works just fine without them, but a lot of the matrix computations can be done using quaternions. That is the IJK but most physicist prefer to use standard Gaussian matrix arithmetic.

Фото профиля Jesse Palmer
Jesse Palmer3 дней назад

Another reason game engines use it as it takes less operations to multiply rotations

Фото профиля 菅野正人
菅野正人3 дней назад

なぜ単位ベクトルの始点が座標の原点にあるのですか?

Фото профиля Anish
Anish3 дней назад

very nice

Фото профиля supervinculum
supervinculum3 дней назад

Why you can't tie knots in four dimensions

Фото профиля ᒎᘴᓵᖶᓋ
ᒎᘴᓵᖶᓋ3 дней назад

Carving i² = j² = k² = ijk = -1 into a bridge is the most legendary commit message ever. Now it keeps robot arms and game cameras out of gimbal lock. Did Dublin ever ask him to revert? 🌉

Фото профиля Kin Altruism
Kin Altruism3 дней назад

Matrices don't have gimbal lock

Похожие видео

A 91-year-old professor is why Nvidia is worth $4 trillion. His name is Gilbert Strang. He teaches linear algebra at MIT. Every AI model on Earth runs on his course. The course has been free on YouTube since 2005. The videos have earned him nothing. MIT 18.06 opens with "The Geometry of Linear Equations." No advanced math. Strang takes a system of two equations, draws it two ways, and shows the class that a matrix is a picture, not an abstraction. The row picture is two lines that cross. The column picture is two arrows that sum to a target. Every neural network on Earth operates on the column picture. Strang first taught linear algebra at MIT in 1962. He wrote the textbook in 1976. It is on every serious engineer's shelf. Every quant fund, every ML lab, every rendering engine at Pixar is running his math. His central insight is that most people are taught matrices as bookkeeping. That is the first thing to unlearn. A matrix is a linear transformation. A linear transformation is a way of moving space. Once you see the space move, the math stops being algebra and becomes geometry. The Kalman filter is a linear system. PCA is a linear system. Every gradient step in a neural net is a matrix-vector product. GPT is a stack of matrix-vector products, each one a scene from MIT 18.06 running on a Blackwell GPU. He retired in 2023 after 61 years at MIT. The course is still up. Watched tens of millions of times. The chip is $40,000. Strang never asked for a royalty.

Ochob

131,686 просмотров • 3 месяцев назад

MIT FILMED THE LECTURE WHERE THEIR MOST LEGENDARY LINEAR ALGEBRA PROFESSOR EXPLAINS WHY EVERY GPS SIGNAL EVERY MEDICAL SCAN AND EVERY AI MODEL ON EARTH IS SECRETLY SOLVING A PROBLEM THAT HAS NO SOLUTION This is Gilbert Strang, MIT, 18.06 Linear Algebra, lecture 15. The professor whose textbooks sit in over 3,000 universities across 135 countries and whose course has been watched by millions of engineers and mathematicians worldwide. He opens with one claim - when equations have no solution, you do not give up. You solve the closest problem that can be solved. He starts with a vector b and a line through a. The projection of b onto that line is the point closest to b that actually lives on the line. The key is a right angle. The error - the gap between b and its projection - must be perpendicular to a. That one geometric fact produces the entire formula. The projection is a times a transpose b divided by a transpose a. One fraction. The numerator is a matrix. The denominator is a number. Then the projection matrix. Every projection is carried out by a matrix P that multiplies b and lands on the line. That matrix has two properties that define all projections everywhere. First, P transpose equals P - the matrix is symmetric. Second, P squared equals P - project twice and you stay where you are. The first projection moves you onto the line. The second leaves you there. Then higher dimensions. Instead of projecting onto a line, project onto a plane. Instead of one vector a, you have a matrix A with two columns spanning the plane. The error vector must now be perpendicular to both columns - perpendicular to the entire plane. That condition produces one matrix equation. A transpose times the error equals zero. The error lives in the null space of A transpose, which is exactly perpendicular to the column space of A. The four fundamental subspaces appear without being called. Then the formula for n dimensions. The projection matrix is A times A transpose A inverse times A transpose. Strang warns the room not to simplify it by canceling A inverse against A - A is not square, it has no inverse, and the formula cannot be pulled apart. The only case where it simplifies to the identity is when A spans the whole space and the projection is b itself. Watch the moment he applies the formula to fitting a line through three points that no line can pass through. Three equations, two unknowns, no solution. He writes the matrix, writes the right-hand side, and shows that multiplying both sides by A transpose produces an equation that always has a solution. That equation is the foundation of least squares, GPS triangulation, and every regression model trained in 2026. A data scientist I know rewatched this lecture before building a recommendation system from scratch. Said it was the first time the normal equations felt like geometry rather than a formula someone handed down to memorize. Free on YouTube, MIT OpenCourseWare, filmed over 20 years ago. bookmark this and watch later - after this lecture every unsolvable equation you meet will feel like a projection waiting to be found

Lupen

24,677 просмотров • 3 месяцев назад

Carl Sagan filmed a free seven-minute explanation of the fourth dimension that has now been watched more than five million times. Universities charge tens of thousands of dollars a year for cosmology and geometry courses that never reach this material with the same clarity. He posted the entire sequence for nothing. Almost no one who casually debates higher dimensions has watched it to the end. The clip comes from Episode 10 of Cosmos, “The Edge of Forever,” recorded in 1980. Sagan begins by placing the viewer inside Flatland, a two-dimensional world inhabited by squares and circles who can move left-right and forward-back but have never heard of up or down. Into that plane he lowers a three-dimensional apple. The Flatlanders experience only a series of expanding and shrinking circles as the apple passes through their world. They never see the whole fruit, only successive slices, and they invent elaborate theories to explain the changing shapes that appear and vanish without cause. Sagan then constructs a cube by moving a square through a third dimension at right angles to itself, and asks what happens if the same operation is performed once more: take the cube and move it at right angles to all three existing directions. The result is a four-dimensional hypercube, a tesseract. He cannot show a true tesseract because both he and the viewer remain trapped in three dimensions, but he can display its three-dimensional shadow: two nested cubes with every vertex connected by lines. In the real four-dimensional object every edge would be equal and every angle a right angle; the distorted projection is simply the cost of losing a dimension. Every modern discussion of curved spacetime, finite but unbounded universes, and higher-dimensional geometry rests on the same progression he lays out with an apple and a cube. The sequence is free on YouTube. The willingness to sit through those seven minutes before speaking about the fourth dimension is a much rarer commodity than the confidence to argue without having watched it.

fomosapiens

73,505 просмотров • 2 месяцев назад

In 2006, Netflix offered $1,000,000 to anyone who could improve their recommendation algorithm by 10%. Over 2,000 teams competed for three years. The team that won did not use more data. They used fewer dimensions. They found a basis - a small set of independent vectors that captured everything important about 100,000,000 movie ratings. The lead mathematician on the winning team: $2,800,000 a year. A machine learning engineer at Spotify building the same kind of system: $245,000 a year. This is MIT 18.06, Lecture 9 - Gilbert Strang. Free on YouTube. Most people think independence is obvious. Two vectors pointing in different directions. Then the definition. Independence means no combination of your vectors gives the zero vector - except the trivial one where all the coefficients are zero. That's it. That's the whole definition. But watch what it unlocks. Watch the moment Strang puts three vectors in a two-dimensional plane. He doesn't even tell you which three vectors. He just draws them. And immediately says: dependent. No question. No calculation. Why? Because three vectors in two-dimensional space means more columns than rows. More unknowns than equations. That always forces a free variable. A free variable always gives a non-zero solution to Ax = 0. And that non-zero solution is a combination of the columns that produces zero. Dependence. "Three vectors in the plane have to be dependent. That's the key fact." Then the basis. A basis is vectors that are independent and span the space. Not too few, not too many. Just right. The pivot columns of any matrix form a basis for the column space. Every other basis you can think of will have exactly the same number of vectors. Then the dimension. All bases for the same space have the same number of vectors. That number is the dimension. The rank of a matrix is the dimension of its column space. The number of free variables is the dimension of the null space. And rank plus null space dimension equals the total number of columns. "I don't take the dimension of A. I take the dimension of the column space of A. If you use those words right, it shows you've got the idea right." A data scientist at Netflix building recommendation engines: $230,000 a year. A quantitative researcher at Two Sigma finding independent factors in financial markets: $350,000 a year. A computer vision engineer at Apple using low-dimensional representations for face recognition: $260,000 a year. They all needed to know how many dimensions were really there. bookmark this and watch later - after this lecture every dataset you look at will feel like a matrix waiting to be reduced to its basis.

Zyphor

14,720 просмотров • 2 месяцев назад