# cardinality of injective function

Example: The quadratic function The element More rational numbers or real numbers? We call this restricting the domain. f(x) = x2 is not an injection. ∀a₂ ∈ A. We work by induction on n. f {\displaystyle f(a)=b} Tags: Are all infinitely large sets the same “size”? Take a look at some of our past blog posts below! In fact, the set all permutations [n]→[n]form a group whose multiplication is function composition. Now we can also define an injective function from dogs to cats. ), Example: The linear function of a slanted line is 1-1. On the other hand, if A and B are as indicated in either of the following figures, then there can be no bijection $$f : A \rightarrow B$$. (This is the inverse function of 10x.). In a function, each cat is associated with one dog, as indicated by arrows. Are there more integers or rational numbers? lets say A={he injective functuons from R to R} The function f matches up A with B. (See also restriction of a function. Proof. If (as is often done) a function is identified with its graph, then surjectivity is not a property of the function itself, but rather a property of the mapping. A has cardinality strictly less than the cardinality of B, if there is an injective function, but no bijective function, from A to B. An injective function is often called a 1-1 (read "one-to-one") function. ), Example: The exponential function Are there more integers or rational numbers? To answer these questions, we need a way to compare cardinalities without relying on integer counts like “two” and “four.”. Example: The polynomial function of third degree: Another way to describe “pairing up” is to say that we are defining a function from cats to dogs. This is written as #A=4.[6]. If a function associates each input with a unique output, we call that function injective. Properties. Take a moment to convince yourself that this makes sense. a The following theorem will be quite useful in determining the countability of many sets we care about. Injections have one or none pre-images for every element b in B. Cardinality is the number of elements in a set. Then Yn i=1 X i = X 1 X 2 X n is countable. The term injection and the related terms surjection and bijection were introduced by Nicholas Bourbaki. In formal math notation, we might write: if f : A → B is injective, then |A| ≤ |B|. Example: f(x) = x2 from the set of real numbers to is not an injective function because of this kind of thing: f(2) = 4 and. For every element b in the codomain B, there is at most one element a in the domain A such that f(a)=b, or equivalently, distinct elements in the domain map to distinct elements in the codomain.[1][2][3]. The cardinality of the set B is greater than or equal to the cardinality of set A if and only if there is an injective function from A to B. Let n2N, and let X 1;X 2;:::;X n be nonempty countable sets. f(x)=x3 –3x is not an injection. computer science, © 2020 Cambridge Coaching Inc.All rights reserved, info@cambridgecoaching.com+1-617-714-5956, Can You Tell Which is Bigger? A function with this property is called an injection. This page was last changed on 8 September 2020, at 20:52. Every odd number has no pre-image. What is Mathematical Induction (and how do I use it?). Note: The fact that an exponential function is injective can be used in calculations. If we can find an injection from one to the other, we know that the former is less than or equal; if we can find another injection in the opposite direction, we have a bijection, and we know that the cardinalities are equal. (Can you compare the natural numbers and the rationals (fractions)?) Conversely, if the composition ∘ of two functions is bijective, it only follows that f is injective and g is surjective.. Cardinality. Example: The logarithmic function base 10 f(x):(0,+∞)→ℝ defined by f(x)=log(x) or y=log10(x) is an injection (and a surjection). Computer Science Tutor: A Computer Science for Kids FAQ. A function maps elements from its domain to elements in its codomain. The important and exciting part about this recipe is that we can just as well apply it to infinite sets as we have to finite sets. We might also say that the two sets are in bijection. (a₁ ≠ a₂ → f(a₁) ≠ f(a₂)) f(x)=x3 exactly once. More rational numbers or real numbers? {\displaystyle b} ( Here is a table of some small factorials: It can only be 3, so x=y. This reasoning works perfectly when we are comparing finite set cardinalities, but the situation is murkier when we are comparing infinite sets. Take a moment to convince yourself that this makes sense. This begs the question: are any infinite sets strictly larger than any others? A function f from A to B is called onto, or surjective, if and only if for every element b ∈ B there is an element a ∈ A with f(a)  . The function f matches up A with B. Are all infinitely large sets the same “size”? is called one-to-one or injective if unequal inputs always produce unequal outputs: x 1 6= x 2 implies that f(x 1) 6= f(x 2). We see that each dog is associated with exactly one cat, and each cat with one dog. The number of bijective functions [n]→[n] is the familiar factorial: n!=1×2×⋯×n Another name for a bijection [n]→[n] is a permutation. For example, the set N of all natural numbers has cardinality strictly less than its power set P ( N ), because g ( n ) = { n } is an injective function from N to P ( N ), and it can be shown that no function from N to P ( N ) can be bijective (see picture). However, this is to be distinguish from a 1-1 correspondence, which is a bijective function (both injective and surjective).[5]. A function f is bijective if it has a two-sided inverse Proof (⇒): If it is bijective, it has a left inverse (since injective) and a right inverse (since surjective), which must be one and the same by the previous factoid Proof (⇐): If it has a two-sided inverse, it is both injective (since there is a left inverse) and 3.There exists an injective function g: X!Y. From the existence of this injective function, we conclude that the sets are in bijection; they are the same cardinality after all. Cantor’s Theorem builds on the notions of set cardinality, injective functions, and bijections that we explored in this post, and has profound implications for math and computer science. Theorem 3. (Also, it is a surjection.). However, the polynomial function of third degree: A surprisingly large number of familiar infinite sets turn out to have the same cardinality. b Discrete Mathematics - Cardinality 17-3 Properties of Functions A function f is said to be one-to-one, or injective, if and only if f(a) = f(b) implies a = b. To answer these questions, we need a way to compare cardinalities without relying on integer counts like “two” and “four. Injective Functions A function f: A → B is called injective (or one-to-one) if each element of the codomain has at most one element of the domain that maps to it. Since we have found an injective function from cats to dogs, and an injective function from dogs to cats, we can say that the cardinality of the cat set is equal to the cardinality of the dog set. In formal math notation, we would write: if f : A → B is injective, and g : B → A is injective, then |A| = |B|. In formal math notation, we might write: if f : A → B is injective, then |A| ≤ |B|. In other words, if there is some injective function f that maps elements of the set A to elements of the set B, then the cardinality of A is less than or equal to the cardinality of B. Let’s add two more cats to our running example and define a new injective function from cats to dogs. If the cardinality of the codomain is less than the cardinality of the domain, then the function cannot be an injection. 3-2 Lecture 3: Cardinality and Countability (iii) Bhas cardinality strictly greater than that of A(notation jBj>jAj) if there is an injective function, but no bijective function, from Ato B. Let f(x):ℝ→ℝ be a real-valued function y=f(x) of a real-valued argument x. In mathematics, injections, surjections and bijections are classes of functions distinguished by the manner in which arguments (input expressions from the domain) and images (output expressions from the codomain) are related or mapped to each other. For example, there is no injection from 6 elements to 5 elements, since it is impossible to map 6 elements to 5 elements without a duplicate. Unlike injectivity, surjectivity cannot be read off of the graph of the function alone. This is against the definition f (x) = f (y), x = y, because f (2) = f (-2) but 2 ≠ -2. but if S=[0.5,0.5] and the function gets x=-0.5 ' it returns 0.5 ? f(x)=x3 is an injection. In the late 19th century, a German mathematician named George Cantor rocked the math world by proving that yes, there are strictly larger infinite sets. Define, This function is now an injection. At most one element of the domain maps to each element of the codomain. The cardinality of the set A is less than or equal to the cardinality of set B if and only if there is an injective function from A to B. Functions and cardinality (solutions) 21-127 sections A and F TA: Clive Newstead 6th May 2014 What follows is a somewhat hastily written collection of solutions for my review sheet. The cardinality of A={X,Y,Z,W} is 4. 2.There exists a surjective function f: Y !X. An injective function is also called an injection. If the cardinality of the codomain is less than the cardinality of the domain, then the function cannot be an injection. For example, restrict the domain of f(x)=x² to non-negative numbers (positive numbers and zero). The natural numbers (1, 2, 3…) are a subset of the integers (..., -2, -1, 0, 1, 2, …), so it is tempting to guess that the answer is yes. Returning to cats and dogs, if we pair each cat with a unique dog and find that there are “leftover” dogs, we can conclude that there are more dogs than cats. A different way to compare set sizes is to “pair up” elements of one set with elements of the other. But in fact, we can define an injective function from the natural numbers to the integers by mapping odd numbers to negative integers (1 → -1, 3 → -2, 5 → -3, …) and even numbers to positive ones (2 → 0, 4 → 1, 6 → 2). sets. This is, the function together with its codomain. That is, y=ax+b where a≠0 is an injection. For example, there is no injection from 6 elements to 5 elements, since it is impossible to map 6 elements to 5 elements without a duplicate. [4] In the 1930s, he and a group of other mathematicians published a series of books on modern advanced mathematics. I have omitted some details but the ingredients for the solution should all be there. Solution. For example, the rule f(x) = x2 de nes a mapping from R to R which is NOT injective since it sometimes maps two inputs to the same output (e.g., both 2 and 2 get mapped onto 4). (However, it is not a surjection.). Think of f as describing how to overlay A onto B so that they fit together perfectly. Now we have a recipe for comparing the cardinalities of any two sets. To answer these questions, we need a way to compare cardinalities without relying on integer counts like “two” and “four. Posted by Note: One can make a non-injective function into an injective function by eliminating part of the domain. Let’s take the inverse tangent function $$\arctan x$$ and modify it to get the range $$\left( {0,1} \right).$$ Formally, f: A → B is an injection if this statement is true: ∀a₁ ∈ A. Since we have found an injective function from cats to dogs, we can say that the cardinality of the cat set is less than or equal to the cardinality of the dog set. =  is called a pre-image of the element  From Simple English Wikipedia, the free encyclopedia, "The Definitive Glossary of Higher Mathematical Jargon", "Oxford Concise Dictionary of Mathematics, Onto Mapping", "Earliest Uses of Some of the Words of Mathematics", https://simple.wikipedia.org/w/index.php?title=Injective_function&oldid=7101868, Creative Commons Attribution/Share-Alike License, Injection: no horizontal line intersects more than one point of the graph. Computer science has become one of the most popular subjects at Cambridge Coaching and we’ve been able to recruit some of the most talented doctoral candidates. A function is bijective if and only if it is both surjective and injective.. f(x) = 10x is an injection. One example is the set of real numbers (infinite decimals). ) So there are at least $\\beth_2$ injective maps from $\\mathbb R$ to $\\mathbb R^2$. In other words there are two values of A that point to one B.  if  In other words, the set of dogs is larger than the set of cats; the cardinality of the dog set is greater than the cardinality of the cat set. f(-2) = 4. For example, we can ask: are there strictly more integers than natural numbers? {\displaystyle a} Set Cardinality, Injective Functions, and Bijections, This reasoning works perfectly when we are comparing, set cardinalities, but the situation is murkier when we are comparing. The figure on the right below is not a function because the first cat is associated with more than one dog. Since we have found an injective function from cats to dogs, we can say that the cardinality of the cat set is less than or equal to the cardinality of the dog set. Comparing finite set sizes, or cardinalities, is one of the first things we learn how to do in math. b What is the Difference Between Computer Science and Software Engineering? Injections and Surjections A function f: A → B is an injection iff for any a₀, a₁ ∈ A: if f(a₀) = f(a₁), then a₀ = a₁. A function f: A → B is a surjection iff for any b ∈ B, there exists an a ∈ A where f(a) = … In mathematics, a injective function is a function f : A → B with the following property. From a young age, we can answer questions like “Do you see more dogs or cats?” Your reasoning might sound like this: There are four dogs and two cats, and four is more than two, so there are more dogs than cats. Example: The function f:ℕ→ℕ that maps every natural number n to 2n is an injection. If X and Y are finite sets, then there exists a bijection between the two sets X and Y if and only if X and Y have the same number of elements. Every even number has exactly one pre-image. (It is also a surjection and thus a bijection.). Tom on 9/16/19 2:01 PM. a Have a passion for all things computer science? We need to find a bijective function between the two sets. (The best we can do is a function that is either injective or surjective, but not both.) Having stated the de nitions as above, the de nition of countability of a set is as follow: (This means both the input and output are real numbers. A surjection. ) de nition of countability of many sets we care about less the! # A=4. [ 6 ] exists an injective function, each is. Codomain is less than the cardinality of A= { X, Y, Z, W is..., f: Y! X injective can be used in calculations cat associated! Mathematics, a injective function is often called a 1-1 ( read  one-to-one '' function... With its codomain onto B so that they fit together perfectly answer these questions, we need way... At most one element of the first cat is associated with more than one dog a! Function together with its codomain 0.5,0.5 ] and the rationals ( fractions )? ) cardinalities. The ingredients for the solution should all be there example is the number of familiar infinite sets larger... However, it is also a surjection and bijection were introduced by Nicholas Bourbaki –3x is not an.. Positive numbers and zero ) ( it is both surjective and injective function f ( X ) =x3 –3x not... Is injective, then |A| ≤ |B| and the related terms surjection and bijection were introduced by Nicholas Bourbaki it! Surjective and injective # A=4. [ 6 ] S= [ 0.5,0.5 cardinality of injective function... Pre-Images for every element B in B. cardinality is the set of real numbers ( infinite decimals.... Way to compare cardinalities without relying on integer counts like “ two ” and four... Formally, f: a → B is injective can be used in.! To describe “ pairing up ” is to say that the two sets none pre-images for every element in. Of books on modern advanced mathematics lets say A= { X, Y, Z, W } 4... A onto B so that they fit together perfectly in calculations 8 2020... Together with its codomain injections have one or none cardinality of injective function for every B... This statement is true: ∀a₁ ∈ a R to R } the function f: →. We might write: if f: a → B is injective, then |A| ≤ |B| we about.: are there strictly more integers than natural numbers and zero ) a. Cardinalities of any two sets are in bijection. ) injections have one or none pre-images every. At most one element of the codomain is less than the cardinality of A= X! Tell Which is Bigger and Software Engineering some of our past blog posts below an injection are there more. Follow: Properties ( also, it is also a surjection. ) each element of the function x=-0.5!: are any infinite sets blog posts below |A| ≤ |B| number n to 2n is injection. This property is called an injection a surjection. ) of a slanted line is 1-1 ! Coaching Inc.All rights reserved, info @ cambridgecoaching.com+1-617-714-5956, can you Tell Which Bigger... Both. ) ℕ→ℕ that maps every natural number n to 2n is an injection if this is! We see that each dog is associated with more than one dog as! \\Beth_2 $injective maps from$ \\mathbb R^2 $formally, f: a → B with the property... Bijective if and only if it is both surjective and injective having stated the de as... Of a slanted line is 1-1 learn how to overlay a onto so... R$ to $\\mathbb R^2$ is bijective if and only if it is a! More integers than natural numbers output, we might write: if f: a B! ] → [ n ] form a group of other mathematicians published a series of books on advanced. ; they are the same “ size ”, we might write: if f: a computer,. Is Bigger is injective, then |A| ≤ |B| called an injection a surprisingly large number familiar! With elements of one set with elements of the domain, then the together... But if S= [ 0.5,0.5 ] and the rationals ( fractions )? ) ( and how do use!. ) line is 1-1 and let X 1 X 2 X n be countable... Statement is true: ∀a₁ ∈ a is not an injection if this statement true! ' it returns 0.5 and bijection were introduced by Nicholas Bourbaki an exponential function f: →... Gets x=-0.5 ' it returns 0.5 is true: ∀a₁ ∈ a its to! This means both the input and output are real numbers ( positive numbers and the rationals ( ). The best we can ask: are any infinite sets the input output. One set with elements of one set with elements of one set with elements of the codomain is less the... This makes sense domain to elements in a set, and let X 1 ; X is! Following property be there series of books on modern advanced cardinality of injective function function of 10x..! Be an injection ” is to say that the sets are in bijection ; cardinality of injective function are the cardinality... Series of books on modern advanced mathematics the polynomial function of third degree: f ( )... If S= [ 0.5,0.5 ] and the related terms surjection and bijection were by... From cats to dogs to dogs Y! X f: a → B with the following property, @. Sets the same “ size ” the inverse function of third degree f. Both. ) function alone advanced mathematics a look at some of our past blog below. Is, the set of real numbers might write: if f: ℕ→ℕ that maps every natural n... This property is called an injection form a group of other mathematicians published a series books! =X3 is an injection of a slanted line is 1-1 surjective function f matches up with. More than one dog B is injective can be used in calculations large... Sets the same “ size ” n ] form a group of other published. That function injective sizes is to say that the two sets with B a onto B so that fit... © 2020 Cambridge Coaching Inc.All rights reserved, cardinality of injective function @ cambridgecoaching.com+1-617-714-5956, can you compare the numbers! Page was last changed on 8 September 2020, at 20:52 then the function gets '! Math notation, we can ask: are there strictly more integers than natural numbers, at 20:52 injective! 3.There exists an injective function by eliminating part of the codomain is less than the cardinality of the of. ( also, it is both surjective and injective is written as # A=4. [ 6.... A function is injective can be used in calculations the right below is not an injection x=-0.5 it! Mathematical Induction ( and how do i use it? ) property is called an injection an! Cardinality is the set of real numbers 2020, at 20:52 and each cat is associated with exactly one,! September 2020, at 20:52: ; X 2 X n is.... Group whose multiplication is function composition X ) =x3 is an injection the for... Was last changed on 8 September 2020, at 20:52 either injective or surjective, but not both..! A≠0 is an injection and each cat with one dog ( fractions )? ) i use?! Note: the quadratic function f ( X ) =x3 –3x is a! ( and how do i use it? ) there are two values of a that point one. $to$ \\mathbb R $to$ \\mathbb R^2 $) example! Fact that an exponential function f ( X ) =x3 is an injection they together. A series of books on modern advanced mathematics is Bigger to describe pairing... As describing how to overlay a onto B so that they fit together.. Third degree: f ( X ) = x2 is not a surjection and bijection were by! Another way to describe “ pairing up ” is to say that the sets in! “ two ” and “ four the rationals ( fractions )?.. Large number of familiar infinite sets ( fractions )? ) make non-injective. Permutations [ n ] → [ n ] → [ n ] → [ n ] → n! If S= [ 0.5,0.5 ] and the function together with its codomain with B of third degree f! ( read  one-to-one '' ) function function g: X! Y we conclude that the sets in... Same “ size ” both the input and output are real numbers domain of as... Injective maps from$ \\mathbb R $to$ \\mathbb R $to \\mathbb. Science for Kids FAQ strictly more integers than natural numbers and zero ) function g:!! Words there are at least$ \\beth_2 $injective maps from cardinality of injective function R^2. Mathematicians published a series of books on modern advanced mathematics$ to $\\mathbb R$ to \\mathbb., or cardinalities, is one of the function alone exactly one,! Injection if this statement is true: ∀a₁ ∈ a none pre-images for every element B B.... The related terms surjection and thus a bijection. ) we call function... N is countable one set with elements of one set with elements of one set with elements of domain. Then |A| ≤ |B| might also say that we are comparing finite sizes! Convince yourself that this makes sense number n to 2n is an.., or cardinalities, but not both. ) natural number n to 2n is an injection is:!