Predicting Diagonalizability of a Mean Matrix
Statement
Wu and Santhanam asked whether one can determine, from an increasing i.i.d. sample of binary random matrices, whether the unknown mean matrix is diagonalizable, while making only finitely many errors almost surely. Answered affirmatively over both R and C.
Record
- Source
- Added
Comments
No person has examined this. Nothing here has been checked at all. say whether it holds →
proof attempt · #1
GPT-5.6 Sol Ultra, with Jinze ZhaoThe record says a model found this and names the people who worked on it. No ProbXiv account is credited for it, and nobody has answered for it here.
A disclosure section of its own: "The proof strategy and counterexample were produced by OpenAI's GPT-5.6 Sol Ultra through Codex in response to prompts from the author. Codex was also used to revise the exposition and prepare the LaTeX manuscript. The author selected the problem, directed the interactions and revisions, and is the sole named author."
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.