$Q(n)$: “$P(k)$ holds for all $k<n$”. Then why is $Q(0)$ clearly true? [duplicate]












0















This question already has an answer here:




  • Strong induction and vacuous truth

    2 answers



  • Strong Induction Requires No Base Case?

    2 answers



  • Why is complete strong induction a valid proof method and not need to explicitly proof the base cases?

    6 answers




It is a principle and proof from Introduction to Set Theory, Hrbacek and Jech.



In the proof, line 1 and 2, I couldn't understand why $Q(0)$ is true.



$Q(0)$ means that "$P(k)$ holds for all $k<0$".



I understood there are no $k<0$.



And then I couldn't proceed.



figure for question










share|cite|improve this question















marked as duplicate by Asaf Karagila set-theory
Users with the  set-theory badge can single-handedly close set-theory 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();
}
);
});
});
Jan 4 at 12:38


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.















  • Vacuous truth
    – Wojowu
    Jan 4 at 12:05
















0















This question already has an answer here:




  • Strong induction and vacuous truth

    2 answers



  • Strong Induction Requires No Base Case?

    2 answers



  • Why is complete strong induction a valid proof method and not need to explicitly proof the base cases?

    6 answers




It is a principle and proof from Introduction to Set Theory, Hrbacek and Jech.



In the proof, line 1 and 2, I couldn't understand why $Q(0)$ is true.



$Q(0)$ means that "$P(k)$ holds for all $k<0$".



I understood there are no $k<0$.



And then I couldn't proceed.



figure for question










share|cite|improve this question















marked as duplicate by Asaf Karagila set-theory
Users with the  set-theory badge can single-handedly close set-theory 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();
}
);
});
});
Jan 4 at 12:38


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.















  • Vacuous truth
    – Wojowu
    Jan 4 at 12:05














0












0








0








This question already has an answer here:




  • Strong induction and vacuous truth

    2 answers



  • Strong Induction Requires No Base Case?

    2 answers



  • Why is complete strong induction a valid proof method and not need to explicitly proof the base cases?

    6 answers




It is a principle and proof from Introduction to Set Theory, Hrbacek and Jech.



In the proof, line 1 and 2, I couldn't understand why $Q(0)$ is true.



$Q(0)$ means that "$P(k)$ holds for all $k<0$".



I understood there are no $k<0$.



And then I couldn't proceed.



figure for question










share|cite|improve this question
















This question already has an answer here:




  • Strong induction and vacuous truth

    2 answers



  • Strong Induction Requires No Base Case?

    2 answers



  • Why is complete strong induction a valid proof method and not need to explicitly proof the base cases?

    6 answers




It is a principle and proof from Introduction to Set Theory, Hrbacek and Jech.



In the proof, line 1 and 2, I couldn't understand why $Q(0)$ is true.



$Q(0)$ means that "$P(k)$ holds for all $k<0$".



I understood there are no $k<0$.



And then I couldn't proceed.



figure for question





This question already has an answer here:




  • Strong induction and vacuous truth

    2 answers



  • Strong Induction Requires No Base Case?

    2 answers



  • Why is complete strong induction a valid proof method and not need to explicitly proof the base cases?

    6 answers








induction proof-explanation






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Jan 4 at 17:54









Andrés E. Caicedo

64.9k8158246




64.9k8158246










asked Jan 4 at 12:02









Doyun NamDoyun Nam

41619




41619




marked as duplicate by Asaf Karagila set-theory
Users with the  set-theory badge can single-handedly close set-theory 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();
}
);
});
});
Jan 4 at 12:38


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 set-theory
Users with the  set-theory badge can single-handedly close set-theory 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();
}
);
});
});
Jan 4 at 12:38


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.














  • Vacuous truth
    – Wojowu
    Jan 4 at 12:05


















  • Vacuous truth
    – Wojowu
    Jan 4 at 12:05
















Vacuous truth
– Wojowu
Jan 4 at 12:05




Vacuous truth
– Wojowu
Jan 4 at 12:05










2 Answers
2






active

oldest

votes


















1














$Q(n)$ is the predicate "$forall kin{Bbb N}_0 (k<nRightarrow P(k))$." Then $Q(0)$ is vacuously true, since the premise is false and so the implication is true.






share|cite|improve this answer





























    1














    A sentence like "for all $x$, if $x$ has the property $A$, then $x$ has the property $B$" is false if (and only if) there exists a counterexample, that is, if there exists some $x$ with the property $A$ but without the property $B$.



    If there is no $x$ that has the property $A$, then there is no counterexample, so the sentence is true.






    share|cite|improve this answer




























      2 Answers
      2






      active

      oldest

      votes








      2 Answers
      2






      active

      oldest

      votes









      active

      oldest

      votes






      active

      oldest

      votes









      1














      $Q(n)$ is the predicate "$forall kin{Bbb N}_0 (k<nRightarrow P(k))$." Then $Q(0)$ is vacuously true, since the premise is false and so the implication is true.






      share|cite|improve this answer


























        1














        $Q(n)$ is the predicate "$forall kin{Bbb N}_0 (k<nRightarrow P(k))$." Then $Q(0)$ is vacuously true, since the premise is false and so the implication is true.






        share|cite|improve this answer
























          1












          1








          1






          $Q(n)$ is the predicate "$forall kin{Bbb N}_0 (k<nRightarrow P(k))$." Then $Q(0)$ is vacuously true, since the premise is false and so the implication is true.






          share|cite|improve this answer












          $Q(n)$ is the predicate "$forall kin{Bbb N}_0 (k<nRightarrow P(k))$." Then $Q(0)$ is vacuously true, since the premise is false and so the implication is true.







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered Jan 4 at 12:23









          WuestenfuxWuestenfux

          3,7361411




          3,7361411























              1














              A sentence like "for all $x$, if $x$ has the property $A$, then $x$ has the property $B$" is false if (and only if) there exists a counterexample, that is, if there exists some $x$ with the property $A$ but without the property $B$.



              If there is no $x$ that has the property $A$, then there is no counterexample, so the sentence is true.






              share|cite|improve this answer


























                1














                A sentence like "for all $x$, if $x$ has the property $A$, then $x$ has the property $B$" is false if (and only if) there exists a counterexample, that is, if there exists some $x$ with the property $A$ but without the property $B$.



                If there is no $x$ that has the property $A$, then there is no counterexample, so the sentence is true.






                share|cite|improve this answer
























                  1












                  1








                  1






                  A sentence like "for all $x$, if $x$ has the property $A$, then $x$ has the property $B$" is false if (and only if) there exists a counterexample, that is, if there exists some $x$ with the property $A$ but without the property $B$.



                  If there is no $x$ that has the property $A$, then there is no counterexample, so the sentence is true.






                  share|cite|improve this answer












                  A sentence like "for all $x$, if $x$ has the property $A$, then $x$ has the property $B$" is false if (and only if) there exists a counterexample, that is, if there exists some $x$ with the property $A$ but without the property $B$.



                  If there is no $x$ that has the property $A$, then there is no counterexample, so the sentence is true.







                  share|cite|improve this answer












                  share|cite|improve this answer



                  share|cite|improve this answer










                  answered Jan 4 at 12:09









                  ajotatxeajotatxe

                  53.5k23890




                  53.5k23890















                      Popular posts from this blog

                      1300-talet

                      1300-talet

                      Display a custom attribute below product name in the front-end Magento 1.9.3.8