இயல் எண்
கட்டற்ற கலைக்களஞ்சியமான விக்கிபீடியாவில் இருந்து.
கணிதத்தில், இயல் எண் என்பது முழு எண்களாகும். இயல் எண் வரிசைக்கு இரு வகையான வரைவிலக்கணம் உண்டு. முதல் வரிசை நேர்ம முழு எண்களான (1, 2, 3, 4, ...) ஆகும். இன்னொரு விதமாகவும் வரையறுக்கப்படுகிறது. இதனை எதிர்ம எண் அல்லா முழு என்கள் வரிசை எனலாம். எனவே இவை (0, 1, 2, 3, 4, ...) ஆகும். முந்தைய வரைவிலக்கணம் எண் கோட்பாட்டிலும், பிந்தையது கணக் கோட்பாட்டிலும் கணிணி அறிவியலிலும் விரும்பப்படுகிறது.
இயல் எண்களுக்கு இரண்டு இயல்பான பயன்கள் உள்ளன. சில பொருட்களை எண்ண பயன்படுத்தலாம் ("தட்டில் 4 மாம்பழங்கள் உள்ளன"), மேலும் எண்ணிக்கை அளவில் எத்தனையாவது என்று முறைமையைக் காட்டலாம் ( "சென்னை இந்தியாவிலேயே 4 ஆவது பெரிய நகரம்")
எண் கோட்பாட்டுத் துறையில், இந்த இயல் எண்களின் வகு நிலை வகு படா நிலை என்பதைக் குறிக்கும் வகுமைப் பண்புகள் பற்றியும், பகா எண்கள் எப்படி விரவி உள்ளன என்பது பற்றியும் ஆய்வு செய்யப்படுகின்றது.
பொருளடக்கம் |
[தொகு] இயல் எண்களின் வரலாறும் சுழி என்னும் பூச்சிய எண்ணின் நிலைப்பாட்டுக் கொள்கையும்
The natural numbers presumably had their origins in the words used to count things, beginning with the number one.
The first major advance in abstraction was the use of numerals to represent numbers. This allowed systems to be developed for recording large numbers. For example, the Babylonians developed a powerful place-value system based essentially on the numerals for 1 and 10. The ancient Egyptians had a system of numerals with distinct hieroglyphs for 1, 10, and all the powers of 10 up to one 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 in abstraction was the development of the idea of zero as a number with its own numeral. A zero digit had been used in place-value notation as early as 700 BC by the Babylonians, but it was never used as a final element.1 The Olmec and Maya civilization used zero as a separate number as early as 1st century BC, apparently developed independently, but this usage did not spread beyond Mesoamerica. The concept as used in modern times originated with the Indian mathematician Brahmagupta in 628 AD. Nevertheless, zero was used as a number by all medieval computists (calculators of Easter) beginning with Dionysius Exiguus in 525, but in general no Roman numeral was used to write it. Instead, the Latin word for "nothing," nullae, was employed.
The first systematic study of numbers as abstractions (that is, as abstract entities) is usually credited to the Greek philosophers Pythagoras and Archimedes. However, independent studies also occurred at around the same time in India, China, and Mesoamerica.
In the nineteenth century, a set-theoretical definition of natural numbers was developed. With this definition, it was more convenient to include zero (corresponding to the empty set) as a natural number. This convention is followed by set theorists, logicians, and computer scientists. Other mathematicians, primarily number theorists, often prefer to follow the older tradition and exclude zero from the natural numbers.
The term whole number is used informally by some authors for an element of the set of integers, the set of non-negative integers, or the set of positive integers.
[தொகு] Notation
Mathematicians use N or 
(an N in blackboard bold) to refer to the set of all natural numbers. This set is infinite but countable by definition.
To be unambiguous about whether zero is included or not, sometimes an index "0" is added in the former case, and a superscript "*" is added in the latter case:
- N0 = { 0, 1, 2, ... } ; N* = { 1, 2, ... }.
(Sometimes, an index or superscript "+" is added to signify "positive". However, this is often used for "nonnegative" in other cases, as R+ = [0,∞) and Z+ = { 0, 1, 2,... }, at least in European literature. The notation "*", however, is quite standard for nonzero or rather invertible elements.)
Less frequently, W or 
is used for the set of "whole numbers", which are sometimes identified with the natural numbers as defined here, sometimes with the integers.
Set theorists often denote the set of all natural numbers by ω. When this notation is used, zero is explicitly included as a natural number.
[தொகு] Formal definitions
Historically, the precise mathematical definition of the natural numbers developed with some difficulty. The Peano postulates state conditions that any successful definition must satisfy. Certain constructions show that, given set theory, models of the Peano postulates must exist.
[தொகு] Peano axioms
- There is a natural number 0.
- Every natural number a has a natural number successor, denoted by S(a).
- There is no natural number whose successor is 0.
- Distinct natural numbers have distinct successors: if a ≠ b, then S(a) ≠ S(b).
- If a property is possessed by 0 and also by the successor of every natural number which possesses it, then it is possessed by all natural numbers. (This postulate ensures that the proof technique of mathematical induction is valid.)
It should be noted that the "0" in the above definition need not correspond to what we normally consider to be the number zero. "0" simply means some object that when combined with an appropriate successor function, satisfies the Peano axioms. There are many systems that satisfy these axioms, including the natural numbers (either starting from zero or one).
[தொகு] Constructions based on set theory
[தொகு] The standard construction
A standard construction in set theory is to define the natural numbers as follows:
- We set 0 := { }
- and define S(a) = a U {a} for all a.
- The set of natural numbers is then defined to be the intersection of all sets containing 0 which are closed under the successor function.
- Assuming the axiom of infinity, this definition can be shown to satisfy the Peano axioms.
- Each natural number is then equal to the set of natural numbers less than it, so that
-
- 0 = { }
- 1 = {0} = {{ }}
- 2 = {0,1} = {0, {0}} = {{ }, {{ }}}
- 3 = {0,1,2} = {0, {0}, {0, {0}}} = {{ }, {{ }}, {{ }, {{ }}}}
- and so on. When you see a natural number used as a set, this is typically what is meant. Under this definition, there are exactly n elements (in the naïve sense) in the set n and n ≤ m (in the naïve sense) iff n is a subset of m.
- Also, with this definition, different possible interpretations of notations like Rn (n-tuples vs. mappings of n into R) coincide.
[தொகு] Other constructions
Although the standard construction is useful, it is not the only possible construction. For example:
- one could define 0 = { }
- and S(a) = {a},
- producing
- 0 = { }
- 1 = {0} = {{ }}
- 2 = {1} = {{{ }}}, etc.
Or we could even define 0 = {{ }}
- and S(a) = a U {a}
- producing
- 0 = {{ }}
- 1 = {{ }, 0} = {{ }, {{ }}}
- 2 = {{ }, 0, 1}, etc.
Arguably the oldest set-theoretic definition of the natural numbers is the definition commonly ascribed to Frege and Russell under which each concrete natural number n is defined as the set of all sets with n elements. This may appear circular, but can be made rigorous with care. Define 0 as {{}} (clearly the set of all sets with 0 elements) and define σ(A) (for any set A) as 
. Then 0 will be the set of all sets with 0 elements, 1 = σ(0) will be the set of all sets with 1 element, 2 = σ(1) will be the set of all sets with 2 elements, and so forth. The set of all natural numbers can be defined as the intersection of all sets containing 0 and closed under σ. This definition does not work in the usual systems of axiomatic set theory because the collections involved are too large (it will not work in any set theory with the axiom of separation); but it does work in New Foundations (and in related systems known to be consistent) and in some systems of type theory.
For the rest of this article, we follow the standard construction described above.
[தொகு] Properties
One can recursively define an addition on the natural numbers by setting a + 0 = a and a + S(b) = S(a + b) for all a, b. This turns the natural numbers (N, +) into a commutative monoid with identity element 0, the so-called free monoid with one generator. This monoid satisfies the cancellation property and can therefore be embedded in a group. The smallest group containing the natural numbers is the integers.
If we define S(0) := 1, then S(b) = S(b + 0) = b + S(0) = b + 1; i.e. the successor of b is simply b + 1.
Analogously, given that addition has been defined, a multiplication × can be defined via a × 0 = 0 and a × S(b) = (a × b) + a. This turns (N, ×) into a commutative monoid with identity element 1; a generator set for this monoid is the set of prime numbers. Addition and multiplication are compatible, which is expressed in the distribution law: a × (b + c) = (a × b) + (a × c). These properties of addition and multiplication make the natural numbers an instance of a commutative semiring. Semirings are an algebraic generalization of the natural numbers where multiplication is not necessarily commutative.
If we interpret the natural numbers as "excluding 0", and "starting at 1", the definitions of + and × are as above, except that a + 1 = S(a) and a × 1 = a.
For the remainder of the article, we write ab to indicate the product a × b, and we also assume the standard order of operations.
Furthermore, one defines a total order on the natural numbers by writing a ≤ b if and only if there exists another natural number c with a + c = b. This order is compatible with the arithmetical operations in the following sense: if a, b and c are natural numbers and a ≤ b, then a + c ≤ b + c and ac ≤ bc. An important property of the natural numbers is that they are well-ordered: every non-empty set of natural numbers has a least element.
While it is in general not possible to divide one natural number by another and get a natural number as result, the procedure of division with remainder is available as a substitute: for any two natural numbers a and b with b ≠ 0 we can find natural numbers q and r such that
- a = bq + r and r < b
The number q is called the quotient and r is called the remainder of division of a by b. The numbers q and r are uniquely determined by a and b. This, the Division algorithm, is key to several other properties (divisibility), algorithms (such as the Euclidean algorithm), and ideas in number theory.
[தொகு] Generalizations
Two generalizations of natural numbers arise from the two uses: ordinal numbers are used to describe the position of an element in a ordered sequence and cardinal numbers are used to specify the size of a given set.
For finite sequences or finite sets, both of these properties are embodied in the natural numbers.
Other generalizations are discussed in the article on numbers.
[தொகு] Footnote
¹ "... a tablet found at Kish ... thought to date from around 700 BC, uses three hooks to denote an empty place in the positional notation. Other tablets dated from around the same time use a single hook for an empty place." [1]
