Lesson plan

Ordered pair

associates to each point in the Euclidean plane an ordered pair. The red ellipse is associated with the set of all pairs (x,y) such that . In mathematics, an ordered pair, denoted (a, b), is a pair of objects in which their order is significant. If a and b are different, then (a,b) is different from (b,a). In contrast, the unordered pair {a,b} always equals the unordered pair {b,a}. Ordered pairs are also called 2-tuples, or sequences (sometimes, lists in a computer science context) of length 2. Ordered pairs of scalars are sometimes called 2-dimensional vectors (technically, this is an abuse of terminology since an ordered pair need not be an element of a vector space). The entries of an ordered pair can be other ordered pairs, enabling the recursive definition of ordered n-tuples (ordered lists of n objects). For example, the ordered triple (a,b,c) can be defined as (a, (b,c)), i.e., as one pair nested in another. In the ordered pair (a, b), the object a is called the first entry, and the object b the second entry of the pair. Alternatively, the objects are called the first and second components, the first and second coordinates, or the left and right projections of the ordered pair. Cartesian products and binary relations (and hence functions) are defined in terms of ordered pairs, cf. picture.

Back to article

Article summary

associates to each point in the Euclidean plane an ordered pair. The red ellipse is associated with the set of all pairs (x,y) such that . In mathematics, an ordered pair, denoted (a, b), is a pair of objects in which their order is significant. If a and b are different, then (a,b) is different from (b,a). In contrast, the unordered pair {a,b} always equals the unordered pair {b,a}. Ordered pairs are also called 2-tuples, or sequences (sometimes, lists in a computer science context) of length 2. Ordered pairs of scalars are sometimes called 2-dimensional vectors (technically, this is an abuse of terminology since an ordered pair need not be an element of a vector space). The entries of an ordered pair can be other ordered pairs, enabling the recursive definition of ordered n-tuples (ordered lists of n objects). For example, the ordered triple (a,b,c) can be defined as (a, (b,c)), i.e., as one pair nested in another. In the ordered pair (a, b), the object a is called the first entry, and the object b the second entry of the pair. Alternatively, the objects are called the first and second components, the first and second coordinates, or the left and right projections of the ordered pair. Cartesian products and binary relations (and hence functions) are defined in terms of ordered pairs, cf. picture.

Key claims

  1. publication date: 1954 — source: Wikipedia, revision 1367619468, retrieved 2026-10-20 · confidence 0.95
  2. publication date: 1970 — source: Wikipedia, revision 1367619468, retrieved 2026-10-20 · confidence 0.95

Discussion questions

  1. Summarise the article in your own words. Which single claim would you verify first, and why?
  2. The record states that the publication date is "1954". What evidence would count against this claim?
  3. The record states that the publication date is "1970". What evidence would count against this claim?
  4. Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
  5. If two sources disagreed about one of these facts, what would you need in order to trust one over the other?

Bibliography

  1. Wikipedia, “Ordered pair”, revision 1367619468, retrieved 2026-10-20 https://en.wikipedia.org/w/index.php?oldid=1367619468

Key claims and bibliography are generated from the same tracked claims and sources as the article page.