Range of a function

Subset of a function's codomain

For the statistical concept, see Range (statistics).

f {\displaystyle f} is a function from domain X to codomain Y. The yellow oval inside Y is the image of  f {\displaystyle f} . Sometimes "range" refers to the image and sometimes to the codomain.

In mathematics, the range of a function may refer to either of two closely related concepts:

* the codomain of the function, or
* the image of the function.

In some cases the codomain and the image of a function are the same set; such a function is called surjective or onto. For any non-surjective function  f : X -> Y , {\displaystyle f:X\to Y,} the codomain  Y {\displaystyle Y} and the image  Y ~ {\displaystyle {\tilde {Y}}} are different; however, a new function can be defined with the original function's image as its codomain,  f ~ : X -> Y ~ {\displaystyle {\tilde {f}}:X\to {\tilde {Y}}} where  f ~ ( x ) = f ( x ) . {\displaystyle {\tilde {f}}(x)=f(x).} This new function is surjective.

## Definitions

[edit]

Given two sets X and Y, a binary relation f between X and Y is a function (from X to Y) if for every element x in X there is exactly one y in Y such that f relates x to y. The sets X and Y are called the domain and codomain of f, respectively. The image of the function f is the subset of Y consisting of only those elements y of Y such that there is at least one x in X with f(x) = y.

## Usage

[edit]

As the term "range" can have different meanings, it is considered a good practice to define it the first time it is used in a textbook or article. Older books, when they use the word "range", tend to use it to mean what is now called the codomain.[1] More modern books, if they use the word "range" at all, generally use it to mean what is now called the image.[2] To avoid any confusion, a number of modern books don't use the word "range" at all.[3]

## Elaboration and example

[edit]

Given a function

f : X -> Y {\displaystyle f\colon X\to Y}

with domain X {\displaystyle X} , the range of  f {\displaystyle f} , sometimes denoted  ran ⁡ ( f ) {\displaystyle \operatorname {ran} (f)} or  Range ⁡ ( f ) {\displaystyle \operatorname {Range} (f)} ,[4] may refer to the codomain or target set  Y {\displaystyle Y} (i.e., the set into which all of the output of  f {\displaystyle f} is constrained to fall), or to  f ( X ) {\displaystyle f(X)} , the image of the domain of  f {\displaystyle f} under  f {\displaystyle f} (i.e., the subset of  Y {\displaystyle Y} consisting of all actual outputs of  f {\displaystyle f} ). The image of a function is always a subset of the codomain of the function.[5]

As an example of the two different usages, consider the function  f ( x ) = x 2 {\displaystyle f(x)=x^{2}} as it is used in real analysis (that is, as a function that inputs a real number and outputs its square). In this case, its codomain is the set of real numbers  R {\displaystyle \mathbb {R} } , but its image is the set of non-negative real numbers  R + {\displaystyle \mathbb {R} ^{+}} , since  x 2 {\displaystyle x^{2}} is never negative if  x {\displaystyle x} is real. For this function, if we use "range" to mean codomain, it refers to  R {\displaystyle \mathbb {\displaystyle \mathbb {R} ^{}} } ; if we use "range" to mean image, it refers to  R + {\displaystyle \mathbb {R} ^{+}} .

For some functions, the image and the codomain coincide; these functions are called surjective or onto. For example, consider the function  f ( x ) = 2 x , {\displaystyle f(x)=2x,} which inputs a real number and outputs its double. For this function, both the codomain and the image are the set of all real numbers, so the word range is unambiguous.

Even in cases where the image and codomain of a function are different, a new function can be uniquely defined with its codomain as the image of the original function. For example, as a function from the integers to the integers, the doubling function  f ( n ) = 2 n {\displaystyle f(n)=2n} is not surjective because only the even integers are part of the image. However, a new function  f ~ ( n ) = 2 n {\displaystyle {\tilde {f}}(n)=2n} whose domain is the integers and whose codomain is the even integers is surjective. For  f ~ , {\displaystyle {\tilde {f}},} the word range is unambiguous.

## See also

[edit]

* Bijection, injection and surjection
* Essential range

## Notes and references

[edit]

1. ^ Hungerford 1974, p. 3; Childs 2009, p. 140.
2. ^ Dummit & Foote 2004, p. 2.
3. ^ Rudin 1991, p. 99.
4. ^ Weisstein, Eric W. "Range". mathworld.wolfram.com. Retrieved 2020-08-28.
5. ^ Nykamp, Duane. "Range definition". Math Insight. Retrieved August 28, 2020.

## Bibliography

[edit]

* Childs, Lindsay N. (2009). Childs, Lindsay N. (ed.). A Concrete Introduction to Higher Algebra. Undergraduate Texts in Mathematics (3rd ed.). Springer. doi:10.1007/978-0-387-74725-5. ISBN 978-0-387-74527-5. OCLC 173498962.
* Dummit, David S.; Foote, Richard M. (2004). Abstract Algebra (3rd ed.). Wiley. ISBN 978-0-471-43334-7. OCLC 52559229.
* Hungerford, Thomas W. (1974). Algebra. Graduate Texts in Mathematics. Vol. 73\. Springer. doi:10.1007/978-1-4612-6101-8. ISBN 0-387-90518-9. OCLC 703268.
* Rudin, Walter (1991). Functional Analysis (2nd ed.). McGraw Hill. ISBN 0-07-054236-8.

