Bergman's Centralizer Theorem and quantization
Alexei Kanel Belov, Farrokh Razavinia, Wenchao Zhang

TL;DR
This paper proves Bergman's Centralizer Theorem using generic matrices and Kontsevich's quantization, showing that centralizers in free associative algebras are polynomial rings in one variable, with no higher transcendence commutative subalgebras.
Contribution
It provides a new proof of Bergman's theorem employing quantization techniques and characterizes the structure of centralizers in free associative algebras over fields of positive characteristic.
Findings
Centralizers are polynomial rings in one variable.
No commutative subalgebra with transcendent degree ≥ 2 exists.
The proof uses generic matrices and Kontsevich's quantization method.
Abstract
We prove Bergman's theorem on centralizers by using generic matrices and Kontsevich's quantization method. For any field of positive characteristics, set be a free associative algebra, then any centralizer of nontrivial element is a ring of polynomials on a single variable. We also prove that there is no commutative subalgebra with transcendent degree of .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
