Skip to content

More Z/nZ theorems in iset.mm #4962

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

Open
wants to merge 35 commits into
base: develop
Choose a base branch
from
Open

Conversation

jkingdon
Copy link
Contributor

@jkingdon jkingdon commented Aug 4, 2025

This is znzrh2 through znhash and a bunch of theorems (mostly homomorphism theorems) which are used by those proofs.

jkingdon added 30 commits August 4, 2025 07:20
Stated as in set.mm.  The proof needs intuitionizing in various places
but is similar to the set.mm proof.
Includes a note about how to intuitionize one part of the proof.
Stated as in set.mm.  The proof is the same as the set.mm proof with
some changes for set existence.
Stated as in set.mm.  The proof is the set.mm one with some changes to
use ringcl in place of ovex .
Stated as in set.mm.  The proof needs a fair number of changes for set
existence but is otherwise the set.mm proof.
Stated as in set.mm.  The proof is fairly different from the set.mm
proof but the needed set existence steps can be added without changing
the conclusion.
Turns out there is a trick which lets us prove this without the set
existence condition found in 2idlvalg .  Document this trick in
mmil.html (not the first time iset.mm has used it, but worth a
mention as it comes up from time to time and might not be obvious).

Move 2idlmex slightly earlier in the file so we can use it in this
proof.
Stated as in set.mm.  The iset.mm proof is a new one.  It does have to
go through a number of steps, perhaps non-obvious ones, but it is
possible to prove the theorem as stated as in set.mm.
Stated as in set.mm.  The proof is the set.mm proof with some small
changes around set existence.
Stated as in set.mm.  The proof is the set.mm proof but is expanded
because a number of additional steps are needed for set existence.
Stated as in set.mm.  The proof needs several additional steps for set
existence but is otherwise the set.mm proof.
This rename has already been done in set.mm.
Stated as in set.mm.  The proof is basically the set.mm proof but
requires adjustment for differences in extensible structure theorems.
Point to the closest replacement we have so far.
Stated as in set.mm.  The proof is the set.mm proof with small changes
for set existence.
This is raleqtrdv , rexeqtrdv , raleqtrrdv , and rexeqtrrdv .
Stated as in set.mm.  The proof is the set.mm proof except:
* some changes to express that the proposition in the if
  statement is decidable
* modulus theorems take rationals rather than reals (but in this case it
  is an integer, so this is an easy change)
Stated as in set.mm.  The proof is the set.mm proof except that it needs
a few changes for set existence.
Stated as in set.mm.  The proof is the set.mm proof but needs some
intuitionizing in a number of places.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

1 participant