Can I say “let $f : mathbbR mapsto mathbbR$” without the axiom of choice? [duplicate]

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
2
down vote

favorite













This question already has an answer here:



  • Do we need Axiom of Choice to make infinite choices from a set?

    5 answers



Indeed letting $ f$ be in $mathbbR^mathbbR$ seems like it requires making $2^aleph_0$ choices.







share|cite|improve this question











marked as duplicate by Asaf Karagila♦ axiom-of-choice
Users with the  axiom-of-choice badge can single-handedly close axiom-of-choice questions as duplicates and reopen them as needed.

StackExchange.ready(function()
if (StackExchange.options.isMobile) return;

$('.dupe-hammer-message-hover:not(.hover-bound)').each(function()
var $hover = $(this).addClass('hover-bound'),
$msg = $hover.siblings('.dupe-hammer-message');

$hover.hover(
function()
$hover.showInfoMessage('',
messageElement: $msg.clone().show(),
transient: false,
position: my: 'bottom left', at: 'top center', offsetTop: -7 ,
dismissable: false,
relativeToBody: true
);
,
function()
StackExchange.helpers.removeMessages();

);
);
);
Jul 20 at 0:11


This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.










  • 1




    Your "let ..." is not mathematical proposition, it is just preparing for some proposition of form e.g. "every function $f : mathbbR to mathbbR$ has property P", you can do such propositions without AC
    – kp9r4d
    Jul 19 at 23:06














up vote
2
down vote

favorite













This question already has an answer here:



  • Do we need Axiom of Choice to make infinite choices from a set?

    5 answers



Indeed letting $ f$ be in $mathbbR^mathbbR$ seems like it requires making $2^aleph_0$ choices.







share|cite|improve this question











marked as duplicate by Asaf Karagila♦ axiom-of-choice
Users with the  axiom-of-choice badge can single-handedly close axiom-of-choice questions as duplicates and reopen them as needed.

StackExchange.ready(function()
if (StackExchange.options.isMobile) return;

$('.dupe-hammer-message-hover:not(.hover-bound)').each(function()
var $hover = $(this).addClass('hover-bound'),
$msg = $hover.siblings('.dupe-hammer-message');

$hover.hover(
function()
$hover.showInfoMessage('',
messageElement: $msg.clone().show(),
transient: false,
position: my: 'bottom left', at: 'top center', offsetTop: -7 ,
dismissable: false,
relativeToBody: true
);
,
function()
StackExchange.helpers.removeMessages();

);
);
);
Jul 20 at 0:11


This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.










  • 1




    Your "let ..." is not mathematical proposition, it is just preparing for some proposition of form e.g. "every function $f : mathbbR to mathbbR$ has property P", you can do such propositions without AC
    – kp9r4d
    Jul 19 at 23:06












up vote
2
down vote

favorite









up vote
2
down vote

favorite












This question already has an answer here:



  • Do we need Axiom of Choice to make infinite choices from a set?

    5 answers



Indeed letting $ f$ be in $mathbbR^mathbbR$ seems like it requires making $2^aleph_0$ choices.







share|cite|improve this question












This question already has an answer here:



  • Do we need Axiom of Choice to make infinite choices from a set?

    5 answers



Indeed letting $ f$ be in $mathbbR^mathbbR$ seems like it requires making $2^aleph_0$ choices.





This question already has an answer here:



  • Do we need Axiom of Choice to make infinite choices from a set?

    5 answers









share|cite|improve this question










share|cite|improve this question




share|cite|improve this question









asked Jul 19 at 22:55









Raphael Picovschi

235




235




marked as duplicate by Asaf Karagila♦ axiom-of-choice
Users with the  axiom-of-choice badge can single-handedly close axiom-of-choice questions as duplicates and reopen them as needed.

StackExchange.ready(function()
if (StackExchange.options.isMobile) return;

$('.dupe-hammer-message-hover:not(.hover-bound)').each(function()
var $hover = $(this).addClass('hover-bound'),
$msg = $hover.siblings('.dupe-hammer-message');

$hover.hover(
function()
$hover.showInfoMessage('',
messageElement: $msg.clone().show(),
transient: false,
position: my: 'bottom left', at: 'top center', offsetTop: -7 ,
dismissable: false,
relativeToBody: true
);
,
function()
StackExchange.helpers.removeMessages();

);
);
);
Jul 20 at 0:11


This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.






marked as duplicate by Asaf Karagila♦ axiom-of-choice
Users with the  axiom-of-choice badge can single-handedly close axiom-of-choice questions as duplicates and reopen them as needed.

StackExchange.ready(function()
if (StackExchange.options.isMobile) return;

$('.dupe-hammer-message-hover:not(.hover-bound)').each(function()
var $hover = $(this).addClass('hover-bound'),
$msg = $hover.siblings('.dupe-hammer-message');

$hover.hover(
function()
$hover.showInfoMessage('',
messageElement: $msg.clone().show(),
transient: false,
position: my: 'bottom left', at: 'top center', offsetTop: -7 ,
dismissable: false,
relativeToBody: true
);
,
function()
StackExchange.helpers.removeMessages();

);
);
);
Jul 20 at 0:11


