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(FieldTheory/Separable): add some results regarding separable and no repeated roots #9263

Closed
wants to merge 1 commit into from

Conversation

acmepjz
Copy link
Collaborator

@acmepjz acmepjz commented Dec 24, 2023

  • nodup_[a]roots_iff_of_splits: a polynomial has no repeated roots if and only if it is separable.
  • card_rootSet_eq_natDegree_iff_of_splits: a polynomial has number of roots equal to its degree if and only if it is separable. A converse to card_rootSet_eq_natDegree.

Also add some convenience lemmas:

  • Separable.ne_zero: a separable polynomial is not zero.
  • Separable.map_minpoly: if an element is separable over a small field, then it's also separable over a large field.

Open in Gitpod

Copy link
Contributor

@alreadydone alreadydone left a comment

Choose a reason for hiding this comment

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

Thanks!
maintainer merge

Copy link

🚀 Pull request has been placed on the maintainer queue by alreadydone.

Copy link
Member

@jcommelin jcommelin 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 merge

@leanprover-community-mathlib4-bot leanprover-community-mathlib4-bot added ready-to-merge This PR has been sent to bors. and removed awaiting-review labels Dec 25, 2023
mathlib-bors bot pushed a commit that referenced this pull request Dec 25, 2023
… no repeated roots (#9263)

- `nodup_[a]roots_iff_of_splits`: a polynomial has no repeated roots if and only if it is separable.
- `card_rootSet_eq_natDegree_iff_of_splits`: a polynomial has number of roots equal to its degree if and only if it is separable. A converse to `card_rootSet_eq_natDegree`.

Also add some convenience lemmas:

- `Separable.ne_zero`: a separable polynomial is not zero.
- `Separable.map_minpoly`: if an element is separable over a small field, then it's also separable over a large field.
@mathlib-bors
Copy link
Contributor

mathlib-bors bot commented Dec 25, 2023

Pull request successfully merged into master.

Build succeeded:

@mathlib-bors mathlib-bors bot changed the title feat(FieldTheory/Separable): add some results regarding separable and no repeated roots [Merged by Bors] - feat(FieldTheory/Separable): add some results regarding separable and no repeated roots Dec 25, 2023
@mathlib-bors mathlib-bors bot closed this Dec 25, 2023
@mathlib-bors mathlib-bors bot deleted the acmepjz_sep_nodup_roots branch December 25, 2023 14:38
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
ready-to-merge This PR has been sent to bors. t-algebra Algebra (groups, rings, fields etc)
Projects
None yet
Development

Successfully merging this pull request may close these issues.

None yet

4 participants