[Merged by Bors] - feat(data/nat/factorization/basic): define ord_proj[p] and ord_compl[p], prove basic lemmas
#15589
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
stuart-presnell
added
awaiting-review
kmill
reviewed
Jul 25, 2022
Vierkantor
reviewed
Aug 16, 2022
Vierkantor
added
awaiting-author
stuart-presnell
added
awaiting-CI
github-actions
bot
removed
the
awaiting-CI
Vierkantor
added
the
awaiting-review
leanprover-community-bot-assistant
added
ready-to-merge
bors bot
pushed a commit
that referenced
this pull request
Aug 17, 2022
…pl[p]`, prove basic lemmas (#15589) `ord_proj[p] n := p ^ (nat.factorization n p)` is the largest power of `p` that divides into `n`. For `p = 2` this is the even part of `n`. `ord_compl[p] n := n / ord_proj[p] n` is the largest divisor of `n` not divisible by `p`. For `p = 2` this is the odd part of `n`. Note that for consistency with the naming of other lemmas introduced in this PR, the following lemmas are renamed: * `pow_factorization_dvd` -> `ord_proj_dvd` * `pow_factorization_le` -> `ord_proj_le` * `not_dvd_div_pow_factorization` -> `not_dvd_ord_compl` * `coprime_of_div_pow_factorization` -> `coprime_ord_compl` * `div_pow_factorization_ne_zero` -> `ord_compl_pos` * `prime.pow_dvd_iff_dvd_pow_factorization` -> `prime.pow_dvd_iff_dvd_ord_proj`
|
Pull request successfully merged into master. Build succeeded: |
bors
bot
changed the title
ord_proj[p] and ord_compl[p], prove basic lemmasord_proj[p] and ord_compl[p], prove basic lemmas
stuart-presnell
added a commit
that referenced
this pull request
Aug 17, 2022
Resolving merge conflict after #15589
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
ord_proj[p] n := p ^ (nat.factorization n p)is the largest power ofpthat divides inton. Forp = 2this is the even part ofn.ord_compl[p] n := n / ord_proj[p] nis the largest divisor ofnnot divisible byp. Forp = 2this is the odd part ofn.Note that for consistency with the naming of other lemmas introduced in this PR, the following lemmas are renamed:
pow_factorization_dvd->ord_proj_dvdpow_factorization_le->ord_proj_lenot_dvd_div_pow_factorization->not_dvd_ord_complcoprime_of_div_pow_factorization->coprime_ord_compldiv_pow_factorization_ne_zero->ord_compl_posprime.pow_dvd_iff_dvd_pow_factorization->prime.pow_dvd_iff_dvd_ord_proj