Skip to content
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

[Merged by Bors] - feat(field_theory.minimal_polynomial): add results for GCD domains #5336

Closed
wants to merge 7 commits into from

Conversation

riccardobrasca
Copy link
Member

@riccardobrasca riccardobrasca commented Dec 12, 2020

I have added gcd_domain_dvd: for GCD domains, the minimal polynomial divides any primitive polynomial that has the integral
element as root.

For gcd_domain_eq_field_fractions and gcd_domain_dvd I have also added explicit versions for . Unfortunately, it seems impossible (to me at least) to apply the general lemmas and I had to redo the proofs, see Zulip for more details. (The basic reason seems to be that it's hard to convince lean that is_scalar_tower ℤ ℚ α holds using the localization map).

@riccardobrasca riccardobrasca added the awaiting-review The author would like community review of the PR label Dec 12, 2020
Copy link
Collaborator

@Vierkantor Vierkantor left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

A couple of small comments, but it looks nice (and very useful) overall!

src/field_theory/minimal_polynomial.lean Outdated Show resolved Hide resolved
src/field_theory/minimal_polynomial.lean Outdated Show resolved Hide resolved
src/field_theory/minimal_polynomial.lean Outdated Show resolved Hide resolved
src/field_theory/minimal_polynomial.lean Outdated Show resolved Hide resolved
src/field_theory/minimal_polynomial.lean Outdated Show resolved Hide resolved
@Vierkantor Vierkantor added awaiting-author A reviewer has asked the author a question or requested changes and removed awaiting-review The author would like community review of the PR labels Dec 14, 2020
riccardobrasca and others added 6 commits December 14, 2020 14:15
Co-authored-by: Anne Baanen <Vierkantor@users.noreply.github.com>
Co-authored-by: Anne Baanen <Vierkantor@users.noreply.github.com>
Co-authored-by: Anne Baanen <Vierkantor@users.noreply.github.com>
Co-authored-by: Anne Baanen <Vierkantor@users.noreply.github.com>
Co-authored-by: Anne Baanen <Vierkantor@users.noreply.github.com>
@riccardobrasca riccardobrasca added awaiting-review The author would like community review of the PR and removed awaiting-author A reviewer has asked the author a question or requested changes labels Dec 14, 2020
Copy link
Collaborator

@Vierkantor Vierkantor left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Thanks!

bors r+

@github-actions github-actions bot added ready-to-merge All that is left is for bors to build and merge this PR. (Remember you need to say `bors r+`.) and removed awaiting-review The author would like community review of the PR labels Dec 14, 2020
bors bot pushed a commit that referenced this pull request Dec 14, 2020
…5336)

I have added `gcd_domain_dvd`: for GCD domains, the minimal polynomial divides any primitive polynomial that has the integral
element as root.

For `gcd_domain_eq_field_fractions` and `gcd_domain_dvd` I have also added explicit versions for `ℤ`. Unfortunately, it seems impossible (to me at least) to apply the general lemmas and I had to redo the proofs, see [Zulip](https://leanprover.zulipchat.com/#narrow/stream/116395-maths/topic/Minimal.20polynomial.20over.20.E2.84.9A.20vs.20over.20.E2.84.A4) for more details. (The basic reason seems to be that it's hard to convince lean that `is_scalar_tower ℤ ℚ α` holds using the localization map).
@bors
Copy link

bors bot commented Dec 14, 2020

Pull request successfully merged into master.

Build succeeded:

@bors bors bot changed the title feat(field_theory.minimal_polynomial): add results for GCD domains [Merged by Bors] - feat(field_theory.minimal_polynomial): add results for GCD domains Dec 14, 2020
@bors bors bot closed this Dec 14, 2020
@bors bors bot deleted the min_poly_gcd branch December 14, 2020 19:54
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
ready-to-merge All that is left is for bors to build and merge this PR. (Remember you need to say `bors r+`.)
Projects
None yet
Development

Successfully merging this pull request may close these issues.

None yet

2 participants