* v
* t
* e

Mathematical logic

General|

* Axiom
* list
* Cardinality
* First-order logic
* Formal proof
* Formal semantics
* Foundations of mathematics
* Information theory
* Lemma
* Logical consequence
* Model
* Theorem
* Theory
* Type theory

Theorems (list)
and paradoxes|

* Gödel's completeness and incompleteness theorems
* Tarski's undefinability
* Banach–Tarski paradox
* Cantor's theorem, paradox and diagonal argument
* Compactness
* Halting problem
* Lindström's
* Löwenheim–Skolem
* Russell's paradox

Logics|

| Traditional|

* Classical logic
* Logical truth
* Tautology
* Proposition
* Inference
* Logical equivalence
* Consistency
* Equiconsistency
* Argument
* Soundness
* Validity
* Syllogism
* Square of opposition
* Venn diagram

|

Propositional|

* Boolean algebra
* Boolean functions
* Logical connectives
* Propositional calculus
* Propositional formula
* Truth tables
* Many-valued logic
* 3
* finite
* ∞

Predicate|

* First-order
* list
* Second-order
* Monadic
* Higher-order
* Fixed-point
* Free
* Quantifiers
* Predicate
* Monadic predicate calculus

Set theory|

* Set
* hereditary
* Class
* (Ur-)Element
* Ordinal number
* Extensionality
* Forcing
* Relation
* equivalence
* partition
* Set operations:
* intersection
* union
* complement
* Cartesian product
* power set
* identities

Types of sets|

* Countable
* Uncountable
* Empty
* Inhabited
* Singleton
* Finite
* Infinite
* Transitive
* Ultrafilter
* Recursive
* Fuzzy
* Universal
* Universe
* constructible
* Grothendieck
* Von Neumann

Maps and cardinality|

* Function/Map
* domain
* codomain
* image
* In/Sur/Bi-jection
* Schröder–Bernstein theorem
* Isomorphism
* Gödel numbering
* Enumeration
* Large cardinal
* inaccessible
* Aleph number
* Operation
* binary

Set theories|

* Zermelo–Fraenkel
* axiom of choice
* continuum hypothesis
* General
* Kripke–Platek
* Morse–Kelley
* Naive
* New Foundations
* Tarski–Grothendieck
* Von Neumann–Bernays–Gödel
* Ackermann
* Constructive

Formal systems (list),
language and syntax|

* Alphabet
* Arity
* Automata
* Axiom schema
* Expression
* ground
* Extension
* by definition
* conservative
* Relation
* Formation rule
* Grammar
* Formula
* atomic
* closed
* ground
* open
* Free/bound variable
* Language
* Metalanguage
* Logical connective
* ¬
* ∨
* ∧
* →
* ↔
* =
* Predicate
* functional
* variable
* propositional variable
* Proof
* Quantifier
* ∃
* !
* ∀
* rank
* Sentence
* atomic
* spectrum
* Signature
* String
* Substitution
* Symbol
* function
* logical/constant
* non-logical
* variable
* Term
* Theory
* list

Example axiomatic
systems (list)|

* of arithmetic:
* Peano
* second-order
* elementary function
* primitive recursive
* Robinson
* Skolem
* of the real numbers
* Tarski's axiomatization
* of Boolean algebras
* canonical
* minimal axioms
* of geometry:
* Euclidean:
* Elements
* Hilbert's
* Tarski's
* non-Euclidean

* Principia Mathematica

Proof theory|

* Formal proof
* Natural deduction
* Logical consequence
* Rule of inference
* Sequent calculus
* Theorem
* Systems
* axiomatic
* deductive
* Hilbert
* list
* Complete theory
* Independence (from ZFC)
* Proof of impossibility
* Ordinal analysis
* Reverse mathematics
* Self-verifying theories

Model theory|

* Interpretation
* function
* of models
* Model
* equivalence
* finite
* saturated
* spectrum
* submodel
* Non-standard model
* of arithmetic
* Diagram
* elementary
* Categorical theory
* Model complete theory
* Satisfiability
* Semantics of logic
* Strength
* Theories of truth
* semantic
* Tarski's
* Kripke's
* T-schema
* Transfer principle
* Truth predicate
* Truth value
* Type
* Ultraproduct
* Validity

Computability theory|

* Church encoding
* Church–Turing thesis
* Computably enumerable
* Computable function
* Computable set
* Decision problem
* decidable
* undecidable
* P
* NP
* P versus NP problem
* Kolmogorov complexity
* Lambda calculus
* Primitive recursive function
* Recursion
* Recursive set
* Turing machine
* Type theory

Related|

* Abstract logic
* Algebraic logic
* Automated theorem proving
* Category theory
* Concrete/Abstract category
* Category of sets
* History of logic
* History of mathematical logic
* timeline
* Logicism
* Mathematical object
* Philosophy of mathematics
* Supertask

Mathematics portal
*[v]: View this template
*[t]: Discuss this template
*[e]: Edit this template