Arbitrarily large

Last updated

In mathematics, the phrases arbitrarily large, arbitrarily small and arbitrarily long are used in statements to make clear of the fact that an object is large, small and long with little limitation or restraint, respectively. The use of "arbitrarily" often occurs in the context of real numbers (and its subsets thereof), though its meaning can differ from that of "sufficiently" and "infinitely".

Contents

Examples

The statement

" is non-negative for arbitrarily large ."

is a shorthand for:

"For every real number , is non-negative for some value of greater than ."

In the common parlance, the term "arbitrarily long" is often used in the context of sequence of numbers. For example, to say that there are "arbitrarily long arithmetic progressions of prime numbers" does not mean that there exists any infinitely long arithmetic progression of prime numbers (there is not), nor that there exists any particular arithmetic progression of prime numbers that is in some sense "arbitrarily long". Rather, the phrase is used to refer to the fact that no matter how large a number is, there exists some arithmetic progression of prime numbers of length at least . [1]

Similar to arbitrarily large, one can also define the phrase " holds for arbitrarily small real numbers", as follows: [2]

In other words:

However small a number, there will be a number smaller than it such that holds.

Arbitrarily large vs. sufficiently large vs. infinitely large

While similar, "arbitrarily large" is not equivalent to "sufficiently large". For instance, while it is true that prime numbers can be arbitrarily large (since there are infinitely many of them due to Euclid's theorem), it is not true that all sufficiently large numbers are prime.

As another example, the statement " is non-negative for arbitrarily large ." could be rewritten as:

However, using "sufficiently large", the same phrase becomes:

Furthermore, "arbitrarily large" also does not mean "infinitely large". For example, although prime numbers can be arbitrarily large, an infinitely large prime number does not exist—since all prime numbers (as well as all other integers) are finite.

In some cases, phrases such as "the proposition is true for arbitrarily large " are used primarily for emphasis, as in " is true for all , no matter how large is." In these cases, the phrase "arbitrarily large" does not have the meaning indicated above (i.e., "however large a number, there will be some larger number for which still holds." [3] ). Instead, the usage in this case is in fact logically synonymous with "all".

See also

Related Research Articles

Cauchy sequence Sequence of points that get progressively closer to each other

In mathematics, a Cauchy sequence, named after Augustin-Louis Cauchy, is a sequence whose elements become arbitrarily close to each other as the sequence progresses. More precisely, given any small positive distance, all but a finite number of elements of the sequence are less than that given distance from each other.

Computable number Real number that can be computed within arbitrary precision

In mathematics, computable numbers are the real numbers that can be computed to within any desired precision by a finite, terminating algorithm. They are also known as the recursive numbers, effective numbers or the computable reals or recursive reals.

Mathematical induction Form of mathematical proof

Mathematical induction is a mathematical proof technique. It is essentially used to prove that a statement P(n) holds for every natural number n = 0, 1, 2, 3, .. . ; that is, the overall statement is a sequence of infinitely many cases P(0), P(1), P(2), P(3),. .. . Informal metaphors help to explain this technique, such as falling dominoes or climbing a ladder:

Mathematical induction proves that we can climb as high as we like on a ladder, by proving that we can climb onto the bottom rung and that from each rung we can climb up to the next one.

In mathematical logic, the Peano axioms, also known as the Dedekind–Peano axioms or the Peano postulates, are axioms for the natural numbers presented by the 19th century Italian mathematician Giuseppe Peano. These axioms have been used nearly unchanged in a number of metamathematical investigations, including research into fundamental questions of whether number theory is consistent and complete.

Real analysis Mathematics of real numbers and real functions

In mathematics, real analysis is the branch of mathematical analysis that studies the behavior of real numbers, sequences and series of real numbers, and real functions. Some particular properties of real-valued sequences and functions that real analysis studies include convergence, limits, continuity, smoothness, differentiability and integrability.

In mathematics, the infimum of a subset of a partially ordered set is a greatest element in that is less than or equal to all elements of if such an element exists. Consequently, the term greatest lower bound is also commonly used.

Infinitesimal Extremely small quantity in calculus; thing so small that there is no way to measure it

In mathematics, an infinitesimal or infinitesimal number is a quantity that is closer to zero than any standard real number, but that is not zero. The word infinitesimal comes from a 17th-century Modern Latin coinage infinitesimus, which originally referred to the "infinity-th" item in a sequence.

Analytic number theory Exploring properties of the integers with complex analysis

In mathematics, analytic number theory is a branch of number theory that uses methods from mathematical analysis to solve problems about the integers. It is often said to have begun with Peter Gustav Lejeune Dirichlet's 1837 introduction of Dirichlet L-functions to give the first proof of Dirichlet's theorem on arithmetic progressions. It is well known for its results on prime numbers and additive number theory.

Limit of a sequence Value that the terms of a sequence "tend to"

In mathematics, the limit of a sequence is the value that the terms of a sequence "tend to", and is often denoted using the symbol. If such a limit exists, the sequence is called convergent. A sequence that does not converge is said to be divergent. The limit of a sequence is said to be the fundamental notion on which the whole of mathematical analysis ultimately rests.

In mathematics, the lower limit topology or right half-open interval topology is a topology defined on the set of real numbers; it is different from the standard topology on and has a number of interesting properties. It is the topology generated by the basis of all half-open intervals [a,b), where a and b are real numbers.

In model theory, a transfer principle states that all statements of some language that are true for some structure are true for another structure. One of the first examples was the Lefschetz principle, which states that any sentence in the first-order language of fields that is true for the complex numbers is also true for any algebraically closed field of characteristic 0.

Superior highly composite number

In mathematics, a superior highly composite number is a natural number which has more divisors per some positive power of itself than any other number. It is a stronger restriction than that of a highly composite number, which is defined as having more divisors than any smaller positive integer.

In additive combinatorics, Freiman's theorem is a central result which indicates the approximate structure of sets whose sumset is small. It roughly states that if is small, then can be contained in a small generalized arithmetic progression.

In Ramsey theory, a set S of natural numbers is considered to be a large set if and only if Van der Waerden's theorem can be generalized to assert the existence of arithmetic progressions with common difference in S. That is, S is large if and only if every finite partition of the natural numbers has a cell containing arbitrarily long arithmetic progressions having common differences in S.

In the mathematical areas of number theory and analysis, an infinite sequence or a function is said to eventually have a certain property, if it doesn't have the said property across all its ordered instances, but will after some instances have passed. The use of the term "eventually" can be often rephrased as "for sufficiently large numbers", and can be also extended to the class of properties that apply to elements of any ordered set.

Anatoly Karatsuba Russian mathematician

Anatoly Alexeyevich Karatsuba was a Russian mathematician working in the field of analytic number theory, p-adic numbers and Dirichlet series.

Real number Number representing a continuous quantity

In mathematics, a real number is a value of a continuous quantity that can represent a distance along a line. The adjective real in this context was introduced in the 17th century by René Descartes, who distinguished between real and imaginary roots of polynomials. The real numbers include all the rational numbers, such as the integer −5 and the fraction 4/3, and all the irrational numbers, such as 2. Included within the irrationals are the real transcendental numbers, such as π (3.14159265...). In addition to measuring distance, real numbers can be used to measure quantities such as time, mass, energy, velocity, and many more. The set of real numbers is denoted using the symbol R or and is sometimes called "the reals".

In logic, a quantifier is an operator that specifies how many individuals in the domain of discourse satisfy an open formula. For instance, the universal quantifier in the first order formula expresses that everything in the domain satisfies the property denoted by . On the other hand, the existential quantifier in the formula expresses that there is something in the domain which satisfies that property. A formula where a quantifier takes widest scope is called a quantified formula. A quantified formula must contain a bound variable and a subformula specifying a property of the referent of that variable.

In additive number theory, an area of mathematics, the Erdős–Tetali theorem is an existence theorem concerning economical additive bases of every order. More specifically, it states that for every fixed integer , there exists a subset of the natural numbers satisfying

Roth's theorem on arithmetic progressions is a result in additive combinatorics concerning the existence of arithmetic progressions in subsets of the natural numbers. It was first proven by Klaus Roth in 1953. Roth's Theorem is a special case of Szemerédi's Theorem for the case .

References

  1. 4 Arbitrarily Large Data. Archived February 22, 2012, at the Wayback Machine Accessed 21 February 2012
  2. "Definition:Arbitrarily Small - ProofWiki". proofwiki.org. Retrieved 2019-11-19.
  3. "Definition:Arbitrarily Large - ProofWiki". proofwiki.org. Retrieved 2019-11-19.