Number of one-one function from sets $A$ to $B$.












2












$begingroup$


Let $A={1,2,3,4,5}$ and $B={0,1,2,3,4,5}$. Number of one-one function from $A$ to $B$ such that $f(1) neq 0$ and $f(i)neq i$ for $i={1,2,3,4,5}$ is _______ .



So I know one one function means for each $x$ there will be only one $y$.



But here if I take for $1$ from $A$ then total number of functions $=480$ as ${{4_C}_1}×{{5_P}_4}$



But for every for every other $i$ from $A$ it will be ${{5_C}_1}×{{5_P}_4}$ so total cases will be $480+2400=2880$.



But I don't know how to further proceed.






combinatorics functions permutations inclusion-exclusion







share|cite|improve this question











$endgroup$












  • $begingroup$
    One to one function means for each point in the image of the function ( for each y ) there is exactly one x that maps to it
    $endgroup$
    – Ameryr
    Dec 6 '18 at 17:23










  • $begingroup$
    @Ameryr That's what I have written there
    $endgroup$
    – jayant98
    Dec 6 '18 at 17:42










  • $begingroup$
    “For each x there exists one y” that condition holds for any function f(x) , one to one for each y there exists one x. $f(x)=x^2$ is not one to one if we have $f(1)=2, f(1)=3$ that’s not a function
    $endgroup$
    – Ameryr
    Dec 6 '18 at 23:53






  • 2




    $begingroup$
    To obtain ${1, 2, 3, 4, 5}$, type ${1, 2, 3, 4, 5}$. This is an Inclusion-Exclusion Principle problem.
    $endgroup$
    – N. F. Taussig
    Dec 7 '18 at 10:33
















2












$begingroup$


Let $A={1,2,3,4,5}$ and $B={0,1,2,3,4,5}$. Number of one-one function from $A$ to $B$ such that $f(1) neq 0$ and $f(i)neq i$ for $i={1,2,3,4,5}$ is _______ .



So I know one one function means for each $x$ there will be only one $y$.



But here if I take for $1$ from $A$ then total number of functions $=480$ as ${{4_C}_1}×{{5_P}_4}$



But for every for every other $i$ from $A$ it will be ${{5_C}_1}×{{5_P}_4}$ so total cases will be $480+2400=2880$.



But I don't know how to further proceed.






combinatorics functions permutations inclusion-exclusion







share|cite|improve this question











$endgroup$












  • $begingroup$
    One to one function means for each point in the image of the function ( for each y ) there is exactly one x that maps to it
    $endgroup$
    – Ameryr
    Dec 6 '18 at 17:23










  • $begingroup$
    @Ameryr That's what I have written there
    $endgroup$
    – jayant98
    Dec 6 '18 at 17:42










  • $begingroup$
    “For each x there exists one y” that condition holds for any function f(x) , one to one for each y there exists one x. $f(x)=x^2$ is not one to one if we have $f(1)=2, f(1)=3$ that’s not a function
    $endgroup$
    – Ameryr
    Dec 6 '18 at 23:53






  • 2




    $begingroup$
    To obtain ${1, 2, 3, 4, 5}$, type ${1, 2, 3, 4, 5}$. This is an Inclusion-Exclusion Principle problem.
    $endgroup$
    – N. F. Taussig
    Dec 7 '18 at 10:33














2












2








2


1



$begingroup$


Let $A={1,2,3,4,5}$ and $B={0,1,2,3,4,5}$. Number of one-one function from $A$ to $B$ such that $f(1) neq 0$ and $f(i)neq i$ for $i={1,2,3,4,5}$ is _______ .



So I know one one function means for each $x$ there will be only one $y$.



But here if I take for $1$ from $A$ then total number of functions $=480$ as ${{4_C}_1}×{{5_P}_4}$



But for every for every other $i$ from $A$ it will be ${{5_C}_1}×{{5_P}_4}$ so total cases will be $480+2400=2880$.



But I don't know how to further proceed.






combinatorics functions permutations inclusion-exclusion







share|cite|improve this question











$endgroup$




Let $A={1,2,3,4,5}$ and $B={0,1,2,3,4,5}$. Number of one-one function from $A$ to $B$ such that $f(1) neq 0$ and $f(i)neq i$ for $i={1,2,3,4,5}$ is _______ .



So I know one one function means for each $x$ there will be only one $y$.



But here if I take for $1$ from $A$ then total number of functions $=480$ as ${{4_C}_1}×{{5_P}_4}$



But for every for every other $i$ from $A$ it will be ${{5_C}_1}×{{5_P}_4}$ so total cases will be $480+2400=2880$.



But I don't know how to further proceed.






combinatorics functions permutations inclusion-exclusion




combinatorics functions permutations inclusion-exclusion






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Dec 19 '18 at 20:43







jayant98

















asked Dec 6 '18 at 16:24









jayant98jayant98

528116




