Not signed in (Sign In)

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

Site Tag Cloud

2-category 2-category-theory abelian-categories adjoint algebra algebraic algebraic-geometry algebraic-topology analysis analytic-geometry arithmetic arithmetic-geometry book bundles calculus categorical categories category category-theory chern-weil-theory cohesion cohesive-homotopy-type-theory cohomology colimits combinatorics comma complex complex-geometry computable-mathematics computer-science constructive cosmology deformation-theory descent diagrams differential differential-cohomology differential-equations differential-geometry digraphs duality elliptic-cohomology enriched fibration finite foundation foundations functional-analysis functor gauge-theory gebra geometric-quantization geometry graph graphs gravity grothendieck group group-theory harmonic-analysis higher higher-algebra higher-category-theory higher-differential-geometry higher-geometry higher-lie-theory higher-topos-theory homological homological-algebra homotopy homotopy-theory homotopy-type-theory index-theory integration integration-theory k-theory lie-theory limits linear linear-algebra locale localization logic mathematics measure-theory modal modal-logic model model-category-theory monad monads monoidal monoidal-category-theory morphism motives motivic-cohomology nlab noncommutative noncommutative-geometry number-theory of operads operator operator-algebra order-theory pages pasting philosophy physics pro-object probability probability-theory quantization quantum quantum-field quantum-field-theory quantum-mechanics quantum-physics quantum-theory question representation representation-theory riemannian-geometry scheme schemes set set-theory sheaf simplicial space spin-geometry stable-homotopy-theory stack string string-theory superalgebra supergeometry svg symplectic-geometry synthetic-differential-geometry terminology theory topology topos topos-theory tqft type type-theory universal variational-calculus

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.
    • CommentAuthorMike Shulman
    • CommentTimeApr 22nd 2019

    Cited today’s preprint by Pradic-Brown showing that CSB is equivalent to LEM.

    diff, v30, current

    • CommentRowNumber2.
    • CommentAuthorTodd_Trimble
    • CommentTimeApr 22nd 2019

    I don’t have much time to look into this now, but this equivalence should be reconciled with the statement made just before this section, that LEM isn’t implied by CSB if we consider topos models. Perhaps I was missing some subtlety when I first wrote that (I think it was me).

    • CommentRowNumber3.
    • CommentAuthorMike Shulman
    • CommentTimeApr 22nd 2019

    Interesting, I didn’t see that remark! I think the point is that Pradic-Brown’s proof uses the natural numbers, while FinSet CFinSet^C doesn’t have a NNO. They remark on this very example in their footnote 5. This should be clarified on the page – but I don’t have time to do it right now.

    • CommentRowNumber4.
    • CommentAuthorTodd_Trimble
    • CommentTimeApr 24th 2019

    At the cost of slight redundancy, I fixed the slight inconsistency on the page about whether or not LEM follows from CSB.

    diff, v31, current

    • CommentRowNumber5.
    • CommentAuthorMike Shulman
    • CommentTimeApr 24th 2019

    Thanks! I added some more redundancy by mentioning the need for the axiom of infinity in a couple places.

    diff, v32, current

    • CommentRowNumber6.
    • CommentAuthorDavidRoberts
    • CommentTimeJan 27th 2020

    Added mention of and link to

    • {#Escardo20} Martín Hötzel Escardó, The Cantor-Schröder-Bernstein Theorem for ∞-groupoids, blog post (2020), Agda proof

    diff, v33, current

  1. Added arxiv preprint of Escardó’s contribution.

    diff, v34, current

    • CommentRowNumber8.
    • CommentAuthorGuest
    • CommentTimeFeb 3rd 2021
    hi. i was looking for arie hinkis book about cantor-bernstein, and wikipedia points to this page. your statement that every mono is iso in "nontrivial" powers of FinSet does not seem true - for *any* topos. an exercise-level proof that cantor-bernstein in a topos implies boolean was spelled out on CATEGORIES mailing list a long time ago, in a conversation with peter freyd:
    https://www.mta.ca/~cat-dist/archive/1994/94-2

    :)
    -- dusko
    • CommentRowNumber9.
    • CommentAuthorGuest
    • CommentTimeFeb 3rd 2021
    PS sorry, it is late here. corrections: "for any topos" --> for any nondegenerate topos (different from 0 and 1). the claim is that CB<=>boolean, and the relevant part if boolean => CB. CB => bool is due to dana scott.
    • CommentRowNumber10.
    • CommentAuthorThomas Holder
    • CommentTimeFeb 3rd 2021

    The proof on the mailing list uses a NNO, doesn’t it? Actually Freyd mentions there more or less the same counterexample otherwise. See also remark #3 above.

    Nevertheless, since FinSet GFinSet^G is Boolean for any finite group GG, one should replace ’any” with ’some’ in the nLab entry or use finite monoids that are not groups as counterexample in the footsteps of Freyd instead of mere finite cats.

    • CommentRowNumber11.
    • CommentAuthorTodd_Trimble
    • CommentTimeFeb 17th 2021

    Fixed the mistake “every mono is an iso” to what was obviously the intended statement: every endo-mono is an iso (in FinSet CFinSet^C).

    diff, v36, current

    • CommentRowNumber12.
    • CommentAuthorThomas Holder
    • CommentTimeFeb 17th 2021

    Thanks Todd! I obviously completely misunderstood what Dusko wanted to say here, sorry for that!

    • CommentRowNumber13.
    • CommentAuthorTodd_Trimble
    • CommentTimeFeb 17th 2021

    Actually, I don’t think you did – he was making several points. FWIW, if he’s reading: the “nontriviality” of the power CC refers to the possibility that Fin CFin^C may be be non-Boolean – perhaps it would be better just to cite the specific example C=2C = \mathbf{2}, although I think any finite non-groupoid would do.

    • CommentRowNumber14.
    • CommentAuthorThomas Holder
    • CommentTimeFeb 17th 2021
    • (edited Feb 17th 2021)

    I am still very embarrassed to have fed that semi-silly line to Dusko after his helpful comment. Concerning the second point I think it is ok to have the generality in the counterexample (which might be useful on other occasions) but as formulated it is a bit irritating and relies heavily on the reader’s collaboration (e.g. I was reading the ’nontriviality’ as 𝒞0,1\mathcal{C}\neq 0,1).

    • CommentRowNumber15.
    • CommentAuthorTodd_Trimble
    • CommentTimeFeb 17th 2021

    Huh, I thought I had announced the most recent edit – see if you think it reads better now. (You’re right – “nontrivial” was certainly suboptimal.)

    • CommentRowNumber16.
    • CommentAuthorThomas Holder
    • CommentTimeFeb 18th 2021

    Having posted my comments yesterday after already having called it a day, “as formulated” should be read as “as it was formulated a week ago”, meaning if you had already attended to the point no criticism of the altered version was intended. The current version sure looks ok to me!

    I have also added a reference to Freyd’s proof.

    diff, v39, current