Proszę używać tego identyfikatora do cytowań lub wstaw link do tej pozycji:
http://hdl.handle.net/11320/8126
Pełny rekord metadanych
Pole DC | Wartość | Język |
---|---|---|
dc.contributor.author | Schwarzweller, Christoph | - |
dc.date.accessioned | 2019-07-29T08:28:45Z | - |
dc.date.available | 2019-07-29T08:28:45Z | - |
dc.date.issued | 2019 | - |
dc.identifier.citation | Formalized Mathematics, Volume 27, Issue 2, Pages 93 - 100 | - |
dc.identifier.issn | 1426-2630 | - |
dc.identifier.uri | http://hdl.handle.net/11320/8126 | - |
dc.description.abstract | This is the first part of a four-article series containing a Mizar [3], [1], [2] formalization of Kronecker’s construction about roots of polynomials in field extensions, i.e. that for every field F and every polynomial p ∈ F [X]\F there exists a field extension E of F such that p has a root over E. The formalization follows Kronecker’s classical proof using F [X]/ as the desired field extension E [9], [4], [6].In this first part we show that an irreducible polynomial p ∈ F [X]\F has a root over F [X]/. Note, however, that this statement cannot be true in a rigid formal sense: We do not have F ⊆ [X]/ as sets, so F is not a subfield of F [X]/, and hence formally p is not even a polynomial over F [X]/. Consequently, we translate p along the canonical monomorphism ϕ: F → F [X]/ and show that the translated polynomial ϕ(p) has a root over F [X]/.Because F is not a subfield of F [X]/ we construct in the second part the field (E \ ϕF )∪F for a given monomorphism ϕ : F → E and show that this field both is isomorphic to F and includes F as a subfield. In the literature this part of the proof usually consists of saying that “one can identify F with its image ϕF in F [X]/ and therefore consider F as a subfield of F [X]/”. Interestingly, to do so we need to assume that F ∩ E =∅, in particular Kronecker’s construction can be formalized for fields F with F \ F [X] =∅.Surprisingly, as we show in the third part, this condition is not automatically true for arbitray fields F : With the exception of 2 we construct for every field F an isomorphic copy F′ of F with F′ ∩ F′ [X] ≠∅. We also prove that for Mizar’s representations of n, and we have n ∩ n[X] = ∅, ∩ [X] = ∅and ∩ [X] = ∅, respectively.In the fourth part we finally define field extensions: E is a field extension of F i F is a subfield of E. Note, that in this case we have F ⊆ E as sets, and thus a polynomial p over F is also a polynomial over E. We then apply the construction of the second part to F [X]/ with the canonical monomorphism ϕ : F → F [X]/. Together with the first part this gives - for fields F with F ∩ F [X] = ∅ - a field extension E of F in which p ∈ F [X]\F has a root. | - |
dc.language.iso | en | - |
dc.publisher | DeGruyter Open | - |
dc.subject | roots of polynomials | - |
dc.subject | field extensions | - |
dc.subject | Kronecker’s construction | - |
dc.subject | 12E05 | - |
dc.subject | 12F05 | - |
dc.subject | 68T99 | - |
dc.subject | 03B35 | - |
dc.title | On Roots of Polynomials over F[X]/ 〈p〉 | - |
dc.type | Article | - |
dc.identifier.doi | 10.2478/forma-2019-0010 | - |
dc.description.Affiliation | Institute of Informatics, University of Gdańsk, Poland | - |
dc.description.references | Grzegorz Bancerek, Czesław Byliński, Adam Grabowski, Artur Korniłowicz, Roman Matuszewski, Adam Naumowicz, Karol Pąk, and Josef Urban. Mizar: State-of-the-art and beyond. In Manfred Kerber, Jacques Carette, Cezary Kaliszyk, Florian Rabe, and Volker Sorge, editors, Intelligent Computer Mathematics, volume 9150 of Lecture Notes in Computer Science, pages 261–279. Springer International Publishing, 2015. ISBN 978-3-319-20614-1. doi:10.1007/978-3-319-20615-8_17. | - |
dc.description.references | Grzegorz Bancerek, Czesław Byliński, Adam Grabowski, Artur Korniłowicz, Roman Matuszewski, Adam Naumowicz, and Karol Pąk. The role of the Mizar Mathematical Library for interactive proof development in Mizar. Journal of Automated Reasoning, 61(1):9–32, 2018. doi:10.1007/s10817-017-9440-6. | - |
dc.description.references | Adam Grabowski, Artur Korniłowicz, and Christoph Schwarzweller. On algebraic hierarchies in mathematical repository of Mizar. In M. Ganzha, L. Maciaszek, and M. Paprzycki, editors, Proceedings of the 2016 Federated Conference on Computer Science and Information Systems (FedCSIS), volume 8 of Annals of Computer Science and Information Systems, pages 363–371, 2016. doi:10.15439/2016F520. | - |
dc.description.references | Nathan Jacobson. Basic Algebra I. Dover Books on Mathematics, 1985. | - |
dc.description.references | Artur Korniłowicz and Christoph Schwarzweller. The first isomorphism theorem and other properties of rings. Formalized Mathematics, 22(4):291–301, 2014. doi:10.2478/forma-2014-0029. | - |
dc.description.references | Heinz Lüneburg. Gruppen, Ringe, Körper: Die grundlegenden Strukturen der Algebra. Oldenbourg Verlag, 1999. | - |
dc.description.references | Robert Milewski. The evaluation of polynomials. Formalized Mathematics, 9(2):391–395, 2001. | - |
dc.description.references | Robert Milewski. Fundamental theorem of algebra. Formalized Mathematics, 9(3):461–470, 2001. | - |
dc.description.references | Knut Radbruch. Algebra I. Lecture Notes, University of Kaiserslautern, Germany, 1991. | - |
dc.description.references | Christoph Schwarzweller. The binomial theorem for algebraic structures. Formalized Mathematics, 9(3):559–564, 2001. | - |
dc.identifier.eissn | 1898-9934 | - |
dc.description.volume | 27 | - |
dc.description.issue | 2 | - |
dc.description.firstpage | 93 | - |
dc.description.lastpage | 100 | - |
dc.identifier.citation2 | Formalized Mathematics | - |
dc.identifier.orcid | 0000-0001-9587-8737 | - |
Występuje w kolekcji(ach): | Formalized Mathematics, 2019, Volume 27, Issue 2 |
Pliki w tej pozycji:
Plik | Opis | Rozmiar | Format | |
---|---|---|---|---|
forma_2019_27_2_001.pdf | 255,6 kB | Adobe PDF | Otwórz |
Pozycja ta dostępna jest na podstawie licencji Licencja Creative Commons CCL