1.
Mathematics
–
Mathematics is the study of topics such as quantity, structure, space, and change. There is a range of views among mathematicians and philosophers as to the exact scope, Mathematicians seek out patterns and use them to formulate new conjectures. Mathematicians resolve the truth or falsity of conjectures by mathematical proof, when mathematical structures are good models of real phenomena, then mathematical reasoning can provide insight or predictions about nature. Through the use of abstraction and logic, mathematics developed from counting, calculation, measurement, practical mathematics has been a human activity from as far back as written records exist. The research required to solve mathematical problems can take years or even centuries of sustained inquiry, rigorous arguments first appeared in Greek mathematics, most notably in Euclids Elements. Galileo Galilei said, The universe cannot be read until we have learned the language and it is written in mathematical language, and the letters are triangles, circles and other geometrical figures, without which means it is humanly impossible to comprehend a single word. Without these, one is wandering about in a dark labyrinth, carl Friedrich Gauss referred to mathematics as the Queen of the Sciences. Benjamin Peirce called mathematics the science that draws necessary conclusions, David Hilbert said of mathematics, We are not speaking here of arbitrariness in any sense. Mathematics is not like a game whose tasks are determined by arbitrarily stipulated rules, rather, it is a conceptual system possessing internal necessity that can only be so and by no means otherwise. Albert Einstein stated that as far as the laws of mathematics refer to reality, they are not certain, Mathematics is essential in many fields, including natural science, engineering, medicine, finance and the social sciences. Applied mathematics has led to entirely new mathematical disciplines, such as statistics, Mathematicians also engage in pure mathematics, or mathematics for its own sake, without having any application in mind. There is no clear line separating pure and applied mathematics, the history of mathematics can be seen as an ever-increasing series of abstractions. The earliest uses of mathematics were in trading, land measurement, painting and weaving patterns, in Babylonian mathematics elementary arithmetic first appears in the archaeological record. Numeracy pre-dated writing and numeral systems have many and diverse. Between 600 and 300 BC the Ancient Greeks began a study of mathematics in its own right with Greek mathematics. Mathematics has since been extended, and there has been a fruitful interaction between mathematics and science, to the benefit of both. Mathematical discoveries continue to be made today, the overwhelming majority of works in this ocean contain new mathematical theorems and their proofs. The word máthēma is derived from μανθάνω, while the modern Greek equivalent is μαθαίνω, in Greece, the word for mathematics came to have the narrower and more technical meaning mathematical study even in Classical times
2.
Set theory
–
Set theory is a branch of mathematical logic that studies sets, which informally are collections of objects. Although any type of object can be collected into a set, set theory is applied most often to objects that are relevant to mathematics, the language of set theory can be used in the definitions of nearly all mathematical objects. The modern study of set theory was initiated by Georg Cantor, Set theory is commonly employed as a foundational system for mathematics, particularly in the form of Zermelo–Fraenkel set theory with the axiom of choice. Beyond its foundational role, set theory is a branch of mathematics in its own right, contemporary research into set theory includes a diverse collection of topics, ranging from the structure of the real number line to the study of the consistency of large cardinals. Mathematical topics typically emerge and evolve through interactions among many researchers, Set theory, however, was founded by a single paper in 1874 by Georg Cantor, On a Property of the Collection of All Real Algebraic Numbers. Since the 5th century BC, beginning with Greek mathematician Zeno of Elea in the West and early Indian mathematicians in the East, especially notable is the work of Bernard Bolzano in the first half of the 19th century. Modern understanding of infinity began in 1867–71, with Cantors work on number theory, an 1872 meeting between Cantor and Richard Dedekind influenced Cantors thinking and culminated in Cantors 1874 paper. Cantors work initially polarized the mathematicians of his day, while Karl Weierstrass and Dedekind supported Cantor, Leopold Kronecker, now seen as a founder of mathematical constructivism, did not. This utility of set theory led to the article Mengenlehre contributed in 1898 by Arthur Schoenflies to Kleins encyclopedia, in 1899 Cantor had himself posed the question What is the cardinal number of the set of all sets. Russell used his paradox as a theme in his 1903 review of continental mathematics in his The Principles of Mathematics, in 1906 English readers gained the book Theory of Sets of Points by William Henry Young and his wife Grace Chisholm Young, published by Cambridge University Press. The momentum of set theory was such that debate on the paradoxes did not lead to its abandonment, the work of Zermelo in 1908 and Abraham Fraenkel in 1922 resulted in the set of axioms ZFC, which became the most commonly used set of axioms for set theory. The work of such as Henri Lebesgue demonstrated the great mathematical utility of set theory. Set theory is used as a foundational system, although in some areas category theory is thought to be a preferred foundation. Set theory begins with a binary relation between an object o and a set A. If o is a member of A, the notation o ∈ A is used, since sets are objects, the membership relation can relate sets as well. A derived binary relation between two sets is the relation, also called set inclusion. If all the members of set A are also members of set B, then A is a subset of B, for example, is a subset of, and so is but is not. As insinuated from this definition, a set is a subset of itself, for cases where this possibility is unsuitable or would make sense to be rejected, the term proper subset is defined
3.
Cardinality
–
In mathematics, the cardinality of a set is a measure of the number of elements of the set. For example, the set A = contains 3 elements, there are two approaches to cardinality – one which compares sets directly using bijections and injections, and another which uses cardinal numbers. The cardinality of a set is called its size, when no confusion with other notions of size is possible. The cardinality of a set A is usually denoted | A |, with a bar on each side, this is the same notation as absolute value. Alternatively, the cardinality of a set A may be denoted by n, A, card, while the cardinality of a finite set is just the number of its elements, extending the notion to infinite sets usually starts with defining the notion of comparison of arbitrary sets. Two sets A and B have the same cardinality if there exists a bijection, that is, such sets are said to be equipotent, equipollent, or equinumerous. This relationship can also be denoted A≈B or A~B, for example, the set E = of non-negative even numbers has the same cardinality as the set N = of natural numbers, since the function f = 2n is a bijection from N to E. A has cardinality less than or equal to the cardinality of B if there exists a function from A into B. A has cardinality less than the cardinality of B if there is an injective function. If | A | ≤ | B | and | B | ≤ | A | then | A | = | B |, the axiom of choice is equivalent to the statement that | A | ≤ | B | or | B | ≤ | A | for every A, B. That is, the cardinality of a set was not defined as an object itself. However, such an object can be defined as follows, the relation of having the same cardinality is called equinumerosity, and this is an equivalence relation on the class of all sets. The equivalence class of a set A under this relation then consists of all sets which have the same cardinality as A. There are two ways to define the cardinality of a set, The cardinality of a set A is defined as its class under equinumerosity. A representative set is designated for each equivalence class, the most common choice is the initial ordinal in that class. This is usually taken as the definition of number in axiomatic set theory. Assuming AC, the cardinalities of the sets are denoted ℵ0 < ℵ1 < ℵ2 < …. For each ordinal α, ℵ α +1 is the least cardinal number greater than ℵ α
4.
Hebrew alphabet
–
Historically, there have been two separate abjad scripts to write Hebrew. In the remainder of this article, the term Hebrew alphabet refers to the Jewish square script unless otherwise indicated, the Hebrew alphabet has 22 letters. It does not have case, but five letters have different forms used at the end of a word. Hebrew is written right to left. Originally, the alphabet was an abjad consisting only of consonants, as with other abjads, such as the Arabic alphabet, scribes later devised means of indicating vowel sounds by separate vowel points, known in Hebrew as niqqud. In both biblical and rabbinic Hebrew, the letters א ה ו י are also used as matres lectionis to represent vowels. There is a trend in modern Modern Hebrew toward the use of matres lectionis to indicate vowels that have traditionally gone unwritten, the paleo-Hebrew alphabet was used in the ancient kingdoms of Israel and Judah. The Samaritans, who remained in the Land of Israel, continued to use the paleo-Hebrew alphabet, after the fall of the Persian Empire in 330 BCE, Jews used both scripts before settling on the Assyrian form. The square Hebrew alphabet was adapted and used for writing languages of the Jewish diaspora – such as Karaim, the Judeo-Arabic languages, Judaeo-Spanish. In the traditional form, the Hebrew alphabet is an abjad consisting only of consonants and it has 22 letters, five of which use different forms at the end of a word. Also, a system of points to indicate vowels, called niqqud, was developed. In modern forms of the alphabet, as in the case of Yiddish and to some extent Modern Hebrew, today, the trend is toward full spelling with the weak letters acting as true vowels. When used to write Yiddish, vowels are indicated, using letters, either with or without niqqud-diacritics, except for Hebrew words. To preserve the proper vowel sounds, scholars developed several different sets of vocalization, one of these, the Tiberian system, eventually prevailed. Aaron ben Moses ben Asher, and his family for generations, are credited for refining and maintaining the system. These points are used only for special purposes, such as Biblical books intended for study. The Tiberian system also includes a set of marks, called trope. These are shown below the normal form in the following table, although Hebrew is read and written from right to left, the following table shows the letters in order from left to right
5.
Aleph
–
Aleph is the first letter of the Semitic abjads, including Phoenician Ālep, Hebrew Ālef א, Aramaic Ālap
6.
Monotype Imaging
–
Monotype Imaging Holdings, Inc. is a Delaware corporation based in Woburn, Massachusetts. It specialises in digital typesetting and typeface design as well as text, Monotype developed many of the most widely used typeface designs, including Times New Roman, Gill Sans, Arial, Bembo and Albertus. Monotype has carried out a series of acquisitions from 2000 onwards of companies such as Linotype GmbH, International Typeface Corporation, Bitstream Inc. and FontShop. This has gained it the rights to many further widely known designs, including Helvetica, ITC Franklin Gothic, Optima, Avant Garde, Palatino and it also owns the MyFonts online retailer used by many independent font design studios. The Lanston Monotype Machine Company was founded by Tolbert Lanston in Philadelphia, Pennsylvania, Lanston had a patented mechanical method of punching out metal types from cold strips of metal which were set into a matrix for the printing press. In 1896 Lanston patented the first hot metal typesetting machine and Monotype issued Modern Condensed, the licenses for the Lanston type library have been acquired by P22, a digital type foundry based in Buffalo, New York. In a search for funding, the set up a branch in London in 1897 under the name Lanston Monotype Corporation Ltd. In 1899 a new factory was built in Salfords near Redhill in Surrey where it has located for over a century. The company was of sufficient size to justify the construction of its own Salfords railway station, the Monotype machine worked by casting letters from hot metal as pieces of type. Thus spelling mistakes could be corrected by adding or removing individual letters and this was particularly useful for quality printing - such as books. In contrast, the Linotype machine formed a line of type in one bar. Editing these required replacing an entire line, but Linotype slugs were easier to handle if moving a complete section of text around a page. This was more useful for quick printing - such as newspapers, the typesetting machines were continually improved in the early years of the 20th century, with a typewriter style keyboard for entering the type being introduced in 1906. This arrangement addressed the need to vary the space between words so that all lines were the same length, the keyboard operator types the copy, each key punching holes in a roll of paper tape that will control the separate caster. A drum on the keyboard indicates to the operator the space required for each line and this information is also punched in the paper. Before fitting the tape to the caster it is turned over so that the first holes read on each set the width of the variable space. The subsequent holes determine the position of a frame, or die case, each matrix is a rectangle of copper recessed with the shape of the letter. Once the matrix is positioned over the mould that forms the rest of the piece of type being cast, Monotypes role in design history is not merely due to their supply of printing equipment but due to their commissioning of many of the most important typefaces of the twentieth century
7.
Natural number
–
In mathematics, the natural numbers are those used for counting and ordering. In common language, words used for counting are cardinal numbers, texts that exclude zero from the natural numbers sometimes refer to the natural numbers together with zero as the whole numbers, but in other writings, that term is used instead for the integers. These chains of extensions make the natural numbers canonically embedded in the number systems. Properties of the numbers, such as divisibility and the distribution of prime numbers, are studied in number theory. Problems concerning counting and ordering, such as partitioning and enumerations, are studied in combinatorics, the most primitive method of representing a natural number is to put down a mark for each object. Later, a set of objects could be tested for equality, excess or shortage, by striking out a mark, the first major advance in abstraction was the use of numerals to represent numbers. This allowed systems to be developed for recording large numbers, the ancient Egyptians developed a powerful system of numerals with distinct hieroglyphs for 1,10, and all the powers of 10 up to over 1 million. A stone carving from Karnak, dating from around 1500 BC and now at the Louvre in Paris, depicts 276 as 2 hundreds,7 tens, and 6 ones, and similarly for the number 4,622. A much later advance was the development of the idea that 0 can be considered as a number, with its own numeral. The use of a 0 digit in place-value notation dates back as early as 700 BC by the Babylonians, the Olmec and Maya civilizations used 0 as a separate number as early as the 1st century BC, but this usage did not spread beyond Mesoamerica. The use of a numeral 0 in modern times originated with the Indian mathematician Brahmagupta in 628, the first systematic study of numbers as abstractions is usually credited to the Greek philosophers Pythagoras and Archimedes. Some Greek mathematicians treated the number 1 differently than larger numbers, independent studies also occurred at around the same time in India, China, and Mesoamerica. In 19th century Europe, there was mathematical and philosophical discussion about the nature of the natural numbers. A school of Naturalism stated that the numbers were a direct consequence of the human psyche. Henri Poincaré was one of its advocates, as was Leopold Kronecker who summarized God made the integers, in opposition to the Naturalists, the constructivists saw a need to improve the logical rigor in the foundations of mathematics. In the 1860s, Hermann Grassmann suggested a recursive definition for natural numbers thus stating they were not really natural, later, two classes of such formal definitions were constructed, later, they were shown to be equivalent in most practical applications. The second class of definitions was introduced by Giuseppe Peano and is now called Peano arithmetic and it is based on an axiomatization of the properties of ordinal numbers, each natural number has a successor and every non-zero natural number has a unique predecessor. Peano arithmetic is equiconsistent with several systems of set theory
8.
Cardinal number
–
In mathematics, cardinal numbers, or cardinals for short, are a generalization of the natural numbers used to measure the cardinality of sets. The cardinality of a set is a natural number, the number of elements in the set. The transfinite cardinal numbers describe the sizes of infinite sets, cardinality is defined in terms of bijective functions. Two sets have the same cardinality if, and only if, in the case of finite sets, this agrees with the intuitive notion of size. In the case of sets, the behavior is more complex. It is also possible for a subset of an infinite set to have the same cardinality as the original set. There is a sequence of cardinal numbers,0,1,2,3, …, n, …, ℵ0, ℵ1, ℵ2, …, ℵ α, …. This sequence starts with the natural numbers including zero, which are followed by the aleph numbers, the aleph numbers are indexed by ordinal numbers. Under the assumption of the axiom of choice, this transfinite sequence includes every cardinal number, If one rejects that axiom, the situation is more complicated, with additional infinite cardinals that are not alephs. Cardinality is studied for its own sake as part of set theory and it is also a tool used in branches of mathematics including model theory, combinatorics, abstract algebra, and mathematical analysis. In category theory, the numbers form a skeleton of the category of sets. The notion of cardinality, as now understood, was formulated by Georg Cantor, cardinality can be used to compare an aspect of finite sets, e. g. the sets and are not equal, but have the same cardinality, namely three. Cantor applied his concept of bijection to infinite sets, e. g. the set of natural numbers N =, thus, all sets having a bijection with N he called denumerable sets and they all have the same cardinal number. This cardinal number is called ℵ0, aleph-null and he called the cardinal numbers of these infinite sets transfinite cardinal numbers. Cantor proved that any unbounded subset of N has the same cardinality as N and he later proved that the set of all real algebraic numbers is also denumerable. His proof used an argument with nested intervals, but in an 1891 paper he proved the result using his ingenious. The new cardinal number of the set of numbers is called the cardinality of the continuum. His continuum hypothesis is the proposition that c is the same as ℵ1 and this hypothesis has been found to be independent of the standard axioms of mathematical set theory, it can neither be proved nor disproved from the standard assumptions
9.
Ordinal number
–
In set theory, an ordinal number, or ordinal, is one generalization of the concept of a natural number that is used to describe a way to arrange a collection of objects in order, one after another. Any finite collection of objects can be put in order just by the process of counting, labeling the objects with distinct whole numbers, Ordinal numbers are thus the labels needed to arrange collections of objects in order. An ordinal number is used to describe the type of a well ordered set. Whereas ordinals are useful for ordering the objects in a collection, they are distinct from cardinal numbers, although the distinction between ordinals and cardinals is not always apparent in finite sets, different infinite ordinals can describe the same cardinal. Like other kinds of numbers, ordinals can be added, multiplied, a natural number can be used for two purposes, to describe the size of a set, or to describe the position of an element in a sequence. When restricted to finite sets these two concepts coincide, there is one way to put a finite set into a linear sequence. This is because any set has only one size, there are many nonisomorphic well-orderings of any infinite set. Whereas the notion of number is associated with a set with no particular structure on it. A well-ordered set is an ordered set in which there is no infinite decreasing sequence, equivalently. Ordinals may be used to label the elements of any given well-ordered set and this length is called the order type of the set. Any ordinal is defined by the set of ordinals that precede it, in fact, the most common definition of ordinals identifies each ordinal as the set of ordinals that precede it. For example, the ordinal 42 is the type of the ordinals less than it, i. e. the ordinals from 0 to 41. Conversely, any set of ordinals that is downward-closed—meaning that for any ordinal α in S and any ordinal β < α, β is also in S—is an ordinal. There are infinite ordinals as well, the smallest infinite ordinal is ω, which is the type of the natural numbers. After all of these come ω·2, ω·2+1, ω·2+2, and so on, then ω·3, now the set of ordinals formed in this way must itself have an ordinal associated with it, and that is ω2. Further on, there will be ω3, then ω4, and so on, and ωω, then ωωω, then later ωωωω and this can be continued indefinitely far. The smallest uncountable ordinal is the set of all countable ordinals, in a well-ordered set, every non-empty subset contains a distinct smallest element. Given the axiom of dependent choice, this is equivalent to just saying that the set is ordered and there is no infinite decreasing sequence
10.
Georg Cantor
–
Georg Ferdinand Ludwig Philipp Cantor was a German mathematician. He invented set theory, which has become a theory in mathematics. In fact, Cantors method of proof of this theorem implies the existence of an infinity of infinities and he defined the cardinal and ordinal numbers and their arithmetic. Cantors work is of great philosophical interest, a fact of which he was well aware, E. J. Brouwer, while Ludwig Wittgenstein raised philosophical objections. Cantor, a devout Lutheran, believed the theory had been communicated to him by God, Kronecker objected to Cantors proofs that the algebraic numbers are countable, and that the transcendental numbers are uncountable, results now included in a standard mathematics curriculum. The harsh criticism has been matched by later accolades, in 1904, the Royal Society awarded Cantor its Sylvester Medal, the highest honor it can confer for work in mathematics. David Hilbert defended it from its critics by declaring, From his paradise that Cantor with us unfolded, we hold our breath in awe, knowing, we shall not be expelled. Georg Cantor was born in the merchant colony in Saint Petersburg, Russia. Georg, the oldest of six children, was regarded as an outstanding violinist and his grandfather Franz Böhm was a well-known musician and soloist in a Russian imperial orchestra. In 1860, Cantor graduated with distinction from the Realschule in Darmstadt, his skills in mathematics. In 1862, Cantor entered the Swiss Federal Polytechnic and he spent the summer of 1866 at the University of Göttingen, then and later a center for mathematical research. Cantor submitted his dissertation on number theory at the University of Berlin in 1867, after teaching briefly in a Berlin girls school, Cantor took up a position at the University of Halle, where he spent his entire career. He was awarded the habilitation for his thesis, also on number theory. In 1874, Cantor married Vally Guttmann and they had six children, the last born in 1886. Cantor was able to support a family despite modest academic pay, during his honeymoon in the Harz mountains, Cantor spent much time in mathematical discussions with Richard Dedekind, whom he had met two years earlier while on Swiss holiday. Cantor was promoted to Extraordinary Professor in 1872 and made full Professor in 1879, however, his work encountered too much opposition for that to be possible. Worse yet, Kronecker, a figure within the mathematical community and Cantors former professor. Cantor came to believe that Kroneckers stance would make it impossible for him ever to leave Halle, in 1881, Cantors Halle colleague Eduard Heine died, creating a vacant chair
11.
Georg Cantor's first set theory article
–
Georg Cantors first set theory article was published in 1874 and contains the first theorems of transfinite set theory, which studies infinite sets and their properties. One of these theorems is Cantors revolutionary discovery that the set of all numbers is uncountably, rather than countably. This theorem is proved using Cantors first uncountability proof, which differs from the more familiar proof using his diagonal argument. The title of the article, On a Property of the Collection of All Real Algebraic Numbers, refers to its first theorem, Cantors article also contains a proof of the existence of transcendental numbers. As early as 1930, mathematicians have disagreed on whether this proof is constructive or non-constructive, books as recent as 2014 and 2015 indicate that this disagreement has not been resolved. Since Cantors proof either constructs transcendental numbers or does not, an analysis of his article can determine whether his proof is constructive or non-constructive, historians of mathematics have examined Cantors article and the circumstances in which it was written. For example, they have discovered that Cantor was advised to leave out his uncountability theorem in the article he submitted and they have traced this and other facts about the article to the influence of Karl Weierstrass and Leopold Kronecker. Historians have also studied Dedekinds contributions to the article, including his contributions to the theorem on the countability of the algebraic numbers. In addition, they have looked at the articles legacy—namely, the impact of the uncountability theorem, Cantors article is short, just 4 1/3 pages. Cantor restates this theorem in terms familiar to mathematicians of his time. Cantors second theorem works with an interval, which is the set of real numbers ≥ a and ≤ b. The theorem states, Given any sequence of real numbers x1, x2, x3, … and any interval, Hence, there are infinitely many such numbers. The first part of this theorem implies the Hence part, for example, let be the interval, and consider its pairwise disjoint subintervals, …. Applying the first part of the theorem to each subinterval produces infinitely many numbers in that are not contained in the given sequence, Cantor observes that combining his two theorems yields a new proof of the theorem that every interval contains infinitely many transcendental numbers. This theorem was first proved by Joseph Liouville and this remark contains Cantors uncountability theorem, which only states that an interval cannot be put into one-to-one correspondence with the set of positive integers. It does not state that this interval is a set of larger cardinality than the set of positive integers. Cardinality is defined in Cantors next article, which was published in 1878, Cantor does not explicitly prove his uncountability theorem, which follows easily from his second theorem. To prove it, we use proof by contradiction, applying Cantors second theorem to this sequence and produces a real number in that does not belong to the sequence
12.
Limit (mathematics)
–
In mathematics, a limit is the value that a function or sequence approaches as the input or index approaches some value. Limits are essential to calculus and are used to define continuity, derivatives, the concept of a limit of a sequence is further generalized to the concept of a limit of a topological net, and is closely related to limit and direct limit in category theory. In formulas, a limit is usually written as lim n → c f = L and is read as the limit of f of n as n approaches c equals L. Here lim indicates limit, and the fact that function f approaches the limit L as n approaches c is represented by the right arrow, suppose f is a real-valued function and c is a real number. Intuitively speaking, the lim x → c f = L means that f can be made to be as close to L as desired by making x sufficiently close to c. The first inequality means that the distance x and c is greater than 0 and that x ≠ c, while the second indicates that x is within distance δ of c. Note that the definition of a limit is true even if f ≠ L. Indeed. Now since x +1 is continuous in x at 1, we can now plug in 1 for x, in addition to limits at finite values, functions can also have limits at infinity. In this case, the limit of f as x approaches infinity is 2, in mathematical notation, lim x → ∞2 x −1 x =2. Consider the following sequence,1.79,1.799,1.7999 and it can be observed that the numbers are approaching 1.8, the limit of the sequence. Formally, suppose a1, a2. is a sequence of real numbers, intuitively, this means that eventually all elements of the sequence get arbitrarily close to the limit, since the absolute value | an − L | is the distance between an and L. Not every sequence has a limit, if it does, it is called convergent, one can show that a convergent sequence has only one limit. The limit of a sequence and the limit of a function are closely related, on one hand, the limit as n goes to infinity of a sequence a is simply the limit at infinity of a function defined on the natural numbers n. On the other hand, a limit L of a function f as x goes to infinity, if it exists, is the same as the limit of any sequence a that approaches L. Note that one such sequence would be L + 1/n, in non-standard analysis, the limit of a sequence can be expressed as the standard part of the value a H of the natural extension of the sequence at an infinite hypernatural index n=H. Thus, lim n → ∞ a n = st , here the standard part function st rounds off each finite hyperreal number to the nearest real number. This formalizes the intuition that for very large values of the index. Conversely, the part of a hyperreal a = represented in the ultrapower construction by a Cauchy sequence, is simply the limit of that sequence
13.
Real line
–
In mathematics, the real line, or real number line is the line whose points are the real numbers. That is, the line is the set R of all real numbers, viewed as a geometric space. It can be thought of as a space, a metric space, a topological space. Just like the set of numbers, the real line is usually denoted by the symbol R. However. This article focuses on the aspects of R as a space in topology, geometry. The real numbers also play an important role in algebra as a field, for more information on R in all of its guises, see real number. The real line is a linear continuum under the standard < ordering, specifically, the real line is linearly ordered by <, and this ordering is dense and has the least-upper-bound property. In addition to the properties, the real line has no maximum or minimum element. It also has a dense subset, namely the set of rational numbers. It is a theorem that any linear continuum with a dense subset. The real line also satisfies the countable chain condition, every collection of mutually disjoint, in order theory, the famous Suslin problem asks whether every linear continuum satisfying the countable chain condition that has no maximum or minimum element is necessarily order-isomorphic to R. This statement has been shown to be independent of the axiomatic system of set theory known as ZFC. The real line forms a space, with the distance function given by absolute difference. The metric tensor is clearly the 1-dimensional Euclidean metric, since the n-dimensional Euclidean metric can be represented in matrix form as the n by n identity matrix, the metric on the real line is simply the 1 by 1 identity matrix, i. e.1. If p ∈ R and ε >0, then the ε-ball in R centered at p is simply the open interval. This real line has several important properties as a space, The real line is a complete metric space. The real line is path-connected, and is one of the simplest examples of a metric space The Hausdorff dimension of the real line is equal to one. The real line carries a standard topology which can be introduced in two different, equivalent ways, first, since the real numbers are totally ordered, they carry an order topology
14.
Function (mathematics)
–
In mathematics, a function is a relation between a set of inputs and a set of permissible outputs with the property that each input is related to exactly one output. An example is the function that each real number x to its square x2. The output of a function f corresponding to a x is denoted by f. In this example, if the input is −3, then the output is 9, likewise, if the input is 3, then the output is also 9, and we may write f =9. The input variable are sometimes referred to as the argument of the function, Functions of various kinds are the central objects of investigation in most fields of modern mathematics. There are many ways to describe or represent a function, some functions may be defined by a formula or algorithm that tells how to compute the output for a given input. Others are given by a picture, called the graph of the function, in science, functions are sometimes defined by a table that gives the outputs for selected inputs. A function could be described implicitly, for example as the inverse to another function or as a solution of a differential equation, sometimes the codomain is called the functions range, but more commonly the word range is used to mean, instead, specifically the set of outputs. For example, we could define a function using the rule f = x2 by saying that the domain and codomain are the numbers. The image of this function is the set of real numbers. In analogy with arithmetic, it is possible to define addition, subtraction, multiplication, another important operation defined on functions is function composition, where the output from one function becomes the input to another function. Linking each shape to its color is a function from X to Y, each shape is linked to a color, there is no shape that lacks a color and no shape that has more than one color. This function will be referred to as the color-of-the-shape function, the input to a function is called the argument and the output is called the value. The set of all permitted inputs to a function is called the domain of the function. Thus, the domain of the function is the set of the four shapes. The concept of a function does not require that every possible output is the value of some argument, a second example of a function is the following, the domain is chosen to be the set of natural numbers, and the codomain is the set of integers. The function associates to any number n the number 4−n. For example, to 1 it associates 3 and to 10 it associates −6, a third example of a function has the set of polygons as domain and the set of natural numbers as codomain
15.
Sequence
–
In mathematics, a sequence is an enumerated collection of objects in which repetitions are allowed. Like a set, it contains members, the number of elements is called the length of the sequence. Unlike a set, order matters, and exactly the elements can appear multiple times at different positions in the sequence. Formally, a sequence can be defined as a function whose domain is either the set of the numbers or the set of the first n natural numbers. The position of an element in a sequence is its rank or index and it depends on the context or of a specific convention, if the first element has index 0 or 1. For example, is a sequence of letters with the letter M first, also, the sequence, which contains the number 1 at two different positions, is a valid sequence. Sequences can be finite, as in these examples, or infinite, the empty sequence is included in most notions of sequence, but may be excluded depending on the context. A sequence can be thought of as a list of elements with a particular order, Sequences are useful in a number of mathematical disciplines for studying functions, spaces, and other mathematical structures using the convergence properties of sequences. In particular, sequences are the basis for series, which are important in differential equations, Sequences are also of interest in their own right and can be studied as patterns or puzzles, such as in the study of prime numbers. There are a number of ways to denote a sequence, some of which are useful for specific types of sequences. One way to specify a sequence is to list the elements, for example, the first four odd numbers form the sequence. This notation can be used for sequences as well. For instance, the sequence of positive odd integers can be written. Listing is most useful for sequences with a pattern that can be easily discerned from the first few elements. Other ways to denote a sequence are discussed after the examples, the prime numbers are the natural numbers bigger than 1, that have no divisors but 1 and themselves. Taking these in their natural order gives the sequence, the prime numbers are widely used in mathematics and specifically in number theory. The Fibonacci numbers are the integer sequence whose elements are the sum of the two elements. The first two elements are either 0 and 1 or 1 and 1 so that the sequence is, for a large list of examples of integer sequences, see On-Line Encyclopedia of Integer Sequences
16.
Omega
–
Omega is the 24th and last letter of the Greek alphabet. In the Greek numeric system, it has a value of 800, the word literally means great O, as opposed to omicron, which means little O. In phonetic terms, the Ancient Greek Ω is a long open-mid o, in Modern Greek, Ω represents the mid back rounded vowel /o/, the same sound as omicron. The letter omega is transcribed ō or simply o, as the last letter of the Greek alphabet, Omega is often used to denote the last, the end, or the ultimate limit of a set, in contrast to alpha, the first letter of the Greek alphabet. Ω was not part of the early Greek alphabets and it was introduced in the late 7th century BC in the Ionian cities of Asia Minor to denote the long half-open. It is a variant of omicron, broken up at the side, the name Ωμέγα is Byzantine, in Classical Greek, the letter was called ō, whereas the omicron was called ou. In addition to the Greek alphabet, Omega was also adopted into the early Cyrillic alphabet, a Raetic variant is conjectured to be at the origin or parallel evolution of the Elder Futhark ᛟ. Omega was also adopted into the Latin alphabet, as a letter of the 1982 revision to the African reference alphabet, the uppercase letter Ω is used as a symbol, In chemistry, For oxygen-18, a natural, stable isotope of oxygen. In physics, For ohm – SI unit of resistance, formerly also used upside down to represent mho. Unicode has a code point for the ohm sign, but it is included only for backward compatibility. In statistical mechanics, Ω refers to the multiplicity in a system, the solid angle or the rate of precession in a gyroscope. In particle physics to represent the Omega baryons, in astronomy, Ω refers to the density of the universe, also called the density parameter. In astronomy, Ω refers to the longitude of the node of an orbit. In mathematics and computer science, In complex analysis, the Omega constant, a solution of Lamberts W function In differential geometry, a variable for a 2-dimensional region in calculus, usually corresponding to the domain of a double integral. In topos theory, the subobject classifier of an elementary topos, in combinatory logic, the looping combinator, In group theory, the omega and agemo subgroups of a p-group, Ω and ℧ In group theory, Cayleys Ω process as a partial differential operator. In statistics, it is used as the symbol for the sample space, in number theory, Ω is the number of prime divisors of n. In notation related to Big O notation to describe the behavior of functions. As part of logo or trademark, The logo of Omega Watches SA, part of the Badge of the Supreme Court of the United Kingdom
17.
Countable set
–
In mathematics, a countable set is a set with the same cardinality as some subset of the set of natural numbers. A countable set is either a set or a countably infinite set. Some authors use countable set to mean countably infinite alone, to avoid this ambiguity, the term at most countable may be used when finite sets are included and countably infinite, enumerable, or denumerable otherwise. Georg Cantor introduced the term countable set, contrasting sets that are countable with those that are uncountable, today, countable sets form the foundation of a branch of mathematics called discrete mathematics. A set S is countable if there exists a function f from S to the natural numbers N =. If such an f can be found that is also surjective, in other words, a set is countably infinite if it has one-to-one correspondence with the natural number set, N. As noted above, this terminology is not universal, some authors use countable to mean what is here called countably infinite, and do not include finite sets. Alternative formulations of the definition in terms of a function or a surjective function can also be given. In 1874, in his first set theory article, Cantor proved that the set of numbers is uncountable. In 1878, he used one-to-one correspondences to define and compare cardinalities, in 1883, he extended the natural numbers with his infinite ordinals, and used sets of ordinals to produce an infinity of sets having different infinite cardinalities. A set is a collection of elements, and may be described in many ways, one way is simply to list all of its elements, for example, the set consisting of the integers 3,4, and 5 may be denoted. This is only effective for small sets, however, for larger sets, even in this case, however, it is still possible to list all the elements, because the set is finite. Some sets are infinite, these sets have more than n elements for any integer n, for example, the set of natural numbers, denotable by, has infinitely many elements, and we cannot use any normal number to give its size. Nonetheless, it out that infinite sets do have a well-defined notion of size. To understand what this means, we first examine what it does not mean, for example, there are infinitely many odd integers, infinitely many even integers, and infinitely many integers overall. However, it out that the number of even integers. This is because we arrange things such that for every integer, or, more generally, n→2n, see picture. However, not all sets have the same cardinality
18.
Bijection
–
In mathematical terms, a bijective function f, X → Y is a one-to-one and onto mapping of a set X to a set Y. A bijection from the set X to the set Y has a function from Y to X. If X and Y are finite sets, then the existence of a means they have the same number of elements. For infinite sets the picture is complicated, leading to the concept of cardinal number. A bijective function from a set to itself is called a permutation. Bijective functions are essential to many areas of including the definitions of isomorphism, homeomorphism, diffeomorphism, permutation group. Satisfying properties and means that a bijection is a function with domain X and it is more common to see properties and written as a single statement, Every element of X is paired with exactly one element of Y. Functions which satisfy property are said to be onto Y and are called surjections, Functions which satisfy property are said to be one-to-one functions and are called injections. With this terminology, a bijection is a function which is both a surjection and an injection, or using words, a bijection is a function which is both one-to-one and onto. Consider the batting line-up of a baseball or cricket team, the set X will be the players on the team and the set Y will be the positions in the batting order The pairing is given by which player is in what position in this order. Property is satisfied since each player is somewhere in the list, property is satisfied since no player bats in two positions in the order. Property says that for each position in the order, there is some player batting in that position, in a classroom there are a certain number of seats. A bunch of students enter the room and the instructor asks them all to be seated. After a quick look around the room, the instructor declares that there is a bijection between the set of students and the set of seats, where each student is paired with the seat they are sitting in. The instructor was able to conclude there were just as many seats as there were students. For any set X, the identity function 1X, X → X, the function f, R → R, f = 2x +1 is bijective, since for each y there is a unique x = /2 such that f = y. In more generality, any linear function over the reals, f, R → R, f = ax + b is a bijection, each real number y is obtained from the real number x = /a. The function f, R →, given by f = arctan is bijective since each real x is paired with exactly one angle y in the interval so that tan = x
19.
Square number
–
In mathematics, a square number or perfect square is an integer that is the square of an integer, in other words, it is the product of some integer with itself. For example,9 is a number, since it can be written as 3 × 3. The usual notation for the square of a n is not the product n × n. The name square number comes from the name of the shape, another way of saying that a integer is a square number, is that its square root is again an integer. For example, √9 =3, so 9 is a square number, a positive integer that has no perfect square divisors except 1 is called square-free. For a non-negative integer n, the nth square number is n2, the concept of square can be extended to some other number systems. If rational numbers are included, then a square is the ratio of two integers, and, conversely, the ratio of two square integers is a square, e. g.49 =2. Starting with 1, there are ⌊√m⌋ square numbers up to and including m, the squares smaller than 602 =3600 are, The difference between any perfect square and its predecessor is given by the identity n2 −2 = 2n −1. Equivalently, it is possible to count up square numbers by adding together the last square, the last squares root, and the current root, that is, n2 =2 + + n. The number m is a number if and only if one can compose a square of m equal squares. Hence, a square with side length n has area n2, the expression for the nth square number is n2. This is also equal to the sum of the first n odd numbers as can be seen in the above pictures, the formula follows, n 2 = ∑ k =1 n. So for example,52 =25 =1 +3 +5 +7 +9, there are several recursive methods for computing square numbers. For example, the nth square number can be computed from the square by n2 =2 + + n =2 +. Alternatively, the nth square number can be calculated from the two by doubling the th square, subtracting the th square number, and adding 2. For example, 2 × 52 −42 +2 = 2 × 25 −16 +2 =50 −16 +2 =36 =62, a square number is also the sum of two consecutive triangular numbers. The sum of two square numbers is a centered square number. Every odd square is also an octagonal number
20.
Cube (algebra)
–
In arithmetic and algebra, the cube of a number n is its third power, the result of the number multiplied by itself twice, n3 = n × n × n. It is also the number multiplied by its square, n3 = n × n2 and this is also the volume formula for a geometric cube with sides of length n, giving rise to the name. The inverse operation of finding a number whose cube is n is called extracting the cube root of n and it determines the side of the cube of a given volume. It is also n raised to the one-third power, both cube and cube root are odd functions,3 = −. The cube of a number or any other mathematical expression is denoted by a superscript 3, a cube number, or a perfect cube, or sometimes just a cube, is a number which is the cube of an integer. The perfect cubes up to 603 are, Geometrically speaking, an integer m is a perfect cube if and only if one can arrange m solid unit cubes into a larger. For example,27 small cubes can be arranged into one larger one with the appearance of a Rubiks Cube, the difference between the cubes of consecutive integers can be expressed as follows, n3 −3 = 3n +1. There is no minimum perfect cube, since the cube of an integer is negative. For example, −4 × −4 × −4 = −64, unlike perfect squares, perfect cubes do not have a small number of possibilities for the last two digits. Except for cubes divisible by 5, where only 25,75 and 00 can be the last two digits, any pair of digits with the last digit odd can be a perfect cube. With even cubes, there is considerable restriction, for only 00, o2, e4, o6, some cube numbers are also square numbers, for example,64 is a square number and a cube number. This happens if and only if the number is a perfect sixth power, the last digits of each 3rd power are, It is, however, easy to show that most numbers are not perfect cubes because all perfect cubes must have digital root 1,8 or 9. That is their values modulo 9 may be only −1,1 and 0, every positive integer can be written as the sum of nine positive cubes. The equation x3 + y3 = z3 has no solutions in integers. In fact, it has none in Eisenstein integers, both of these statements are also true for the equation x3 + y3 = 3z3. The sum of the first n cubes is the nth triangle number squared,13 +23 + ⋯ + n 3 =2 =2. Proofs Charles Wheatstone gives a simple derivation, by expanding each cube in the sum into a set of consecutive odd numbers. Indeed, he begins by giving the identity n 3 = + + + ⋯ + ⏟ n consecutive odd numbers, kanim provides a purely visual proof, Benjamin & Orrison provide two additional proofs, and Nelsen gives seven geometric proofs
21.
Perfect power
–
In mathematics, a perfect power is a positive integer that can be expressed as an integer power of another positive integer. More formally, n is a perfect power if there exist natural numbers m >1, in this case, n may be called a perfect kth power. If k =2 or k =3, then n is called a square or perfect cube. Sometimes 1 is also considered a perfect power. The sum of the reciprocals of the perfect powers p without duplicates is, ∑ p 1 p = ∑ k =2 ∞ μ ≈0.874464368 … where μ is the Möbius function and this is sometimes known as the Goldbach-Euler theorem. Detecting whether or not a natural number n is a perfect power may be accomplished in many different ways. One of the simplest such methods is to all possible values for k across each of the divisors of n. This method can immediately be simplified by considering only prime values of k. This is because if n = m k for a composite k = a p p is prime. Because of this result, the value of k must necessarily be prime. As an example, consider n = 296·360·724, since gcd =12, n is a perfect 12th power. In 2002 Romanian mathematician Preda Mihăilescu proved that the pair of consecutive perfect powers is 23 =8 and 32 =9. Pillais conjecture states that for any positive integer k there are only a finite number of pairs of perfect powers whose difference is k. As an alternate way to perfect powers, the recursive approach has yet to be found useful. It is based on the observation that the difference between ab and b where a > b may not be constant, but if you take the difference of differences, b times. For example,94 =6561, and 104 is 10000, the difference between 84 and 94 is 2465, meaning the difference of differences is 974. A step further and you have 204, one step further, and you have 24, which is equal to 4. One step further and collating this key row from progressively larger exponents yields a similar to Pascals
22.
Parity (mathematics)
–
Parity is a mathematical term that describes the property of an integers inclusion in one of two categories, even or odd. An integer is even if it is divisible by two and odd if it is not even. For example,6 is even there is no remainder when dividing it by 2. By contrast,3,5,7,21 leave a remainder of 1 when divided by 2, examples of even numbers include −4,0,8, and 1738. In particular, zero is an even number, some examples of odd numbers are −5,3,9, and 73. Parity does not apply to non-integer numbers and this classification applies only to integers, i. e. non-integers like 1/2,4.201, or infinity are neither even nor odd. The sets of even and odd numbers can be defined as following and that is, if the last digit is 1,3,5,7, or 9, then it is odd, otherwise it is even. The same idea will work using any even base, in particular, a number expressed in the binary numeral system is odd if its last digit is 1 and even if its last digit is 0. In an odd base, the number is according to the sum of its digits – it is even if. The following laws can be verified using the properties of divisibility and they are a special case of rules in modular arithmetic, and are commonly used to check if an equality is likely to be correct by testing the parity of each side. As with ordinary arithmetic, multiplication and addition are commutative and associative in modulo 2 arithmetic, however, subtraction in modulo 2 is identical to addition, so subtraction also possesses these properties, which is not true for normal integer arithmetic. The structure is in fact a field with just two elements, the division of two whole numbers does not necessarily result in a whole number. For example,1 divided by 4 equals 1/4, which is neither even nor odd, since the concepts even, but when the quotient is an integer, it will be even if and only if the dividend has more factors of two than the divisor. The ancient Greeks considered 1, the monad, to be neither odd nor fully even. It is this, that two relatively different things or ideas there stands always a third, in a sort of balance. Thus, there is here between odd and even numbers one number which is neither of the two, similarly, in form, the right angle stands between the acute and obtuse angles, and in language, the semi-vowels or aspirants between the mutes and vowels. A thoughtful teacher and a pupil taught to think for himself can scarcely help noticing this, integer coordinates of points in Euclidean spaces of two or more dimensions also have a parity, usually defined as the parity of the sum of the coordinates. For instance, the cubic lattice and its higher-dimensional generalizations
23.
Prime number
–
A prime number is a natural number greater than 1 that has no positive divisors other than 1 and itself. A natural number greater than 1 that is not a number is called a composite number. For example,5 is prime because 1 and 5 are its only positive integer factors, the property of being prime is called primality. A simple but slow method of verifying the primality of a number n is known as trial division. It consists of testing whether n is a multiple of any integer between 2 and n, algorithms much more efficient than trial division have been devised to test the primality of large numbers. Particularly fast methods are available for numbers of forms, such as Mersenne numbers. As of January 2016, the largest known prime number has 22,338,618 decimal digits, there are infinitely many primes, as demonstrated by Euclid around 300 BC. There is no simple formula that separates prime numbers from composite numbers. However, the distribution of primes, that is to say, many questions regarding prime numbers remain open, such as Goldbachs conjecture, and the twin prime conjecture. Such questions spurred the development of branches of number theory. Prime numbers give rise to various generalizations in other domains, mainly algebra, such as prime elements. A natural number is called a number if it has exactly two positive divisors,1 and the number itself. Natural numbers greater than 1 that are not prime are called composite, among the numbers 1 to 6, the numbers 2,3, and 5 are the prime numbers, while 1,4, and 6 are not prime. 1 is excluded as a number, for reasons explained below. 2 is a number, since the only natural numbers dividing it are 1 and 2. Next,3 is prime, too,1 and 3 do divide 3 without remainder, however,4 is composite, since 2 is another number dividing 4 without remainder,4 =2 ·2. 5 is again prime, none of the numbers 2,3, next,6 is divisible by 2 or 3, since 6 =2 ·3. The image at the right illustrates that 12 is not prime,12 =3 ·4, no even number greater than 2 is prime because by definition, any such number n has at least three distinct divisors, namely 1,2, and n
24.
Composite number
–
A composite number is a positive integer that can be formed by multiplying together two smaller positive integers. Equivalently, it is an integer that has at least one divisor other than 1. Every positive integer is composite, prime, or the unit 1, so the numbers are exactly the numbers that are not prime. For example, the integer 14 is a number because it is the product of the two smaller integers 2 ×7. Likewise, the integers 2 and 3 are not composite numbers because each of them can only be divided by one, every composite number can be written as the product of two or more primes. For example, the composite number 299 can be written as 13 ×23, and the composite number 360 can be written as 23 ×32 ×5, furthermore and this fact is called the fundamental theorem of arithmetic. There are several known primality tests that can determine whether a number is prime or composite, one way to classify composite numbers is by counting the number of prime factors. A composite number with two prime factors is a semiprime or 2-almost prime, a composite number with three distinct prime factors is a sphenic number. In some applications, it is necessary to differentiate between composite numbers with an odd number of prime factors and those with an even number of distinct prime factors. For the latter μ =2 x =1, while for the former μ =2 x +1 = −1, however, for prime numbers, the function also returns −1 and μ =1. For a number n with one or more repeated prime factors, if all the prime factors of a number are repeated it is called a powerful number. If none of its factors are repeated, it is called squarefree. For example,72 =23 ×32, all the factors are repeated. 42 =2 ×3 ×7, none of the factors are repeated. Another way to classify composite numbers is by counting the number of divisors, all composite numbers have at least three divisors. In the case of squares of primes, those divisors are, a number n that has more divisors than any x < n is a highly composite number. Composite numbers have also been called rectangular numbers, but that name can refer to the pronic numbers, numbers that are the product of two consecutive integers. Table of prime factors Integer factorization Canonical representation of a positive integer Sieve of Eratosthenes Fraleigh, a First Course In Abstract Algebra, Reading, Addison-Wesley, ISBN 0-201-01984-1 Herstein, I. N
25.
Integer
–
An integer is a number that can be written without a fractional component. For example,21,4,0, and −2048 are integers, while 9.75, 5 1⁄2, the set of integers consists of zero, the positive natural numbers, also called whole numbers or counting numbers, and their additive inverses. This is often denoted by a boldface Z or blackboard bold Z standing for the German word Zahlen, ℤ is a subset of the sets of rational and real numbers and, like the natural numbers, is countably infinite. The integers form the smallest group and the smallest ring containing the natural numbers, in algebraic number theory, the integers are sometimes called rational integers to distinguish them from the more general algebraic integers. In fact, the integers are the integers that are also rational numbers. Like the natural numbers, Z is closed under the operations of addition and multiplication, that is, however, with the inclusion of the negative natural numbers, and, importantly,0, Z is also closed under subtraction. The integers form a ring which is the most basic one, in the following sense, for any unital ring. This universal property, namely to be an object in the category of rings. Z is not closed under division, since the quotient of two integers, need not be an integer, although the natural numbers are closed under exponentiation, the integers are not. The following lists some of the properties of addition and multiplication for any integers a, b and c. In the language of algebra, the first five properties listed above for addition say that Z under addition is an abelian group. As a group under addition, Z is a cyclic group, in fact, Z under addition is the only infinite cyclic group, in the sense that any infinite cyclic group is isomorphic to Z. The first four properties listed above for multiplication say that Z under multiplication is a commutative monoid. However, not every integer has an inverse, e. g. there is no integer x such that 2x =1, because the left hand side is even. This means that Z under multiplication is not a group, all the rules from the above property table, except for the last, taken together say that Z together with addition and multiplication is a commutative ring with unity. It is the prototype of all objects of algebraic structure. Only those equalities of expressions are true in Z for all values of variables, note that certain non-zero integers map to zero in certain rings. The lack of zero-divisors in the means that the commutative ring Z is an integral domain
26.
Rational number
–
In mathematics, a rational number is any number that can be expressed as the quotient or fraction p/q of two integers, a numerator p and a non-zero denominator q. Since q may be equal to 1, every integer is a rational number, the decimal expansion of a rational number always either terminates after a finite number of digits or begins to repeat the same finite sequence of digits over and over. Moreover, any repeating or terminating decimal represents a rational number and these statements hold true not just for base 10, but also for any other integer base. A real number that is not rational is called irrational, irrational numbers include √2, π, e, and φ. The decimal expansion of an irrational number continues without repeating, since the set of rational numbers is countable, and the set of real numbers is uncountable, almost all real numbers are irrational. Rational numbers can be defined as equivalence classes of pairs of integers such that q ≠0, for the equivalence relation defined by ~ if. The rational numbers together with addition and multiplication form field which contains the integers and is contained in any field containing the integers, finite extensions of Q are called algebraic number fields, and the algebraic closure of Q is the field of algebraic numbers. In mathematical analysis, the numbers form a dense subset of the real numbers. The real numbers can be constructed from the numbers by completion, using Cauchy sequences, Dedekind cuts. The term rational in reference to the set Q refers to the fact that a number represents a ratio of two integers. In mathematics, rational is often used as a noun abbreviating rational number, the adjective rational sometimes means that the coefficients are rational numbers. However, a curve is not a curve defined over the rationals. Any integer n can be expressed as the rational number n/1, a b = c d if and only if a d = b c. Where both denominators are positive, a b < c d if and only if a d < b c. If either denominator is negative, the fractions must first be converted into equivalent forms with positive denominators, through the equations, − a − b = a b, two fractions are added as follows, a b + c d = a d + b c b d. A b − c d = a d − b c b d, the rule for multiplication is, a b ⋅ c d = a c b d. Where c ≠0, a b ÷ c d = a d b c, note that division is equivalent to multiplying by the reciprocal of the divisor fraction, a d b c = a b × d c. Additive and multiplicative inverses exist in the numbers, − = − a b = a − b and −1 = b a if a ≠0
27.
Constructible number
–
A point in the Euclidean plane is a constructible point if, given a fixed coordinate system, the point can be constructed with unruled straightedge and compass. A complex number is a number if its corresponding point in the Euclidean plane is constructible from the usual x-. It can then be shown that a number r is constructible if and only if, given a line segment of unit length. It can also be shown that a number is constructible if and only if its real. In terms of algebra, a number is constructible if and only if it can be using the four basic arithmetic operations. This has the effect of transforming geometric questions about compass and straightedge constructions into algebra and this transformation leads to the solutions of many famous mathematical problems, which defied centuries of attack. The geometric definition of a point is as follows. First, for any two distinct points P and Q in the plane, let L denote the line through P and Q. Since the order of E, F, G, and H in the definition is irrelevant. Now, let A and A′ be any two distinct fixed points in the plane, a point Z is constructible if either Z = A, Z = A′, there exist points P0. Pn, with Z = Pn, such that for all j ≥1, Pj +1 is constructible from points in the set where P0 = A, for example, the center point of A and A′ is defined as follows. The circles C and C intersect in two points, these points determine a unique line, and the center is defined to be the intersection of this line with L. All rational numbers are constructible, and all numbers are algebraic numbers. Also, if a and b are constructible numbers with b ≠0, then a ± b, a×b, a⁄b, in particular, the set K of all constructible complex numbers forms a field, a subfield of the field of algebraic numbers. A complex number is constructible if and only if the real, furthermore, K is closed under square roots and complex conjugation. These facts can be used to characterize the field of numbers, because, in essence. The characterization is the following, a number is constructible if and only if it lies in a field at the top of a finite tower of quadratic extensions. Trigonometric numbers are irrational cosines or sines of angles that are multiples of π
28.
Algebraic number
–
An algebraic number is any complex number that is a root of a non-zero polynomial in one variable with rational coefficients. All integers and rational numbers are algebraic, as are all roots of integers, the same is not true for all real and complex numbers because they also include transcendental numbers such as π and e. Almost all real and complex numbers are transcendental, the rational numbers, expressed as the quotient of two integers a and b, b not equal to zero, satisfy the above definition because x = a/b is the root of bx − a. The quadratic surds are algebraic numbers, if the quadratic polynomial is monic then the roots are quadratic integers. The constructible numbers are numbers that can be constructed from a given unit length using straightedge. These include all quadratic surds, all numbers, and all numbers that can be formed from these using the basic arithmetic operations. Any expression formed from algebraic numbers using any combination of the arithmetic operations. Polynomial roots that cannot be expressed in terms of the arithmetic operations. This happens with many, but not all, polynomials of degree 5 or higher, gaussian integers, those complex numbers a + bi where both a and b are integers are also quadratic integers. Trigonometric functions of rational multiples of π, that is, the trigonometric numbers, for example, each of cos π/7, cos 3π/7, cos 5π/7 satisfies 8x3 − 4x2 − 4x +1 =0. This polynomial is irreducible over the rationals, and so these three cosines are conjugate algebraic numbers. Likewise, tan 3π/16, tan 7π/16, tan 11π/16, tan 15π/16 all satisfy the irreducible polynomial x4 − 4x3 − 6x2 + 4x +1, and so are conjugate algebraic integers. Some irrational numbers are algebraic and some are not, The numbers √2 and 3√3/2 are algebraic since they are roots of polynomials x2 −2 and 8x3 −3, the golden ratio φ is algebraic since it is a root of the polynomial x2 − x −1. The numbers π and e are not algebraic numbers, hence they are transcendental, the set of algebraic numbers is countable. Hence, the set of numbers has Lebesgue measure zero. Given an algebraic number, there is a monic polynomial of least degree that has the number as a root. This polynomial is called its minimal polynomial, if its minimal polynomial has degree n, then the algebraic number is said to be of degree n. An algebraic number of degree 1 is a rational number, a real algebraic number of degree 2 is a quadratic irrational
29.
String (computer science)
–
In computer programming, a string is traditionally a sequence of characters, either as a literal constant or as some kind of variable. The latter may allow its elements to be mutated and the length changed, a string is generally understood as a data type and is often implemented as an array of bytes that stores a sequence of elements, typically characters, using some character encoding. A string may also more general arrays or other sequence data types and structures. When a string appears literally in source code, it is known as a literal or an anonymous string. In formal languages, which are used in logic and theoretical computer science. Let Σ be a non-empty finite set of symbols, called the alphabet, no assumption is made about the nature of the symbols. A string over Σ is any sequence of symbols from Σ. For example, if Σ =, then 01011 is a string over Σ, the length of a string s is the number of symbols in s and can be any non-negative integer, it is often denoted as |s|. The empty string is the string over Σ of length 0. The set of all strings over Σ of length n is denoted Σn, for example, if Σ =, then Σ2 =. Note that Σ0 = for any alphabet Σ, the set of all strings over Σ of any length is the Kleene closure of Σ and is denoted Σ*. In terms of Σn, Σ ∗ = ⋃ n ∈ N ∪ Σ n For example, if Σ =, although the set Σ* itself is countably infinite, each element of Σ* is a string of finite length. A set of strings over Σ is called a language over Σ. For example, if Σ =, the set of strings with an number of zeros, is a formal language over Σ. Concatenation is an important binary operation on Σ*, for any two strings s and t in Σ*, their concatenation is defined as the sequence of symbols in s followed by the sequence of characters in t, and is denoted st. For example, if Σ =, s = bear, and t = hug, then st = bearhug, String concatenation is an associative, but non-commutative operation. The empty string ε serves as the identity element, for any string s, therefore, the set Σ* and the concatenation operation form a monoid, the free monoid generated by Σ. In addition, the length function defines a monoid homomorphism from Σ* to the non-negative integers, a string s is said to be a substring or factor of t if there exist strings u and v such that t = usv
30.
Subset
–
In mathematics, especially in set theory, a set A is a subset of a set B, or equivalently B is a superset of A, if A is contained inside B, that is, all elements of A are also elements of B. The relationship of one set being a subset of another is called inclusion or sometimes containment, the subset relation defines a partial order on sets. The algebra of subsets forms a Boolean algebra in which the relation is called inclusion. For any set S, the inclusion relation ⊆ is an order on the set P of all subsets of S defined by A ≤ B ⟺ A ⊆ B. We may also partially order P by reverse set inclusion by defining A ≤ B ⟺ B ⊆ A, when quantified, A ⊆ B is represented as, ∀x. So for example, for authors, it is true of every set A that A ⊂ A. Other authors prefer to use the symbols ⊂ and ⊃ to indicate proper subset and superset, respectively and this usage makes ⊆ and ⊂ analogous to the inequality symbols ≤ and <. For example, if x ≤ y then x may or may not equal y, but if x < y, then x definitely does not equal y, and is less than y. Similarly, using the convention that ⊂ is proper subset, if A ⊆ B, then A may or may not equal B, the set A = is a proper subset of B =, thus both expressions A ⊆ B and A ⊊ B are true. The set D = is a subset of E =, thus D ⊆ E is true, any set is a subset of itself, but not a proper subset. The empty set, denoted by ∅, is also a subset of any given set X and it is also always a proper subset of any set except itself. These are two examples in both the subset and the whole set are infinite, and the subset has the same cardinality as the whole. The set of numbers is a proper subset of the set of real numbers. In this example, both sets are infinite but the set has a larger cardinality than the former set. Another example in an Euler diagram, Inclusion is the partial order in the sense that every partially ordered set is isomorphic to some collection of sets ordered by inclusion. The ordinal numbers are a simple example—if each ordinal n is identified with the set of all ordinals less than or equal to n, then a ≤ b if and only if ⊆. For the power set P of a set S, the partial order is the Cartesian product of k = |S| copies of the partial order on for which 0 <1. This can be illustrated by enumerating S = and associating with each subset T ⊆ S the k-tuple from k of which the ith coordinate is 1 if and only if si is a member of T
31.
Axiom of countable choice
–
The axiom of countable choice or axiom of denumerable choice, denoted ACω, is an axiom of set theory that states that any countable collection of non-empty sets must have a choice function. I. e. given a function A with domain N such that A is a non-empty set for every n ∈ N, the axiom of countable choice is strictly weaker than the axiom of dependent choice, which in turn is weaker than the axiom of choice. Paul Cohen showed that ACω, is not provable in Zermelo–Fraenkel set theory without the axiom of choice, ACω holds in the Solovay model. ZF + ACω suffices to prove that the union of countably many countable sets is countable and it also suffices to prove that every infinite set is Dedekind-infinite. ACω is particularly useful for the development of analysis, where many results depend on having a function for a countable collection of sets of real numbers. For instance, in order to prove that every point x of a set S⊆R is the limit of some sequence of elements of S\. When formulated for accumulation points of arbitrary metric spaces, the statement becomes equivalent to ACω, for other statements equivalent to ACω, see Herrlich and Howard & Rubin. A common misconception is that countable choice has a nature and is therefore provable as a theorem by induction. However, some infinite sets of nonempty sets can be proven to have a choice function in ZF without any form of the axiom of choice. These include Vω− and the set of proper and bounded intervals of real numbers with rational endpoints. As an example of an application of ACω, here is a proof that every set is Dedekind-infinite. For each natural number n, let An be the set of all 2n-element subsets of X, since X is infinite, each An is nonempty. A first application of ACω yields a sequence where each Bn is a subset of X with 2n elements, the sets Bn are not necessarily disjoint, but we can define C0 = B0 Cn= the difference of Bn and the union of all Cj, j<n. Clearly each set Cn has at least 1 and at most 2n elements, a second application of ACω yields a sequence with cn∈Cn. So all the cn are distinct, and X contains a countable set, the function that maps each cn to cn+1 is a 1-1 map from X into X which is not onto, proving that X is Dedekind-infinite. Choice principles in elementary topology and analysis, Howard, Paul, Rubin, Jean E. Consequences of the axiom of choice. Set Theory and its Philosophy, A Critical Introduction and this article incorporates material from axiom of countable choice on PlanetMath, which is licensed under the Creative Commons Attribution/Share-Alike License
32.
Axiom of choice
–
In mathematics, the axiom of choice, or AC, is an axiom of set theory equivalent to the statement that the Cartesian product of a collection of non-empty sets is non-empty. It states that for every indexed family i ∈ I of nonempty sets there exists an indexed family i ∈ I of elements such that x i ∈ S i for every i ∈ I. The axiom of choice was formulated in 1904 by Ernst Zermelo in order to formalize his proof of the well-ordering theorem. Informally put, the axiom of choice says that any collection of bins, each containing at least one object. One motivation for use is that a number of generally accepted mathematical results, such as Tychonoffs theorem. Contemporary set theorists also study axioms that are not compatible with the axiom of choice, the axiom of choice is avoided in some varieties of constructive mathematics, although there are varieties of constructive mathematics in which the axiom of choice is embraced. A choice function is a function f, defined on a collection X of nonempty sets, each choice function on a collection X of nonempty sets is an element of the Cartesian product of the sets in X. The axiom of choice asserts the existence of elements, it is therefore equivalent to, Given any family of nonempty sets. In this article and other discussions of the Axiom of Choice the following abbreviations are common, ZF – Zermelo–Fraenkel set theory omitting the Axiom of Choice. ZFC – Zermelo–Fraenkel set theory, extended to include the Axiom of Choice, There are many other equivalent statements of the axiom of choice. These are equivalent in the sense that, in the presence of basic axioms of set theory. One variation avoids the use of functions by, in effect. Given any set X of pairwise disjoint non-empty sets, there exists at least one set C that contains one element in common with each of the sets in X. This guarantees for any partition of a set X the existence of a subset C of X containing exactly one element from each part of the partition. Another equivalent axiom only considers collections X that are essentially powersets of other sets, For any set A, authors who use this formulation often speak of the choice function on A, but be advised that this is a slightly different notion of choice function. With this alternate notion of function, the axiom of choice can be compactly stated as Every set has a choice function. Which is equivalent to For any set A there is a function f such that for any non-empty subset B of A, f lies in B. The negation of the axiom can thus be expressed as, There is a set A such that for all functions f, however, that particular case is a theorem of Zermelo–Fraenkel set theory without the axiom of choice, it is easily proved by mathematical induction
33.
Union (set theory)
–
In set theory, the union of a collection of sets is the set of all elements in the collection. It is one of the operations through which sets can be combined and related to each other. For explanation of the used in this article, refer to the table of mathematical symbols. The union of two sets A and B is the set of elements which are in A, in B, for example, if A = and B = then A ∪ B =. Sets cannot have duplicate elements, so the union of the sets and is, multiple occurrences of identical elements have no effect on the cardinality of a set or its contents. Binary union is an operation, that is, A ∪ = ∪ C. The operations can be performed in any order, and the parentheses may be omitted without ambiguity, similarly, union is commutative, so the sets can be written in any order. The empty set is an identity element for the operation of union and that is, A ∪ ∅ = A, for any set A. This follows from analogous facts about logical disjunction, since sets with unions and intersections form a Boolean algebra, intersection distributes over union A ∩ = ∪ and union distributes over intersection A ∪ = ∩. One can take the union of several sets simultaneously, for example, the union of three sets A, B, and C contains all elements of A, all elements of B, and all elements of C, and nothing else. Thus, x is an element of A ∪ B ∪ C if and only if x is in at least one of A, B, and C. In mathematics a finite union means any union carried out on a number of sets. The most general notion is the union of a collection of sets. If M is a set whose elements are themselves sets, then x is an element of the union of M if, in symbols, x ∈ ⋃ M ⟺ ∃ A ∈ M, x ∈ A. This idea subsumes the preceding sections, in that A ∪ B ∪ C is the union of the collection, also, if M is the empty collection, then the union of M is the empty set. The notation for the concept can vary considerably. For a finite union of sets S1, S2, S3, …, S n one often writes S1 ∪ S2 ∪ S3 ∪ ⋯ ∪ S n or ⋃ i =1 n S i. In the case that the index set I is the set of natural numbers, whenever the symbol ∪ is placed before other symbols instead of between them, it is of a larger size