Video yükleniyor...

Video Yüklenemedi

Ana Sayfaya Dön

A Princeton probabilist explains why enormous random matrices stop behaving randomly and start behaving like a single fixed object. Almost nobody watches it. This is Ramon van Handel at Harvard's Science Center, April 2025, on the strong convergence phenomenon. Every weight matrix in every model starts as random numbers....

102,004 görüntüleme • 7 gün önce •via X (Twitter)

0 Yorum

Yorum bulunmuyor

Orijinal gönderinin yorumları burada görünecek

Benzer Videolar

The Trap in Every Mathematics Lecture If you’ve taken a lot of math courses, you start to recognize a pattern. There’s a moment where the lecturer is warming up with the obvious stuff...add matrices entrywise, scale by α, do the row-column product...and you’re thinking, alright… where is this going? Then you relax. You stop resisting. And right there, they slip in one line that changes how you see the whole subject. When Benedict Gross says "matrices represent linear operators,"he’s telling you to stop treating a matrix as a rectangle of numbers and start treating it as an action. A linear operator is a function T: Rⁿ → Rⁿ that respects two rules: T(u+v)=T(u)+T(v) and T(αu)=αT(u). Once you pick a basis, T is completely determined by where it sends the basis vectors e₁,…,eₙ. Put T(e₁),…,T(eₙ) into columns and you get a matrix A. That is what "A represents T" means...A is the coordinate portrait of the transformation. Now the punchline that makes matrix multiplication feel inevitable. If B represents S and A represents T, then doing S first and then T is the composition T∘S. In coordinates that becomes A(Bx)=(AB)x. So multiplying matrices is really composing transformations. That’s why multiplication is usually not commutative: T∘S is generally not the same transformation as S∘T, and the matrices inherit that noncommutativity. This explains half of Linear Algebra because it tells you what the course is really about...functions that move vectors around, not grids of numbers. A matrix is just the written form of that function once you choose coordinates. Then the rules stop feeling random Multiplying matrices means doing one move and then another, an inverse means you can undo the move, eigenvectors are directions that don’t get turned, and changing basis is just describing the same move in a different language. That one idea makes a lot of linear algebra click. #LinearAlgebra #Matrices #GroupTheory #GLn #MathLectures #Mathematics

Mathelirium

66,892 görüntüleme • 6 ay önce

The Trap in Every Mathematics Lecture If you’ve taken enough math courses, you start noticing the same little move. The lecturer warms up with the obvious stuff, add matrices entrywise, scale by α, do the row-column product, and you’re thinking alright, where is this going. Then you relax. You stop resisting. And right there, they drop one line that quietly rewires the whole subject. When Benedict Gross says matrices represent linear operators, he’s telling you to stop treating a matrix as a rectangle of numbers and start treating it as an action. A linear operator is a function T: ℝⁿ → ℝⁿ that respects two rules: T(u+v) = T(u) + T(v) T(αu) = αT(u) Once you pick a basis, T is completely determined by where it sends the basis vectors e₁,…,eₙ. Put T(e₁),…,T(eₙ) into columns and you get a matrix A. That is what A represents T means. A is the coordinate portrait of the transformation. Now the punchline that makes matrix multiplication feel inevitable. If B represents S and A represents T, then doing S first and then T is the composition T∘S. In coordinates that becomes A(Bx) = (AB)x. So multiplying matrices is really composing transformations. That’s why multiplication is usually not commutative. T∘S is generally not the same transformation as S∘T, and the matrices inherit that noncommutativity. This explains half of linear algebra because it tells you what the course is really about: functions that move vectors around, not grids of numbers. A matrix is just the written form of that function once you choose coordinates. After that, the rules stop feeling random. Multiplying matrices means doing one move and then another. An inverse means you can undo the move. Eigenvectors are directions that don’t get turned. Changing basis is just describing the same move in a different language. One idea, and a lot of linear algebra suddenly clicks. #LinearAlgebra #Matrices #LinearMaps #Eigenvectors #ChangeOfBasis #Mathematics

Mathelirium

133,454 görüntüleme • 5 ay önce

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

127,115 görüntüleme • 8 gün önce

OpenAI just spent $2,000 to solve 10 problems that have beaten the world's best mathematicians for DECADES. Nobody outside the company is allowed to run the machine that did it. On Saturday OpenAI published a 249-page report and gave its next model family a name: Astra. An internal version of it produced new results on 10 open problems in mathematics and theoretical computer science, and mathematicians had made no real progress on any of them for at least 10 years. On most of them, far longer than that. Here is what it solved: It built the first explicit example of a non-sofic group. Mikhail Gromov raised that question in 1999 and nobody answered it for 27 years. It disproved Connes's rigidity conjecture, a problem in von Neumann algebras that had stood for decades. It proved Ehrhart's volume conjecture. It resolved three problems from Paul Erdos's catalogue, including number 183 on multicolor Ramsey numbers. It produced the first improvement to the general upper bound on high-dimensional sphere packing since 1978. And it proved a new hardness result for the closest vector problem, which sits directly underneath lattice cryptography. That is the math the world is betting on to protect its data once quantum computers arrive. The successful runs cost roughly $2,000 in tokens. Now here is what almost nobody has picked up on... OpenAI did not just publish claims. Every argument shipped with a Lean certificate, which is a machine-checkable proof that any mathematician can verify without trusting OpenAI at all. That is a real change. In May the same model family disproved the Erdos unit distance conjecture and the world had to take a Fields Medalist's word for it. Tim Gowers said he would recommend that proof for the Annals of Mathematics without hesitation. This time the proofs check themselves. But look at what is still unverifiable: Any mathematician can now check those proofs line by line. Not one of them can look at the model that wrote them. Astra has no release date and nobody outside OpenAI has run it. The company announced its next major model family with a claim instead of a demo, and the only evidence anyone gets is the output. So OpenAI made an unfalsifiable claim about a machine look like a falsifiable claim about mathematics. The Information reported this week that OpenAI demoed Astra to US policymakers and regulators in Washington. This is the same month the administration is weighing a new watchdog to vet frontier AI models, reporting to the SEC. 10 proofs nobody believed a machine could produce is a very good thing to carry into that room. And keep in mind, the same model family doing this mathematics is the family that kept escaping its own testing environment. OpenAI models found zero-day vulnerabilities nobody knew existed, broke out of a sealed research sandbox, and reached another company's live systems. Both of those facts come from OpenAI's own announcements, published three weeks apart. Finding a proof no human could construct and finding a hole no human had noticed are the same ability aimed at different targets. Mathematicians are already asking for independent verification, and plenty of people online are calling the whole thing hype. Thomas Bloom, who runs the Erdos problems site, called the 10 results big news and said they matter more than the May result did. Lean will settle the mathematics within weeks. But nothing will settle what else a machine this capable is being pointed at, because nobody outside one company is allowed to look.

Ricardo

41,161 görüntüleme • 4 gün önce