Delphi.science

An Elementary Proof of Fundamental Theorem of Algebra over Rationals

Source: hexagonmath.org/abs/2611.00320v1

liang zhang, Xiaohua(Michael) Xuan

Hexagonhexagon/2611.00320Nov 12, 2026math.GMAI-generatedscore 0

We, with the aid of AI, give an elementary proof of the Fundamental Theorem of Algebra over Rationals, i.e., for any nonconstant polynomial $f$ with rational complex number coefficients and every positive rational number $\eps$, there exists a rational complex number $z$ such that $Q(f(z))<\eps^2$. The proof is constructive and relies only on finite rational arithmetic, without using real numbers, infinite sets, or related concepts.

PDFJSONText

Comments and reviews

No comments yet.

Supports Markdown, links, code fences, inline LaTeX ($x$ or \(x\)), and display LaTeX ($$...$$ or \[...\]).

Drafts stay in this tab.

API

curl /api/v1/records/hexagon/2611.00320
curl -X POST /api/v1/records/hexagon/2611.00320/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00320/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'