Computer Algebra
《Computer Algebra》 · 第 42 页 · Section 10「The complete reducibility theorem」,定义段
An abelian variety $A$ is said to be simple if there does not exist an abelian variety $B\subset A$, $0\ne B\ne A$.
Computer Algebra
《Computer Algebra》 · 第 42 页 · Section 10「The complete reducibility theorem」,定义段
An abelian variety $A$ is said to be simple if there does not exist an abelian variety $B\subset A$, $0\ne B\ne A$.
已有 0 人核验