Proszę używać tego identyfikatora do cytowań lub wstaw link do tej pozycji:
http://hdl.handle.net/11320/9013
Pełny rekord metadanych
Pole DC | Wartość | Język |
---|---|---|
dc.contributor.author | Schwarzweller, Christoph | - |
dc.date.accessioned | 2020-04-16T11:19:44Z | - |
dc.date.available | 2020-04-16T11:19:44Z | - |
dc.date.issued | 2019 | - |
dc.identifier.citation | Formalized Mathematics, Volume 27, Issue 3, Pages 229–235 | pl |
dc.identifier.issn | 1426-2630 | - |
dc.identifier.uri | http://hdl.handle.net/11320/9013 | - |
dc.description.abstract | This is the fourth part of a four-article series containing a Mizar [3], [2], [1] 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]/<p> as the desired field extension E [6], [4], [5]. In the first part we show that an irreducible polynomial p ∈ F [X]\F has a root over F [X]/<p>. Note, however, that this statement cannot be true in a rigid formal sense: We do not have F ⊆ F [X]/ < p > as sets, so F is not a subfield of F [X]/<p>, and hence formally p is not even a polynomial over F [X]/ < p >. Consequently, we translate p along the canonical monomorphism ϕ: F → F [X]/<p> and show that the translated polynomial ϕ (p) has a root over F [X]/<p>. Because F is not a subfield of F [X]/<p> 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]/<p> and therefore consider F as a subfield of F [X]/<p>”. 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 arbitrary 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 this fourth part we finally define field extensions: E is a field extension of F iff 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]/<p> with the canonical monomorphism ϕ: F → F [X]/<p>. 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. | pl |
dc.language.iso | en | pl |
dc.publisher | DeGruyter Open | pl |
dc.rights | Uznanie autorstwa-Na tych samych warunkach 3.0 Polska | * |
dc.rights.uri | http://creativecommons.org/licenses/by-sa/3.0/pl/ | * |
dc.subject | roots of polynomials | pl |
dc.subject | field extensions | pl |
dc.subject | Kronecker’s construction | pl |
dc.title | Field Extensions and Kronecker’s Construction | pl |
dc.type | Article | pl |
dc.identifier.doi | 10.2478/forma-2019-0022 | - |
dc.description.Affiliation | Institute of Informatics, University of Gdansk, Poland | pl |
dc.description.references | Grzegorz Bancerek, Czesław Bylinski, Adam Grabowski, Artur Korniłowicz, Roman Matuszewski, Adam Naumowicz, and Karol Pak. 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. | pl |
dc.description.references | Adam Grabowski, Artur Korniłowicz, and Adam Naumowicz. Four decades of Mizar. Journal of Automated Reasoning, 55(3):191–198, 2015. doi:10.1007/s10817-015-9345-1. | pl |
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. | pl |
dc.description.references | Nathan Jacobson. Basic Algebra I. Dover Books on Mathematics, 1985. | pl |
dc.description.references | Heinz Lüneburg. Gruppen, Ringe, Körper: Die grundlegenden Strukturen der Algebra. Oldenbourg Verlag, 1999. | pl |
dc.description.references | Knut Radbruch. Algebra I. Lecture Notes, University of Kaiserslautern, Germany, 1991. | pl |
dc.identifier.eissn | 1898-9934 | - |
dc.description.volume | 27 | - |
dc.description.issue | 3 | - |
dc.description.firstpage | 229 | pl |
dc.description.lastpage | 235 | pl |
dc.identifier.citation2 | Formalized Mathematics | pl |
dc.identifier.orcid | 0000-0001-9587-8737 | - |
Występuje w kolekcji(ach): | Formalized Mathematics, 2019, Volume 27, Issue 3 |
Pliki w tej pozycji:
Plik | Opis | Rozmiar | Format | |
---|---|---|---|---|
forma_2019_27_3_0022.pdf | 263,99 kB | Adobe PDF | Otwórz |
Pozycja ta dostępna jest na podstawie licencji Licencja Creative Commons CCL