528116












  • $begingroup$
    One to one function means for each point in the image of the function ( for each y ) there is exactly one x that maps to it
    $endgroup$
    – Ameryr
    Dec 6 '18 at 17:23










  • $begingroup$
    @Ameryr That's what I have written there
    $endgroup$
    – jayant98
    Dec 6 '18 at 17:42










  • $begingroup$
    “For each x there exists one y” that condition holds for any function f(x) , one to one for each y there exists one x. $f(x)=x^2$ is not one to one if we have $f(1)=2, f(1)=3$ that’s not a function
    $endgroup$
    – Ameryr
    Dec 6 '18 at 23:53






  • 2




    $begingroup$
    To obtain ${1, 2, 3, 4, 5}$, type ${1, 2, 3, 4, 5}$. This is an Inclusion-Exclusion Principle problem.
    $endgroup$
    – N. F. Taussig
    Dec 7 '18 at 10:33


















  • $begingroup$
    One to one function means for each point in the image of the function ( for each y ) there is exactly one x that maps to it
    $endgroup$
    – Ameryr
    Dec 6 '18 at 17:23










  • $begingroup$
    @Ameryr That's what I have written there
    $endgroup$
    – jayant98
    Dec 6 '18 at 17:42










  • $begingroup$
    “For each x there exists one y” that condition holds for any function f(x) , one to one for each y there exists one x. $f(x)=x^2$ is not one to one if we have $f(1)=2, f(1)=3$ that’s not a function
    $endgroup$
    – Ameryr
    Dec 6 '18 at 23:53






  • 2




    $begingroup$
    To obtain ${1, 2, 3, 4, 5}$, type ${1, 2, 3, 4, 5}$. This is an Inclusion-Exclusion Principle problem.
    $endgroup$
    – N. F. Taussig
    Dec 7 '18 at 10:33
















$begingroup$
One to one function means for each point in the image of the function ( for each y ) there is exactly one x that maps to it
$endgroup$
– Ameryr
Dec 6 '18 at 17:23




$begingroup$
One to one function means for each point in the image of the function ( for each y ) there is exactly one x that maps to it
$endgroup$
– Ameryr
Dec 6 '18 at 17:23












$begingroup$
@Ameryr That's what I have written there
$endgroup$
– jayant98
Dec 6 '18 at 17:42




$begingroup$
@Ameryr That's what I have written there
$endgroup$
– jayant98
Dec 6 '18 at 17:42












$begingroup$
“For each x there exists one y” that condition holds for any function f(x) , one to one for each y there exists one x. $f(x)=x^2$ is not one to one if we have $f(1)=2, f(1)=3$ that’s not a function
$endgroup$
– Ameryr
Dec 6 '18 at 23:53




$begingroup$
“For each x there exists one y” that condition holds for any function f(x) , one to one for each y there exists one x. $f(x)=x^2$ is not one to one if we have $f(1)=2, f(1)=3$ that’s not a function
$endgroup$
– Ameryr
Dec 6 '18 at 23:53




2




2




$begingroup$
To obtain ${1, 2, 3, 4, 5}$, type ${1, 2, 3, 4, 5}$. This is an Inclusion-Exclusion Principle problem.
$endgroup$
– N. F. Taussig
Dec 7 '18 at 10:33




$begingroup$
To obtain ${1, 2, 3, 4, 5}$, type ${1, 2, 3, 4, 5}$. This is an Inclusion-Exclusion Principle problem.
$endgroup$
– N. F. Taussig
Dec 7 '18 at 10:33










2 Answers
2






active

oldest

votes


















1












$begingroup$

Definition. A number $c$ is said to be a fixed point of a function if $f(c) = c$.



Let $A = {1, 2, 3, 4, 5}$; let $B = {0, 1, 2, 3, 4, 5}$.



If there were no restrictions, we would have $6 cdot 5 cdot 4 cdot 3 cdot 2 = 6!$ ways to map the elements in the domain to distinct elements in the codomain. Hence, there are $6!$ injective functions $f: A to B$. From these, we must exclude those that violate the restrictions that $f(0) neq 1$ and that $f(i) neq i, 1 leq i leq 5$.



We will use the Inclusion-Exclusion Principle.



A number in the domain is mapped to a prohibited value of the codomain: We consider two cases, depending on whether or not that number is $1$.



The number $1$ is mapped to $0$ or $1$: There are two ways to choose the image of $1$. That leaves five elements in the codomain to which the remaining four numbers in the domain can be mapped. The remaining numbers in the domain can be mapped to distinct elements of that subset of the codomain in $5 cdot 4 cdot 3 cdot 2 = 5!$ ways. Hence, there are
$$binom{2}{1}5!$$
such injective functions.



A number other than $1$ is a fixed point: There are four ways to choose which of the four numbers larger than $1$ is a fixed point. That leaves five numbers in the codomain to which the remaining four elements in the domain can be mapped. The remaining numbers in the domain can be mapped to distinct elements of that subset of the codomain in $5!$ ways. Hence, there are
$$binom{4}{1}5!$$
such injective functions.



Hence, there are
$$binom{2}{1}5! + binom{4}{1}5!$$
injective functions in which a number in the codomain is mapped to a prohibited element of the codomain.



Two numbers in the domain are mapped to probibited values of the codomain: We again have to consider two cases, depending on whether or not $1$ is one of the numbers that is mapped to a prohibited value.



The number $1$ is mapped to $0$ or $1$ and another number is a fixed point: There are $2$ ways to choose the image of $1$ and four ways to pick which of the other four numbers in the codomain is a fixed point. That leaves four numbers in the codomain to which the remaining three elements in the codomain can be mapped. The remaining numbers in the domain can be mapped to distinct elements of that subset of the codomain in $4 cdot 3 cdot 2 = 4!$ ways. Hence, there are
$$binom{2}{1}binom{4}{1}4!$$
such injective functions.



