[Merged by Bors] - feat: lemmas on ordinal exponentiation/logarithms - #36583
[Merged by Bors] - feat: lemmas on ordinal exponentiation/logarithms#36583vihdzp wants to merge 5 commits into
Conversation
PR summary ecdcc43a7aImport changes for modified filesNo significant changes to the import graph Import changes for all files
|
| grw [lt_succ_iff.1 hc] | ||
| exact omega0_pos | ||
|
|
||
| theorem lt_omega0_omega0_opow {a b : Ordinal} (hb : b ≠ 0) : |
There was a problem hiding this comment.
I'm slightly worried that soon we'll also get lt_omega0_omega0_omega0_opow... Do these have some nice generalisation we could give?
There was a problem hiding this comment.
ω^ω^x is relevant to me because of the property that a, b < ω^ω^x imply a * b < ω^ω^x. I don't think I have any use for talking about ω^ω^ω^x; maybe it's best to defer any generalizing until that happens.
There was a problem hiding this comment.
let's hope no-one else has use for that either!
There was a problem hiding this comment.
oh I see, the point is that being multiplicatively principal is useful enough to deserve extra theorems?
There was a problem hiding this comment.
Well, it's not that it "deserves" extra theorems, I do actually make use of it!
vihdzp/combinatorial-games#360
There was a problem hiding this comment.
Oh you mean with natural multiplication, I see
There was a problem hiding this comment.
It's closed under both kinds of multiplication, in fact :)
And nimber multiplication too!
There was a problem hiding this comment.
It's closed under both kinds of multiplication, in fact :)
Right, but being closed under ordinal multiplication is already in mathlib so you can't be using this to prove that (which is what I thought you meant before clicking the link)
|
Thanks! bors merge |
Downstreamed from the CGT repo.
|
Pull request successfully merged into master. Build succeeded:
|
Downstreamed from the CGT repo.