-
Notifications
You must be signed in to change notification settings - Fork 840
[Merged by Bors] - feat(NumberTheory/SumTwoSquares): it is decidable whether a number is the sum of two squares #30273
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
Conversation
PR summary a2df56f501Import changes for modified filesNo significant changes to the import graph Import changes for all files
|
… the sum of two squares Try `#eval Finset.range 50 |>.filter (∃ x y, · = x ^ 2 + y ^ 2)`
2ed3e35
to
1eb907d
Compare
…sSquare_neg_one` to `Nat.mod_four_ne_three_of_mem_primeFactors_of_isSquare_neg_one`
Thanks! bors d+ |
✌️ SnirBroshi can now approve this pull request. To approve and merge a pull request, simply reply with |
Sorry, Can you also add a deprecation (maybe with a warning that the statement slightly changed)? |
Added back the original statements of the theorems I changed, with deprecations. Is this okay? (I didn't do it for the main theorem because it feels wrong to find a new name for it) |
I mean to use an alias, explaining that the statement slightly changed, something like @[deprecated "Note that the statement now uses ...." (since := "2025-10-15")]
alias Nat.Prime.mod_four_ne_three_of_dvd_isSquare_neg_one := Nat.mod_four_ne_three_of_mem_primeFactors_of_isSquare_neg_one And similarly for the other declarations. |
Thanks! bors merge |
… the sum of two squares (#30273) Add a `Decidable` instance for the already proven theorem of being the sum of two squares. Try `#eval Finset.range 50 |>.filter (∃ x y, · = x ^ 2 + y ^ 2)`
Pull request successfully merged into master. Build succeeded: |
Add a
Decidable
instance for the already proven theorem of being the sum of two squares.Try
#eval Finset.range 50 |>.filter (∃ x y, · = x ^ 2 + y ^ 2)