Currently displaying 1 – 20 of 33

Showing per page

Order by Relevance | Title | Year of publication

Collective Operations on Number-Membered Sets

Artur Korniłowicz — 2009

Formalized Mathematics

The article starts with definitions of sets of opposite and inverse numbers of a given number membered set. Next, collective addition, subtraction, multiplication and division of two sets are defined. Complex numbers cases and extended real numbers ones are introduced separately and unified for reals. Shortcuts for singletons cases are also defined.

Cayley's Theorem

Artur Korniłowicz — 2011

Formalized Mathematics

The article formalizes the Cayley's theorem saying that every group G is isomorphic to a subgroup of the symmetric group on G.

Cayley-Dickson Construction

Artur Korniłowicz — 2012

Formalized Mathematics

Cayley-Dickson construction produces a sequence of normed algebras over real numbers. Its consequent applications result in complex numbers, quaternions, octonions, etc. In this paper we formalize the construction and prove its basic properties.

Mazur-Ulam Theorem

Artur Korniłowicz — 2011

Formalized Mathematics

The Mazur-Ulam theorem [15] has been formulated as two registrations: cluster bijective isometric -> midpoints-preserving Function of E, F; and cluster isometric midpoints-preserving -> Affine Function of E, F; A proof given by Jussi Väisälä [23] has been formalized.

The First Isomorphism Theorem and Other Properties of Rings

Artur KorniłowiczChristoph Schwarzweller — 2014

Formalized Mathematics

Different properties of rings and fields are discussed [12], [41] and [17]. We introduce ring homomorphisms, their kernels and images, and prove the First Isomorphism Theorem, namely that for a homomorphism f : R → S we have R/ker(f) ≅ Im(f). Then we define prime and irreducible elements and show that every principal ideal domain is factorial. Finally we show that polynomial rings over fields are Euclidean and hence also factorial

Basic Operations on Preordered Coherent Spaces

Klaus GrueArtur Korniłowicz — 2007

Formalized Mathematics

This Mizar paper presents the definition of a "Preordered Coherent Space" (PCS). Furthermore, the paper defines a number of operations on PCS's and states and proves a number of elementary lemmas about these operations. PCS's have many useful properties which could qualify them for mathematical study in their own right. PCS's were invented, however, to construct Scott domains, to solve domain equations, and to construct models of various versions of lambda calculus.For more on PCS's, see [11]. The...

Basel Problem

Karol PąkArtur Korniłowicz — 2017

Formalized Mathematics

A rigorous elementary proof of the Basel problem [6, 1] ∑n=1∞1n2=π26 n = 1 1 n 2 = π 2 6 is formalized in the Mizar system [3]. This theorem is item 14 from the “Formalizing 100 Theorems” list maintained by Freek Wiedijk at http://www.cs.ru.nl/F.Wiedijk/100/.

Vieta’s Formula about the Sum of Roots of Polynomials

Artur KorniłowiczKarol Pąk — 2017

Formalized Mathematics

In the article we formalized in the Mizar system [2] the Vieta formula about the sum of roots of a polynomial anxn + an−1xn−1 + ··· + a1x + a0 defined over an algebraically closed field. The formula says that [...] x1+x2+⋯+xn−1+xn=−an−1an x 1 + x 2 + + x n - 1 + x n = - a n - 1 a n , where x1, x2,…, xn are (not necessarily distinct) roots of the polynomial [12]. In the article the sum is denoted by SumRoots.

Introduction to Liouville Numbers

Adam GrabowskiArtur Korniłowicz — 2017

Formalized Mathematics

The article defines Liouville numbers, originally introduced by Joseph Liouville in 1844 [17] as an example of an object which can be approximated “quite closely” by a sequence of rational numbers. A real number x is a Liouville number iff for every positive integer n, there exist integers p and q such that q > 1 and [...] It is easy to show that all Liouville numbers are irrational. Liouville constant, which is also defined formally, is the first transcendental (not algebraic) number. It is...

Page 1 Next

Download Results (CSV)