# -

Aha! General u-structures don't have a Cantor-Bernstein-like
property. Consider

A B
*->*->*... vs. ...*->*->*...
...*->*->*... ...*->*->*...
...*->*->*... ...*->*->*...
...*->*->*... ...*->*->*...
. .
. .
. .

There's an injective u-homomorphism from A to B
which takes every * across the picture to the one
in B -- it's not a bijection since it misses the
infinite head of the first copy of \Z in B.
There's also an injective u-homomorphism from
B to A, taking * across to the left and down one
row, which misses the \N-like row in A. Now suppose
there was a u-isomorphism f from A to B. The head
of the \N in A, say x, has to go somwhere f(x) in B,
and every element of B has a predecessor. So what's
f^{-1}(S^{-1}(f(x)))? Well, S(f^{-1}(S^{-1}(f(x))))=x
since f and f^{-1} are homomorphisms, but x was
chosen not to have a predecessor, contradiction.

I -think- I've got a proof that u-structures with
an injective successor map with no infinite predecessor
chains (loops are okay) -do- have a C-B-like property.

I also think the general u-structure counterexample
can be extended to show that it doesn't work for
monoids, either, but I'm not sure how to deal with groups.

Saw Liz Harvey play the underground.
Damn good music, donno about her politics.
Oh well.

Watched more Card Captor, KOR. Eugh. Baaad crack.
• #### (no subject)

A paper on describing circuits in an agda DSL: http://www.staff.science.uu.nl/~swier004/publications/2015-types-draft.pdf

• #### (no subject)

Going more carefully now through this little tutorial on fpga programming with the iCEstick. It's in spanish, which makes it slightly more…

• #### (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…

• #### Error

Anonymous comments are disabled in this journal

default userpic