Timeline for Can one optimize the probability that an identity is satisfied until the probability is $1$?
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 27, 2019 at 16:43 | comment | added | Joseph Van Name | For the example, I chose lattices instead of groups since this technique for constructing algebras works better for lattices than for groups. I had a hard time making an example that is more readable than the question itself. | |
| Jan 27, 2019 at 16:42 | history | edited | Joseph Van Name | CC BY-SA 4.0 |
added 1043 characters in body
|
| Jan 27, 2019 at 9:56 | history | edited | Joseph Van Name | CC BY-SA 4.0 |
deleted 10 characters in body
|
| Jan 27, 2019 at 8:05 | comment | added | Andrej Bauer | The quantifier in "there is some $f \in \mathcal{M} \setminus \mathcal{L}$" is unclear. Did you mean "there exists $f \in \mathcal{M} \setminus \mathcal{L}$" or "for every $f \in \mathcal{M} \setminus \mathcal{L}$"? Actually, that entire sentence is unclear. "Along with where"? | |
| Jan 27, 2019 at 8:04 | comment | added | Andrej Bauer | Ugh, that's a lot of ellipsis. Can you give an example with groups (where the inverse is one of the operations)? | |
| Jan 27, 2019 at 0:38 | history | asked | Joseph Van Name | CC BY-SA 4.0 |