Timeline for Ultrafilter lemma for arbitrary lattice
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 27, 2022 at 16:12 | comment | added | Martin Sleziak | @JoelDavidHamkins On page 57 in the edition I have here: "For convenience we adopt the following slightly restricted definition of lattices. (By standard terminology our lattices would have to be called non–trivial bounded lattices.) Definition 4.27. A lattice is a partially ordered set $L$ in which each finite subset $F$ has an infimum, $\inf F$, and a supremum, $\sup F$, (in particular L has a smallest element, $0=\sup\emptyset$, and a largest element, $1=\inf\emptyset$) and such that $0\ne1$." (I suppose it should be mentioned.) | |
| Dec 27, 2022 at 15:39 | comment | added | Joel David Hamkins | In light of Adam's comment, shouldn't the theorem be about bounded lattices? | |
| Dec 27, 2022 at 12:03 | history | edited | Keith Kearnes | CC BY-SA 4.0 |
added 99 characters in body
|
| Dec 27, 2022 at 12:00 | comment | added | Asaf Karagila♦ | Thanks. I was too lazy to open the book and write an answer, and when Joel posted his answer to the question at hand, I figured it wasn't as relevant. But I'm glad that someone took the time. | |
| Dec 27, 2022 at 12:00 | history | edited | Keith Kearnes | CC BY-SA 4.0 |
added 252 characters in body
|
| Dec 27, 2022 at 11:41 | history | edited | Keith Kearnes | CC BY-SA 4.0 |
added 315 characters in body
|
| Dec 27, 2022 at 11:23 | history | answered | Keith Kearnes | CC BY-SA 4.0 |