Improving the Fundamental Theorem of Algebra
@article{Shipman2007ImprovingTF, title={Improving the Fundamental Theorem of Algebra}, author={Joseph C. Shipman}, journal={The Mathematical Intelligencer}, year={2007}, volume={29}, pages={9-14} }
ConclusionTheorems 2 and 3 establish the minimum algebraic conditions necessary for a field to be algebraically closed, and they can therefore be said to “optimize” the Fundamental Theorem of Algebra. But each specific“degree implication” is a first-order consequence of the axioms for fields, and could have been discovered two centuries ago; the existence of these finitary relationships appears to have been unsuspected by practically everyone, with one important exception.
8 Citations
Addendum to: "An algebraic proof of the fundamental theorem of algebra"
- Mathematics
- 2018
We prove the fundamental theorem of algebra (FTA on brief) by using linear algebra. The proof which arises from a new equivalent reformulation of FTA also works for any infinite field, having root…
A NOTE ON THE FUNDAMENTAL THEOREM OF ALGEBRA
- MathematicsBulletin of the Australian Mathematical Society
- 2018
The algebraic proof of the fundamental theorem of algebra uses two facts about real numbers. First, every polynomial with odd degree and real coefficients has a real root. Second, every nonnegative…
STRICTLY REAL FUNDAMENTAL THEOREM OF ALGEBRA USING POLYNOMIAL INTERLACING
- MathematicsBulletin of the Australian Mathematical Society
- 2021
Abstract Without resorting to complex numbers or any advanced topological arguments, we show that any real polynomial of degree greater than two always has a real quadratic polynomial factor, which…
A generalization of Descartes' rule of signs and fundamental theorem of algebra
- MathematicsAppl. Math. Comput.
- 2011
On Maximal and Minimal Linear Matching Property
- Mathematics
- 2015
The matching basis in field extentions is introduced by S. Eliahou and C. Lecouvey in [2]. In this paper we define the minimal and maximal linear matching property for field extensions and prove that…
Quantifier elimination for quasi-real closed fields
- Mathematics
- 2020
We prove quantifier elimination for the theory of quasi-real closed fields with a compatible valuation. This unifies the same known results for algebraically closed valued fields and real closed…
On the Fundamental Theorem of Algebra
- Mathematics, PhilosophyAm. Math. Mon.
- 2006
One of the simplest proofs that every nontrivial polynomial P has a zero goes as follows. Observe that |P(z)| → ∞ as |z| → ∞, so we may find an R > 0 with |P(z)| > |P(0)| for all |z| ≥ R. Since any…
References
SHOWING 1-4 OF 4 REFERENCES
The Fundamental Theorem of Algebra
- Mathematics
- 1997
The fundamental theorem of algebra states that any complex polynomial must have a complex root. This book examines three pairs of proofs of the theorem from three different areas of mathematics:…
A Decision Method For Elementary Algebra And Geometry
- Mathematics
- 1951
By a decision method for a class K of sentence (or other expressions) is meant a method by means of which, given any sentence θ, one can always decide in a finite number of steps whether θ is in K;…