Jason (jcreed) wrote,


Aha! I realized in the shower that I can relax the
no-infinite-predecessor-chain condition to finitely
many infinite predecessor chains,
and the injectivity condition -is- required.

* * * * *.. * * * *..
| | | | |.. vs. | | | |..
v v v v v.. v v v v..
*->*->*->*->*.. *->*->*->*->*..

I wonder if finite-component u-structures are
Cantor-Bernstein? I'd tend to think maybe so.

Oh, no, of course not. I'm on crack.
* * *->*

-> ->
* * vs. * *
<- <-

-> ->
* * * *
<- <-
.... ....

Okay, so also: suppose f is a u-homom from U to V.
if f isn't mono, then obviously
it isn't injective. If it isn't injective, say
f maps a and b to the same thing, then we can use
a copy of *N and map 0 by x to a and by x' to b,
and the mappings' behavior on the rest of *N is forced.
Moreover, f o x = f o x' by induction. So in any
full subcategory of uStruct that contains *N, the monos
are exactly the injective homomorphisms.

  • (no subject)

    Some further progress cleaning up the https://xkcd.com/1360/ -esque augean stables that is my hard drive. Tomato chicken I made a couple days ago…

  • (no subject)

    Did some personal archaeology. Helped a little with laundry. Threw some chicken, onions, tomato, stock, peppers in the slow cooker and hopefully…

  • (no subject)

    Dinner with akiva and dannel at nuevo portal in carroll gardens. Ate a pile of chicken stew and rice and beans and maduros, good times. I do miss…

  • Post a new comment


    Anonymous comments are disabled in this journal

    default userpic

    Your reply will be screened

    Your IP address will be recorded