Not signed in (Sign In)

Start a new discussion

Not signed in

Want to take part in these discussions? Sign in if you have an account, or apply for one below

  • Sign in using OpenID

Discussion Tag Cloud

Vanilla 1.1.10 is a product of Lussumo. More Information: Documentation, Community Support.

Welcome to nForum
If you want to take part in these discussions either sign in now (if you have an account), apply for one now (if you don't).
    • CommentRowNumber1.
    • CommentAuthorYimingXu
    • CommentTimeDec 9th 2020
    • (edited Dec 11th 2020)

    It is well-known that we can do proof by induction in a topos using the natural number object, I am interested in proving the strong induction principle, and I am attempting to translate this proof here ( (I) \to (SI) ) into an abstract version, so it works for the natural number object in a category satisfies ETCS (In particular, the topos satisfies well-foundedness, and every subobject has complement, therefore, this is a Boolean topos).

    The \le relation is given as the pullback of o:1No: 1\to N, as the element 00 of natural number, along the map truncated subtraction :N×NN-: N\times N \to N, as in Sketch of an elephant by Johnstone (page 114, A2.5).

    I think the statement of strong induction to prove is as the following.

    For a subobject p:PNp: P \to N, if for an arbitary element n:1Nn: 1 \to N of the NNO, “all member n 0:1Nn_0: 1\to N such that n 0,n=o- \circ \langle n_0, n\rangle = o factorises through PP” implies “sn:1NNs \circ n: 1 \to N \to N factors through P”, then PNP\cong N.

    I am not sure what to do with the QQ though, and I am not sure if constructing such a QQ need the comprehension axiom for ETCS, and hence have trouble translating the proof in the link to also work for NNO. I think if we translate the proof, then we should reduce the task of PNP\cong N into the task of proving QNQ \cong N. I am now asking about how to construct such a QQ, which corresponds to the predicate QQ in the link. Any help, please?

    p.s. The problem that I am actually interested in is proving the well-foundedness of natural number object (explicitly, every non-empty set has a minimal element), but the “material set theoretic proof” using strong induction. Therefore I think I should get strong induction principle for NNO. It will also be great if we can directly prove the well-ordered principle for NNO. (Have searched online for well-orderedness and strong induction for NNO, but nothing helpful is found. Is there any material to read about them?)

    • CommentRowNumber2.
    • CommentAuthormartinescardo
    • CommentTimeDec 10th 2020
    • (edited Dec 10th 2020)

    Strong induction (or course-of-values induction) holds in any elementary topos with NNO. However, the “p.s.” problem doesn’t, because if every non-empty set of natural numbers had a least element, then excluded middle would hold, but excluded middle holds only in boolean toposes. To see this, consider an arbitrary proposition P, and the set consisting of the natural numbers n such that n is 0 and P holds, or n is 1 and P fails. This set is non-empty, because if it were empty then both P and “not P” would fail, which is impossible (from “not P” and “not not P” we get a contradiction). If this set has a least element, then it is either zero or it isn’t, because the natural numbers have decidable equality. If it is zero, then P holds. If it isn’t, then P fails. Hence P is decidable for arbitrary P, which means that excluded middle holds if every non-empty set of natural numbers has a least element.

    • CommentRowNumber3.
    • CommentAuthorYimingXu
    • CommentTimeDec 10th 2020
    • (edited Dec 13th 2020)

    Thanks for replying!

    1.Therefore, does well-foundedness hold if we are working in a boolean topos? There is an ETCS axiom saying that the topos we have is well-pointed, therefore, by sheaves in geometry and logic proposition 7 on chapter 6 (A well-pointed topos E is both two-valued and Boolean), we do have a boolean topos. In particular, any subobject has a complement. The axioms can be viewed in this document .

    1. It is great to hear strong induction holds. May I please ask for a proof of it, or just some hint from the place I am stucked on?
    • CommentRowNumber4.
    • CommentAuthorDavidRoberts
    • CommentTimeDec 11th 2020

    My understanding is that in a constructive setting, one uses axioms that give induction directly, rather than classical well-foundedness then proving induction theorems. Just like the definition of constructive ordinals is not “every nonempty set has a least element” (and, of course, the natural numbers are an ordinal, classically, though I’m not sure about constructively)

    • CommentRowNumber5.
    • CommentAuthorYimingXu
    • CommentTimeDec 11th 2020
    • (edited Dec 11th 2020)

    Thanks for commenting! It is good to know that these things should be axioms if we want to do it constructively. I am not such ambitious that want to prove this principle constructively though :-) . Things are tricker if the topos is not Boolean, but I am now only working within a category satisfies the axioms in Lawvere’s axioms, so our life is easier! We can use excluded middle for the proof, as well as well-pointedness. I will edit the question to make it clearer.

    • CommentRowNumber6.
    • CommentAuthormartinescardo
    • CommentTimeDec 11th 2020
    • (edited Dec 11th 2020)

    This proof of strong induction can be adapted to (the internal language of) any elementary topos.

    • CommentRowNumber7.
    • CommentAuthormartinescardo
    • CommentTimeDec 11th 2020
    • (edited Dec 11th 2020)

    If you want to avoid excluded middle, you can prove in the internal language of any elementary topos with NNO that every decidable, inhabited subset of the natural numbers has a least element. From this constructive result, excluded middle immediately implies the result you want, because (1) by excluded middle, every non-empty subset is inhabited, and (2) by excluded middle, every subset is decidable. The constructive result is easy: we use the assumed inhabitant as a bound for trying each natural number at a time until we reach the bound, answering the first natural number we find in this process. Making this argument formal can give you headaches. I don’t have such a formal argument written down in the internal language of a topos, but I do have it in the closely related language of Martin-Loef type theory, expressed in Agda notation. It is here if you want to see it, where a decidable subset is called detachable. But I don’t expect this to be understandable without training in MLTT and Agda. In any case, the formal argument is straightforward but laborious, and this is what I want to indicate by providing this link, with emphasis on “laborious”.

    • CommentRowNumber8.
    • CommentAuthorYimingXu
    • CommentTimeDec 12th 2020
    • (edited Dec 12th 2020)

    Thank you for outlining this hint! I have received training in HoTT and other theorem provers (HOL4 and Lean), so the code basically makes sense to me. I will try to work out if I can prove the result in the internal lauguage (hopefully this is not too far away from a “translation”), and post here if I can get it.

    • CommentRowNumber9.
    • CommentAuthormartinescardo
    • CommentTimeDec 13th 2020

    In that case, if you are familiar with HoTT, in the same file I linked above there is a constructive proof that the natural numbers are well-founded, as you probably noticed, which amounts to strong induction.

Add your comments
  • Please log in or leave your comment as a "guest post". If commenting as a "guest", please include your name in the message as a courtesy. Note: only certain categories allow guest posts.
  • To produce a hyperlink to an nLab entry, simply put double square brackets around its name, e.g. [[category]]. To use (La)TeX mathematics in your post, make sure Markdown+Itex is selected below and put your mathematics between dollar signs as usual. Only a subset of the usual TeX math commands are accepted: see here for a list.

  • (Help)