{"id":"palomar/PALOMAR-2026-11-21-000005","url":"https://github.com/MColbrook/NLA-formal-verification-20-problems/tree/d46c1b54e85af6790d3ac0df59a9bbe8d2faaf4d","json":"https://data.palomar-registry.org/entries/PALOMAR-2026-11-21-000005-v1.json","repo":"https://github.com/MColbrook/NLA-formal-verification-20-problems","tags":["math.NA","math.FA","math.PR","math.AG","cs.CC","msc:15A18","msc:15A23","msc:15A45","msc:15A60","msc:15A69"],"score":0,"title":"Numerical Linear Algebra, Explained: Twenty Problem Resolutions","trust":"high","domain":"math.NA","source":"palomar","authors":["Matthew J. Colbrook","George Stepaniants"],"reviews":0,"subject":"math.NA","summary":"Lean formalizations accompanying twenty numerical linear algebra problem resolutions. They give uniform matrix-product growth and local 1/d-Hölder continuity of the joint spectral radius; two real generators with any prescribed nonnegative polynomial growth exponent; and sharp losses 2^r and 4^r for randomly pivoted Cholesky and LU. They show that concave matrix functions can destroy spectral approximation guarantees and amplify nuclear-norm excess without bound, and give sharp Frobenius transfer bounds with and without semidefinite order. Further results are the random-row adversarial…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"verified":true,"discussed":0,"published":"2026-11-21","reactions":{},"formalized":true,"formalizes":[{"title":"Numerical Linear Algebra, Explained: Twenty Problem Resolutions","identifier":"urn:sha256:b66976c1efa4f625f3b380fef6e945ddf4d7beea6e1b264e2f87d6790548bba5","relationship":"formalizes"}]}