Let ω(G) and χ(G) be the clique number and the chromatic number of a graph G. Mycielski  presented a construction that for any n creates a graph Mn which is triangle-free (ω(G) = 2) with χ(G) > n. The starting point is the complete graph of two vertices (K2). M(n+1) is obtained from Mn through the operation μ(G) called the Mycielskian of a graph G.We first define the operation μ(G) and then...
In this article we introduced the isomorphism mapping between cartesian products of family of linear spaces . Those products had been formalized by two different ways, i.e., the way using the functor [:X, Y:] and ones using the functor "product". By the same way, the isomorphism mapping was defined between Cartesian products of family of linear normed spaces also.
In this article, we give some important theorems of forward difference, backward difference, central difference and difference quotient and forward difference, backward difference, central difference and difference quotient formulas of some special functions.
In this article, we define the Riemann integral on functions from R into real normed space and prove the linearity of this operator. As a result, the Riemann integration can be applied to a wider range of functions. The proof method follows the .
In this article, we formalize integral linear spaces, that is a linear space with integer coefficients. Integral linear spaces are necessary for lattice problems, LLL (Lenstra-Lenstra-Lovász) base reduction algorithm that outputs short lattice base and cryptographic systems with lattice .
In  it was formalized that the direct product of a family of groups gives a new group. In this article, we formalize that for all j ∈ I, the group G = Πi∈IGi has a normal subgroup isomorphic to Gj. Moreover, we show some relations between a family of groups and its direct product.
In this article, we aim to prove the characterization of differentiation by means of partial differentiation for vector-valued functions on n-dimensional real normed linear spaces (refer to  and ).
The Veblen hierarchy is an extension of the construction of epsilon numbers (fixpoints of the exponential map: ωε = ε). It is a collection φα of the Veblen Functions where φ0(β) = ωβ and φ1(β) = εβ. The sequence of fixpoints of φ1 function form φ2, etc. For a limit non empty ordinal λ the function φλ is the sequence of common fixpoints of all functions φα where α < λ.The Mizar formalization of...
We introduce linear transformations of Euclidean topological spaces given by a transformation matrix. Next, we prove selected properties and basic arithmetic operations on these linear transformations. Finally, we show that a linear transformation given by an invertible matrix is a homeomorphism.
We formulate a few basic concepts of J. H. Conway's theory of games based on his book . This is a first step towards formalizing Conway's theory of numbers into Mizar, which is an approach to proving the existence of a FIELD (i.e., a proper class that satisfies the axioms of a real-closed field) that includes the reals and ordinals, thus providing a uniform, independent and simple approach to these...
Financed by the National Centre for Research and Development under grant No. SP/I/1/77065/10 by the strategic scientific research and experimental development program:
SYNAT - “Interdisciplinary System for Interactive Scientific and Scientific-Technical Information”.