Two numbers larger than $1$ are fixed points: There are $binom{4}{2}$ ways to choose the two fixed points. That leaves four numbers in the codomain to which the remaining three elements in the domain can be mapped. The remaining numbers in the domain can be mapped to distinct elements that subset of the codomain in $4!$ ways. Hence, there are
$$binom{4}{2}4!$$
such injective functions.



Three numbers in the domain are mapped to prohibited values of the codomain: As above, we have two cases.



The number $1$ is mapped to $0$ or $1$ and two other numbers are fixed points: We choose the image of $1$ and which two of the other four numbers are fixed points. That leaves three elements in the codomain to which the remaining two elements in the domain can be mapped. We choose how to map those two elements to distinct elements of that subset of the codomain. There are




$$binom{2}{1}binom{4}{2}3!$$




such injective functions.



Three numbers larger than $1$ are fixed points: We choose which three of those four numbers are fixed points. That leaves three elements in the codomain to which the remaining two elements in the domain can be mapped. We choose how to map those two elements to distinct elements of that subset of the codomain. There are




$$binom{4}{3}3!$$




such injective functions.



Hence, there are




$$binom{2}{1}binom{4}{2}3! + binom{4}{3}3!$$




injective functions in which three numbers in the domain are mapped to prohibited elements in the codomain.



Four elements in the domain are mapped to prohibited values in the codomain: Again, there are two cases.



The number $1$ is mapped to $0$ or $1$ and three of the other four numbers are fixed points: Choose the image of $1$ and which three of the other four numbers are fixed points. Assign the remaining number in the domain to one of the two remaining numbers in the codomain. There are




$$binom{2}{1}binom{4}{3}2!$$




such injective functions.



All four numbers larger than $1$ are fixed points: That leaves two ways to assign $1$ to one of the remaining elements in the codomain (yes, we have already counted this case, but the Inclusion-Exclusion Principle compensates for that). There are




$$binom{4}{4}2!$$




such injective functions.



Hence, there are




$$binom{2}{1}binom{4}{3}2! + binom{4}{4}2!$$




injective functions in which four elements of the domain are mapped to probibited elements of the codomain.



All five elements of the domain are mapped to prohibited values in the codomain: There are two possibilities. Either $1$ is mapped to $0$ and the other four numbers are fixed points or all five numbers are fixed points. There are




$$binom{2}{1}binom{4}{4}$$




such functions.



By the Inclusion-Exclusion Principle, the number of injective functions $f: A to B$ such that $f(1) neq 0$ and $f(i) neq i, 1 leq i leq 5$, is




$$6! - binom{2}{1}5! - binom{4}{1}5! + binom{2}{1}binom{4}{1}4! + binom{4}{2}4! - binom{2}{1}binom{4}{2}3! - binom{4}{3}3! + binom{2}{1}binom{4}{3}2! + binom{4}{4}2! - binom{2}{1}binom{4}{4}$$







share|cite|improve this answer