This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.









  • 1




    Your "let ..." is not mathematical proposition, it is just preparing for some proposition of form e.g. "every function $f : mathbbR to mathbbR$ has property P", you can do such propositions without AC
    – kp9r4d
    Jul 19 at 23:06












  • 1




    Your "let ..." is not mathematical proposition, it is just preparing for some proposition of form e.g. "every function $f : mathbbR to mathbbR$ has property P", you can do such propositions without AC
    – kp9r4d
    Jul 19 at 23:06







1




1




Your "let ..." is not mathematical proposition, it is just preparing for some proposition of form e.g. "every function $f : mathbbR to mathbbR$ has property P", you can do such propositions without AC
– kp9r4d
Jul 19 at 23:06




Your "let ..." is not mathematical proposition, it is just preparing for some proposition of form e.g. "every function $f : mathbbR to mathbbR$ has property P", you can do such propositions without AC
– kp9r4d
Jul 19 at 23:06










1 Answer
1






active

oldest

votes

















up vote
5
down vote













The set of functions with domain $mathbb R$ and range $mathbb R$ is a set. That set is nonempty. So, like any other set, you are allowed to pick one element out of that set, and to do it with a phrase like "Let $f$ be an element of that set".



What the axiom of choice asserts is the nonemptiness of certain function sets, under certain constraints. For example, suppose you already had a function $A : mathbb R to P(mathbb R)$, and so for each $r in mathbb R$ you have a nomempty subset $A(r) subset mathbb R$. Consider the set of all functions $f : mathbb R to mathbb R$ such that $f(r) in A(r)$ for every $r in mathbb R$. The axiom of choice, as applied to this situation, asserts that this set of functions is not empty, i.e. that there exists a function $f$ satisfying those conditions.






share|cite|improve this answer






























    1 Answer
    1






    active

    oldest

    votes








    1 Answer
    1






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes








    up vote
    5
    down vote













    The set of functions with domain $mathbb R$ and range $mathbb R$ is a set. That set is nonempty. So, like any other set, you are allowed to pick one element out of that set, and to do it with a phrase like "Let $f$ be an element of that set".



    What the axiom of choice asserts is the nonemptiness of certain function sets, under certain constraints. For example, suppose you already had a function $A : mathbb R to P(mathbb R)$, and so for each $r in mathbb R$ you have a nomempty subset $A(r) subset mathbb R$. Consider the set of all functions $f : mathbb R to mathbb R$ such that $f(r) in A(r)$ for every $r in mathbb R$. The axiom of choice, as applied to this situation, asserts that this set of functions is not empty, i.e. that there exists a function $f$ satisfying those conditions.






    share|cite|improve this answer



























      up vote
      5
      down vote













      The set of functions with domain $mathbb R$ and range $mathbb R$ is a set. That set is nonempty. So, like any other set, you are allowed to pick one element out of that set, and to do it with a phrase like "Let $f$ be an element of that set".



      What the axiom of choice asserts is the nonemptiness of certain function sets, under certain constraints. For example, suppose you already had a function $A : mathbb R to P(mathbb R)$, and so for each $r in mathbb R$ you have a nomempty subset $A(r) subset mathbb R$. Consider the set of all functions $f : mathbb R to mathbb R$ such that $f(r) in A(r)$ for every $r in mathbb R$. The axiom of choice, as applied to this situation, asserts that this set of functions is not empty, i.e. that there exists a function $f$ satisfying those conditions.






      share|cite|improve this answer

























        up vote
        5
        down vote










        up vote
        5
        down vote









        The set of functions with domain $mathbb R$ and range $mathbb R$ is a set. That set is nonempty. So, like any other set, you are allowed to pick one element out of that set, and to do it with a phrase like "Let $f$ be an element of that set".



        What the axiom of choice asserts is the nonemptiness of certain function sets, under certain constraints. For example, suppose you already had a function $A : mathbb R to P(mathbb R)$, and so for each $r in mathbb R$ you have a nomempty subset $A(r) subset mathbb R$. Consider the set of all functions $f : mathbb R to mathbb R$ such that $f(r) in A(r)$ for every $r in mathbb R$. The axiom of choice, as applied to this situation, asserts that this set of functions is not empty, i.e. that there exists a function $f$ satisfying those conditions.






        share|cite|improve this answer















        The set of functions with domain $mathbb R$ and range $mathbb R$ is a set. That set is nonempty. So, like any other set, you are allowed to pick one element out of that set, and to do it with a phrase like "Let $f$ be an element of that set".



        What the axiom of choice asserts is the nonemptiness of certain function sets, under certain constraints. For example, suppose you already had a function $A : mathbb R to P(mathbb R)$, and so for each $r in mathbb R$ you have a nomempty subset $A(r) subset mathbb R$. Consider the set of all functions $f : mathbb R to mathbb R$ such that $f(r) in A(r)$ for every $r in mathbb R$. The axiom of choice, as applied to this situation, asserts that this set of functions is not empty, i.e. that there exists a function $f$ satisfying those conditions.







        share|cite|improve this answer















        share|cite|improve this answer



        share|cite|improve this answer








        edited Jul 19 at 23:13


























        answered Jul 19 at 23:08









        Lee Mosher

        45.6k33478




        45.6k33478












            Comments

            Popular posts from this blog

            What is the equation of a 3D cone with generalised tilt?

            Color the edges and diagonals of a regular polygon

            Relationship between determinant of matrix and determinant of adjoint?