Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Hasse principle
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
{{Short description|Solving integer equations from all modular solutions}} In [[mathematics]], [[Helmut Hasse]]'s '''local–global principle''', also known as the '''Hasse principle''', is the idea that one can find an [[diophantine equation|integer solution to an equation]] by using the [[Chinese remainder theorem]] to piece together solutions [[modular arithmetic|modulo]] powers of each different [[prime number]]. This is handled by examining the equation in the [[Completion (ring theory)|completions]] of the [[rational number]]s: the [[real number]]s and the [[p-adic number|''p''-adic numbers]]. A more formal version of the Hasse principle states that certain types of equations have a rational solution [[if and only if]] they have a solution in the [[real number]]s ''and'' in the ''p''-adic numbers for each prime ''p''.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)