$endgroup$





















    0












    $begingroup$

    I have a suitable result for your problem. Don't take it as an answer:



    Let, $A, B$ be two nonempty sets with $|A|=m<|B|=n$ and $f: Ato B$ is a function, then the total number of onto function is zero and the total number of one-one function is: $^nC_mm!$ for all $n,minmathbb{N}$






    share|cite|improve this answer









    $endgroup$













    • $begingroup$
      For proof: math.stackexchange.com/questions/243500/…
      $endgroup$
      – Sujit Bhattacharyya
      Dec 7 '18 at 10:38











    Your Answer





    StackExchange.ifUsing("editor", function () {
    return StackExchange.using("mathjaxEditing", function () {
    StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
    StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
    });
    });
    }, "mathjax-editing");

    StackExchange.ready(function() {
    var channelOptions = {
    tags: "".split(" "),
    id: "69"
    };
    initTagRenderer("".split(" "), "".split(" "), channelOptions);

    StackExchange.using("externalEditor", function() {
    // Have to fire editor after snippets, if snippets enabled
    if (StackExchange.settings.snippets.snippetsEnabled) {
    StackExchange.using("snippets", function() {
    createEditor();
    });
    }
    else {
    createEditor();
    }
    });

    function createEditor() {
    StackExchange.prepareEditor({
    heartbeatType: 'answer',
    autoActivateHeartbeat: false,
    convertImagesToLinks: true,
    noModals: true,
    showLowRepImageUploadWarning: true,
    reputationToPostImages: 10,
    bindNavPrevention: true,
    postfix: "",
    imageUploader: {
    brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
    contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
    allowUrls: true
    },
    noCode: true, onDemand: true,
    discardSelector: ".discard-answer"
    ,immediatelyShowMarkdownHelp:true
    });


    }
    });














    draft saved

    draft discarded


















    StackExchange.ready(
    function () {
    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3028709%2fnumber-of-one-one-function-from-sets-a-to-b%23new-answer', 'question_page');
    }
    );

    Post as a guest















    Required, but never shown

























    2 Answers
    2






    active

    oldest

    votes








    2 Answers
    2






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes









    1












    $begingroup$

    Definition. A number $c$ is said to be a fixed point of a function if $f(c) = c$.



    Let $A = {1, 2, 3, 4, 5}$; let $B = {0, 1, 2, 3, 4, 5}$.



    If there were no restrictions, we would have $6 cdot 5 cdot 4 cdot 3 cdot 2 = 6!$ ways to map the elements in the domain to distinct elements in the codomain. Hence, there are $6!$ injective functions $f: A to B$. From these, we must exclude those that violate the restrictions that $f(0) neq 1$ and that $f(i) neq i, 1 leq i leq 5$.



    We will use the Inclusion-Exclusion Principle.



    A number in the domain is mapped to a prohibited value of the codomain: We consider two cases, depending on whether or not that number is $1$.



    The number $1$ is mapped to $0$ or $1$: There are two ways to choose the image of $1$. That leaves five elements in the codomain to which the remaining four numbers in the domain can be mapped. The remaining numbers in the domain can be mapped to distinct elements of that subset of the codomain in $5 cdot 4 cdot 3 cdot 2 = 5!$ ways. Hence, there are
    $$binom{2}{1}5!$$
    such injective functions.



    A number other than $1$ is a fixed point: There are four ways to choose which of the four numbers larger than $1$ is a fixed point. That leaves five numbers in the codomain to which the remaining four elements in the domain can be mapped. The remaining numbers in the domain can be mapped to distinct elements of that subset of the codomain in $5!$ ways. Hence, there are
    $$binom{4}{1}5!$$
    such injective functions.



    Hence, there are
    $$binom{2}{1}5! + binom{4}{1}5!$$
    injective functions in which a number in the codomain is mapped to a prohibited element of the codomain.



    Two numbers in the domain are mapped to probibited values of the codomain: We again have to consider two cases, depending on whether or not $1$ is one of the numbers that is mapped to a prohibited value.



    The number $1$ is mapped to $0$ or $1$ and another number is a fixed point: There are $2$ ways to choose the image of $1$ and four ways to pick which of the other four numbers in the codomain is a fixed point. That leaves four numbers in the codomain to which the remaining three elements in the codomain can be mapped. The remaining numbers in the domain can be mapped to distinct elements of that subset of the codomain in $4 cdot 3 cdot 2 = 4!$ ways. Hence, there are
    $$binom{2}{1}binom{4}{1}4!$$
    such injective functions.



    Two numbers larger than $1$ are fixed points: There are $binom{4}{2}$ ways to choose the two fixed points. That leaves four numbers in the codomain to which the remaining three elements in the domain can be mapped. The remaining numbers in the domain can be mapped to distinct elements that subset of the codomain in $4!$ ways. Hence, there are
    $$binom{4}{2}4!$$
    such injective functions.



    Three numbers in the domain are mapped to prohibited values of the codomain: As above, we have two cases.



    The number $1$ is mapped to $0$ or $1$ and two other numbers are fixed points: We choose the image of $1$ and which two of the other four numbers are fixed points. That leaves three elements in the codomain to which the remaining two elements in the domain can be mapped. We choose how to map those two elements to distinct elements of that subset of the codomain. There are




    $$binom{2}{1}binom{4}{2}3!$$




    such injective functions.



    Three numbers larger than $1$ are fixed points: We choose which three of those four numbers are fixed points. That leaves three elements in the codomain to which the remaining two elements in the domain can be mapped. We choose how to map those two elements to distinct elements of that subset of the codomain. There are




    $$binom{4}{3}3!$$




    such injective functions.



    Hence, there are




    $$binom{2}{1}binom{4}{2}3! + binom{4}{3}3!$$




    injective functions in which three numbers in the domain are mapped to prohibited elements in the codomain.



    Four elements in the domain are mapped to prohibited values in the codomain: Again, there are two cases.



    The number $1$ is mapped to $0$ or $1$ and three of the other four numbers are fixed points: Choose the image of $1$ and which three of the other four numbers are fixed points. Assign the remaining number in the domain to one of the two remaining numbers in the codomain. There are




    $$binom{2}{1}binom{4}{3}2!$$




    such injective functions.



    All four numbers larger than $1$ are fixed points: That leaves two ways to assign $1$ to one of the remaining elements in the codomain (yes, we have already counted this case, but the Inclusion-Exclusion Principle compensates for that). There are




    $$binom{4}{4}2!$$




    such injective functions.



    Hence, there are




    $$binom{2}{1}binom{4}{3}2! + binom{4}{4}2!$$




    injective functions in which four elements of the domain are mapped to probibited elements of the codomain.



    All five elements of the domain are mapped to prohibited values in the codomain: There are two possibilities. Either $1$ is mapped to $0$ and the other four numbers are fixed points or all five numbers are fixed points. There are




    $$binom{2}{1}binom{4}{4}$$




    such functions.



    By the Inclusion-Exclusion Principle, the number of injective functions $f: A to B$ such that $f(1) neq 0$ and $f(i) neq i, 1 leq i leq 5$, is




    $$6! - binom{2}{1}5! - binom{4}{1}5! + binom{2}{1}binom{4}{1}4! + binom{4}{2}4! - binom{2}{1}binom{4}{2}3! - binom{4}{3}3! + binom{2}{1}binom{4}{3}2! + binom{4}{4}2! - binom{2}{1}binom{4}{4}$$







    share|cite|improve this answer









    $endgroup$


















      1












      $begingroup$

      Definition. A number $c$ is said to be a fixed point of a function if $f(c) = c$.



      Let $A = {1, 2, 3, 4, 5}$; let $B = {0, 1, 2, 3, 4, 5}$.



      If there were no restrictions, we would have $6 cdot 5 cdot 4 cdot 3 cdot 2 = 6!$ ways to map the elements in the domain to distinct elements in the codomain. Hence, there are $6!$ injective functions $f: A to B$. From these, we must exclude those that violate the restrictions that $f(0) neq 1$ and that $f(i) neq i, 1 leq i leq 5$.



      We will use the Inclusion-Exclusion Principle.



      A number in the domain is mapped to a prohibited value of the codomain: We consider two cases, depending on whether or not that number is $1$.



      The number $1$ is mapped to $0$ or $1$: There are two ways to choose the image of $1$. That leaves five elements in the codomain to which the remaining four numbers in the domain can be mapped. The remaining numbers in the domain can be mapped to distinct elements of that subset of the codomain in $5 cdot 4 cdot 3 cdot 2 = 5!$ ways. Hence, there are
      $$binom{2}{1}5!$$
      such injective functions.



      A number other than $1$ is a fixed point: There are four ways to choose which of the four numbers larger than $1$ is a fixed point. That leaves five numbers in the codomain to which the remaining four elements in the domain can be mapped. The remaining numbers in the domain can be mapped to distinct elements of that subset of the codomain in $5!$ ways. Hence, there are
      $$binom{4}{1}5!$$
      such injective functions.



      Hence, there are
      $$binom{2}{1}5! + binom{4}{1}5!$$
      injective functions in which a number in the codomain is mapped to a prohibited element of the codomain.



      Two numbers in the domain are mapped to probibited values of the codomain: We again have to consider two cases, depending on whether or not $1$ is one of the numbers that is mapped to a prohibited value.



      The number $1$ is mapped to $0$ or $1$ and another number is a fixed point: There are $2$ ways to choose the image of $1$ and four ways to pick which of the other four numbers in the codomain is a fixed point. That leaves four numbers in the codomain to which the remaining three elements in the codomain can be mapped. The remaining numbers in the domain can be mapped to distinct elements of that subset of the codomain in $4 cdot 3 cdot 2 = 4!$ ways. Hence, there are
      $$binom{2}{1}binom{4}{1}4!$$
      such injective functions.



      Two numbers larger than $1$ are fixed points: There are $binom{4}{2}$ ways to choose the two fixed points. That leaves four numbers in the codomain to which the remaining three elements in the domain can be mapped. The remaining numbers in the domain can be mapped to distinct elements that subset of the codomain in $4!$ ways. Hence, there are
      $$binom{4}{2}4!$$
      such injective functions.



      Three numbers in the domain are mapped to prohibited values of the codomain: As above, we have two cases.



      The number $1$ is mapped to $0$ or $1$ and two other numbers are fixed points: We choose the image of $1$ and which two of the other four numbers are fixed points. That leaves three elements in the codomain to which the remaining two elements in the domain can be mapped. We choose how to map those two elements to distinct elements of that subset of the codomain. There are




      $$binom{2}{1}binom{4}{2}3!$$




      such injective functions.



      Three numbers larger than $1$ are fixed points: We choose which three of those four numbers are fixed points. That leaves three elements in the codomain to which the remaining two elements in the domain can be mapped. We choose how to map those two elements to distinct elements of that subset of the codomain. There are




      $$binom{4}{3}3!$$




      such injective functions.



      Hence, there are




      $$binom{2}{1}binom{4}{2}3! + binom{4}{3}3!$$




      injective functions in which three numbers in the domain are mapped to prohibited elements in the codomain.



      Four elements in the domain are mapped to prohibited values in the codomain: Again, there are two cases.



      The number $1$ is mapped to $0$ or $1$ and three of the other four numbers are fixed points: Choose the image of $1$ and which three of the other four numbers are fixed points. Assign the remaining number in the domain to one of the two remaining numbers in the codomain. There are




      $$binom{2}{1}binom{4}{3}2!$$




      such injective functions.



      All four numbers larger than $1$ are fixed points: That leaves two ways to assign $1$ to one of the remaining elements in the codomain (yes, we have already counted this case, but the Inclusion-Exclusion Principle compensates for that). There are




      $$binom{4}{4}2!$$




      such injective functions.



      Hence, there are




      $$binom{2}{1}binom{4}{3}2! + binom{4}{4}2!$$




      injective functions in which four elements of the domain are mapped to probibited elements of the codomain.



      All five elements of the domain are mapped to prohibited values in the codomain: There are two possibilities. Either $1$ is mapped to $0$ and the other four numbers are fixed points or all five numbers are fixed points. There are




      $$binom{2}{1}binom{4}{4}$$




      such functions.



      By the Inclusion-Exclusion Principle, the number of injective functions $f: A to B$ such that $f(1) neq 0$ and $f(i) neq i, 1 leq i leq 5$, is




      $$6! - binom{2}{1}5! - binom{4}{1}5! + binom{2}{1}binom{4}{1}4! + binom{4}{2}4! - binom{2}{1}binom{4}{2}3! - binom{4}{3}3! + binom{2}{1}binom{4}{3}2! + binom{4}{4}2! - binom{2}{1}binom{4}{4}$$







      share|cite|improve this answer









      $endgroup$
















        1












        1








        1





        $begingroup$

        Definition. A number $c$ is said to be a fixed point of a function if $f(c) = c$.



        Let $A = {1, 2, 3, 4, 5}$; let $B = {0, 1, 2, 3, 4, 5}$.



        If there were no restrictions, we would have $6 cdot 5 cdot 4 cdot 3 cdot 2 = 6!$ ways to map the elements in the domain to distinct elements in the codomain. Hence, there are $6!$ injective functions $f: A to B$. From these, we must exclude those that violate the restrictions that $f(0) neq 1$ and that $f(i) neq i, 1 leq i leq 5$.



        We will use the Inclusion-Exclusion Principle.



        A number in the domain is mapped to a prohibited value of the codomain: We consider two cases, depending on whether or not that number is $1$.



        The number $1$ is mapped to $0$ or $1$: There are two ways to choose the image of $1$. That leaves five elements in the codomain to which the remaining four numbers in the domain can be mapped. The remaining numbers in the domain can be mapped to distinct elements of that subset of the codomain in $5 cdot 4 cdot 3 cdot 2 = 5!$ ways. Hence, there are
        $$binom{2}{1}5!$$
        such injective functions.



        A number other than $1$ is a fixed point: There are four ways to choose which of the four numbers larger than $1$ is a fixed point. That leaves five numbers in the codomain to which the remaining four elements in the domain can be mapped. The remaining numbers in the domain can be mapped to distinct elements of that subset of the codomain in $5!$ ways. Hence, there are
        $$binom{4}{1}5!$$
        such injective functions.



        Hence, there are
        $$binom{2}{1}5! + binom{4}{1}5!$$
        injective functions in which a number in the codomain is mapped to a prohibited element of the codomain.



        Two numbers in the domain are mapped to probibited values of the codomain: We again have to consider two cases, depending on whether or not $1$ is one of the numbers that is mapped to a prohibited value.



        The number $1$ is mapped to $0$ or $1$ and another number is a fixed point: There are $2$ ways to choose the image of $1$ and four ways to pick which of the other four numbers in the codomain is a fixed point. That leaves four numbers in the codomain to which the remaining three elements in the codomain can be mapped. The remaining numbers in the domain can be mapped to distinct elements of that subset of the codomain in $4 cdot 3 cdot 2 = 4!$ ways. Hence, there are
        $$binom{2}{1}binom{4}{1}4!$$
        such injective functions.



        Two numbers larger than $1$ are fixed points: There are $binom{4}{2}$ ways to choose the two fixed points. That leaves four numbers in the codomain to which the remaining three elements in the domain can be mapped. The remaining numbers in the domain can be mapped to distinct elements that subset of the codomain in $4!$ ways. Hence, there are
        $$binom{4}{2}4!$$
        such injective functions.



        Three numbers in the domain are mapped to prohibited values of the codomain: As above, we have two cases.



        The number $1$ is mapped to $0$ or $1$ and two other numbers are fixed points: We choose the image of $1$ and which two of the other four numbers are fixed points. That leaves three elements in the codomain to which the remaining two elements in the domain can be mapped. We choose how to map those two elements to distinct elements of that subset of the codomain. There are




        $$binom{2}{1}binom{4}{2}3!$$




        such injective functions.



        Three numbers larger than $1$ are fixed points: We choose which three of those four numbers are fixed points. That leaves three elements in the codomain to which the remaining two elements in the domain can be mapped. We choose how to map those two elements to distinct elements of that subset of the codomain. There are




        $$binom{4}{3}3!$$




        such injective functions.



        Hence, there are




        $$binom{2}{1}binom{4}{2}3! + binom{4}{3}3!$$




        injective functions in which three numbers in the domain are mapped to prohibited elements in the codomain.



        Four elements in the domain are mapped to prohibited values in the codomain: Again, there are two cases.



        The number $1$ is mapped to $0$ or $1$ and three of the other four numbers are fixed points: Choose the image of $1$ and which three of the other four numbers are fixed points. Assign the remaining number in the domain to one of the two remaining numbers in the codomain. There are




        $$binom{2}{1}binom{4}{3}2!$$




        such injective functions.



        All four numbers larger than $1$ are fixed points: That leaves two ways to assign $1$ to one of the remaining elements in the codomain (yes, we have already counted this case, but the Inclusion-Exclusion Principle compensates for that). There are




        $$binom{4}{4}2!$$




        such injective functions.



        Hence, there are




        $$binom{2}{1}binom{4}{3}2! + binom{4}{4}2!$$




        injective functions in which four elements of the domain are mapped to probibited elements of the codomain.



        All five elements of the domain are mapped to prohibited values in the codomain: There are two possibilities. Either $1$ is mapped to $0$ and the other four numbers are fixed points or all five numbers are fixed points. There are




        $$binom{2}{1}binom{4}{4}$$




        such functions.



        By the Inclusion-Exclusion Principle, the number of injective functions $f: A to B$ such that $f(1) neq 0$ and $f(i) neq i, 1 leq i leq 5$, is




        $$6! - binom{2}{1}5! - binom{4}{1}5! + binom{2}{1}binom{4}{1}4! + binom{4}{2}4! - binom{2}{1}binom{4}{2}3! - binom{4}{3}3! + binom{2}{1}binom{4}{3}2! + binom{4}{4}2! - binom{2}{1}binom{4}{4}$$







        share|cite|improve this answer









        $endgroup$



        Definition. A number $c$ is said to be a fixed point of a function if $f(c) = c$.



        Let $A = {1, 2, 3, 4, 5}$; let $B = {0, 1, 2, 3, 4, 5}$.



        If there were no restrictions, we would have $6 cdot 5 cdot 4 cdot 3 cdot 2 = 6!$ ways to map the elements in the domain to distinct elements in the codomain. Hence, there are $6!$ injective functions $f: A to B$. From these, we must exclude those that violate the restrictions that $f(0) neq 1$ and that $f(i) neq i, 1 leq i leq 5$.



        We will use the Inclusion-Exclusion Principle.



        A number in the domain is mapped to a prohibited value of the codomain: We consider two cases, depending on whether or not that number is $1$.



        The number $1$ is mapped to $0$ or $1$: There are two ways to choose the image of $1$. That leaves five elements in the codomain to which the remaining four numbers in the domain can be mapped. The remaining numbers in the domain can be mapped to distinct elements of that subset of the codomain in $5 cdot 4 cdot 3 cdot 2 = 5!$ ways. Hence, there are
        $$binom{2}{1}5!$$
        such injective functions.



        A number other than $1$ is a fixed point: There are four ways to choose which of the four numbers larger than $1$ is a fixed point. That leaves five numbers in the codomain to which the remaining four elements in the domain can be mapped. The remaining numbers in the domain can be mapped to distinct elements of that subset of the codomain in $5!$ ways. Hence, there are
        $$binom{4}{1}5!$$
        such injective functions.



        Hence, there are
        $$binom{2}{1}5! + binom{4}{1}5!$$
        injective functions in which a number in the codomain is mapped to a prohibited element of the codomain.



        Two numbers in the domain are mapped to probibited values of the codomain: We again have to consider two cases, depending on whether or not $1$ is one of the numbers that is mapped to a prohibited value.



        The number $1$ is mapped to $0$ or $1$ and another number is a fixed point: There are $2$ ways to choose the image of $1$ and four ways to pick which of the other four numbers in the codomain is a fixed point. That leaves four numbers in the codomain to which the remaining three elements in the codomain can be mapped. The remaining numbers in the domain can be mapped to distinct elements of that subset of the codomain in $4 cdot 3 cdot 2 = 4!$ ways. Hence, there are
        $$binom{2}{1}binom{4}{1}4!$$
        such injective functions.



        Two numbers larger than $1$ are fixed points: There are $binom{4}{2}$ ways to choose the two fixed points. That leaves four numbers in the codomain to which the remaining three elements in the domain can be mapped. The remaining numbers in the domain can be mapped to distinct elements that subset of the codomain in $4!$ ways. Hence, there are
        $$binom{4}{2}4!$$
        such injective functions.



        Three numbers in the domain are mapped to prohibited values of the codomain: As above, we have two cases.



        The number $1$ is mapped to $0$ or $1$ and two other numbers are fixed points: We choose the image of $1$ and which two of the other four numbers are fixed points. That leaves three elements in the codomain to which the remaining two elements in the domain can be mapped. We choose how to map those two elements to distinct elements of that subset of the codomain. There are




        $$binom{2}{1}binom{4}{2}3!$$




        such injective functions.



        Three numbers larger than $1$ are fixed points: We choose which three of those four numbers are fixed points. That leaves three elements in the codomain to which the remaining two elements in the domain can be mapped. We choose how to map those two elements to distinct elements of that subset of the codomain. There are




        $$binom{4}{3}3!$$




        such injective functions.



        Hence, there are




        $$binom{2}{1}binom{4}{2}3! + binom{4}{3}3!$$




        injective functions in which three numbers in the domain are mapped to prohibited elements in the codomain.



        Four elements in the domain are mapped to prohibited values in the codomain: Again, there are two cases.



        The number $1$ is mapped to $0$ or $1$ and three of the other four numbers are fixed points: Choose the image of $1$ and which three of the other four numbers are fixed points. Assign the remaining number in the domain to one of the two remaining numbers in the codomain. There are




        $$binom{2}{1}binom{4}{3}2!$$




        such injective functions.



        All four numbers larger than $1$ are fixed points: That leaves two ways to assign $1$ to one of the remaining elements in the codomain (yes, we have already counted this case, but the Inclusion-Exclusion Principle compensates for that). There are




        $$binom{4}{4}2!$$




        such injective functions.



        Hence, there are




        $$binom{2}{1}binom{4}{3}2! + binom{4}{4}2!$$




        injective functions in which four elements of the domain are mapped to probibited elements of the codomain.



        All five elements of the domain are mapped to prohibited values in the codomain: There are two possibilities. Either $1$ is mapped to $0$ and the other four numbers are fixed points or all five numbers are fixed points. There are




        $$binom{2}{1}binom{4}{4}$$




        such functions.



        By the Inclusion-Exclusion Principle, the number of injective functions $f: A to B$ such that $f(1) neq 0$ and $f(i) neq i, 1 leq i leq 5$, is




        $$6! - binom{2}{1}5! - binom{4}{1}5! + binom{2}{1}binom{4}{1}4! + binom{4}{2}4! - binom{2}{1}binom{4}{2}3! - binom{4}{3}3! + binom{2}{1}binom{4}{3}2! + binom{4}{4}2! - binom{2}{1}binom{4}{4}$$








        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Dec 7 '18 at 12:07









        N. F. TaussigN. F. Taussig

        44k93356




        44k93356























            0












            $begingroup$

            I have a suitable result for your problem. Don't take it as an answer:



            Let, $A, B$ be two nonempty sets with $|A|=m<|B|=n$ and $f: Ato B$ is a function, then the total number of onto function is zero and the total number of one-one function is: $^nC_mm!$ for all $n,minmathbb{N}$






            share|cite|improve this answer









            $endgroup$













            • $begingroup$
              For proof: math.stackexchange.com/questions/243500/…
              $endgroup$
              – Sujit Bhattacharyya
              Dec 7 '18 at 10:38
















            0












            $begingroup$

            I have a suitable result for your problem. Don't take it as an answer:



            Let, $A, B$ be two nonempty sets with $|A|=m<|B|=n$ and $f: Ato B$ is a function, then the total number of onto function is zero and the total number of one-one function is: $^nC_mm!$ for all $n,minmathbb{N}$






            share|cite|improve this answer









            $endgroup$













            • $begingroup$
              For proof: math.stackexchange.com/questions/243500/…
              $endgroup$
              – Sujit Bhattacharyya
              Dec 7 '18 at 10:38














            0












            0








            0





            $begingroup$

            I have a suitable result for your problem. Don't take it as an answer:



            Let, $A, B$ be two nonempty sets with $|A|=m<|B|=n$ and $f: Ato B$ is a function, then the total number of onto function is zero and the total number of one-one function is: $^nC_mm!$ for all $n,minmathbb{N}$






            share|cite|improve this answer









            $endgroup$



            I have a suitable result for your problem. Don't take it as an answer:



            Let, $A, B$ be two nonempty sets with $|A|=m<|B|=n$ and $f: Ato B$ is a function, then the total number of onto function is zero and the total number of one-one function is: $^nC_mm!$ for all $n,minmathbb{N}$







            share|cite|improve this answer












            share|cite|improve this answer



            share|cite|improve this answer










            answered Dec 7 '18 at 10:37









            Sujit BhattacharyyaSujit Bhattacharyya

            1,022418




            1,022418












            • $begingroup$
              For proof: math.stackexchange.com/questions/243500/…
              $endgroup$
              – Sujit Bhattacharyya
              Dec 7 '18 at 10:38


















            • $begingroup$
              For proof: math.stackexchange.com/questions/243500/…
              $endgroup$
              – Sujit Bhattacharyya
              Dec 7 '18 at 10:38
















            $begingroup$
            For proof: math.stackexchange.com/questions/243500/…
            $endgroup$
            – Sujit Bhattacharyya
            Dec 7 '18 at 10:38




            $begingroup$
            For proof: math.stackexchange.com/questions/243500/…
            $endgroup$
            – Sujit Bhattacharyya
            Dec 7 '18 at 10:38


















            draft saved

            draft discarded




















































            Thanks for contributing an answer to Mathematics Stack Exchange!


            • Please be sure to answer the question. Provide details and share your research!

            But avoid …



            • Asking for help, clarification, or responding to other answers.

            • Making statements based on opinion; back them up with references or personal experience.


            Use MathJax to format equations. MathJax reference.


            To learn more, see our tips on writing great answers.




            draft saved


            draft discarded














            StackExchange.ready(
            function () {
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3028709%2fnumber-of-one-one-function-from-sets-a-to-b%23new-answer', 'question_page');
            }
            );

            Post as a guest















            Required, but never shown





















































            Required, but never shown














            Required, but never shown












            Required, but never shown







            Required, but never shown

































            Required, but never shown














            Required, but never shown












            Required, but never shown







            Required, but never shown







            -

            Popular posts from this blog

            Quarter-circle Tiles

            Image
            up vote 0 down vote favorite I have $99$ identical square tiles, each with a quarter-circle drawn on it like this: [asy] size(1.5cm); draw(Arc((2,0),1,90,180),red+1); draw((0,0)--(2,0)--(2,2)--(0,2)--(0,0)); [/asy] When I arrange the tiles in a $9times 11$ rectangular grid, each with a random orientation, what is the expected value of the number of full circles I form? I think this problem has to do with finding the chance any given 2x2 square has a circle, but I can't find it. expected-value share | cite | improve this question asked Nov 20 at 15:03 6minecraftninja 1 2
            Read more

            build a pushdown automaton that recognizes the reverse language of a given pushdown automaton?

            Image
            0 I think it's similiar to NFAs. I replace the finite states of the given automaton for start-states for my new automaton. I do it with $epsilon$ -transition from the start state to the actual finite states of the given automaton. The start state of the given automaton will be my accepting(finite) state of my new one. All transitions will be reversed of course to recognize the reversed word. But how do I have to change the stack of the pushdown automaton? That's tricky. formal-languages automata context-free-grammar share | cite | improve this question edited Nov 29 '18 at 14:20 joee
            Read more

            Mont Emei

            Image
            Mont Emei.mw-parser-output .entete.map{background-image:url("//upload.wikimedia.org/wikipedia/commons/7/7a/Picto_infobox_map.png")} Vue du sommet Wanfo du mont Emei Géographie Altitude 3 099  m , Wanfo Coordonnées 29° 31′ 11″ nord, 103° 19′ 57″ est Administration Pays   Chine Province Sichuan Ville-préfecture Leshan Géolocalisation sur la carte : Sichuan Mont Emei Géolocalisation sur la carte : Chine Mont Emei modifier   Paysage panoramique du mont Emei, incluant le paysage panoramique du grand Bouddha de Leshan *   Patrimoine mondial de l'UNESCO Passerelle en bois sur le versant ouest Pays   Chine Subdivision Sichuan Type Mixte Critères (iv) (vi) (x) Superficie 15 400 ha Numéro d’identification 779 Zone géographique Asie et Pacifique  ** Année d’inscription 1996 (20 e session) * Descriptif officiel UNESCO ** Classification géog
            Read more