-
Notifications
You must be signed in to change notification settings - Fork 90
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Finiteness of UpWords given finite alphabet #4533
base: develop
Are you sure you want to change the base?
Conversation
paysd.1 $e |- ( ph -> A e. Fin ) $. | ||
paysd.2 $e |- ( ph -> B : A --> RR ) $. | ||
paysd.3 $e |- ( ph -> sum_ k e. A ( B ` k ) = 0 ) $. | ||
paysd.4 $e |- ( ph -> C = (/) ) $. |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
I assume this is the initial step of a proof by induction?
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
That's a comment with some proof... I'm actually not sure if I want to prove the fact that |A| transfers are sufficient by induction or by explicit construction of C.
tworepnotupword.1 $e |- A e. _V $. | ||
$( Word of two matching characters is never an increasing sequence. | ||
(Contributed by Ender Ting, 22-Nov-2024.) $) | ||
tworepnotupword $p |- -. ( <" A "> ++ <" A "> ) e. UpWord S $= |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Why not -. <" A A "> e. UpWord S
? Then label could be s2repnupword.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
There was such a word constructor? 😮
|
||
${ | ||
$d S a $. $d T a $. | ||
$( There is a finite number of strictly increasing sequences over finite |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
"strictly increasing sequences of fixed length"
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Ah yes, I see how this can become misleading (given that total number of strictly increasing sequences will be finite as well).
Hopefully I found the right place to put
rabss3d
after promotion.