

Thank you for the links
Junk theorems in Lean are laughably bad due to type coercions.
Those look suspicious… I mean when you consider that the set of propositions is given a topology and an order, “The set {z : ℝ | z ≠ 0} is a continuous, non-monotone surjection.” doesn’t seem so ridiculous after all. Similarly the determinant of logical operations gains meaning on a boolean algebra. Zeta(1) is also by design. It does start getting juicy around “2 - 3 = +∞” and the nontransitive equality and the integer interval.


This github bot arguing with itself for over 5000 comments over an issue label
https://github.com/google-gemini/gemini-cli/issues/16723