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
Inverse Galois problem
(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!
==A construction with an elliptic modular function== Let {{math|''n'' > 1}} be any integer. A lattice {{math|Ξ}} in the [[complex plane]] with period ratio {{mvar|Ο}} has a sublattice {{math|Ξβ²}} with period ratio {{math|''nΟ''}}. The latter lattice is one of a finite set of sublattices permuted by the [[modular group]] {{math|PSL(2, '''Z''')}}, which is based on changes of basis for {{math|Ξ}}. Let {{mvar|j}} denote the [[elliptic modular function]] of [[Felix Klein]]. Define the polynomial {{math|''Ο<sub>n</sub>''}} as the product of the differences {{math|(''X'' β ''j''(Ξ<sub>''i''</sub>))}} over the conjugate sublattices. As a polynomial in {{mvar|X}}, {{math|''Ο<sub>n</sub>''}} has coefficients that are polynomials over <math>\mathbb{Q}</math> in {{math|''j''(''Ο'')}}. On the conjugate lattices, the modular group acts as {{math|PGL(2, '''Z'''/''n'''''Z''')}}. It follows that {{math|''Ο<sub>n</sub>''}} has Galois group isomorphic to {{math|PGL(2, '''Z'''/''n'''''Z''')}} over <math>\mathbb{Q}(\mathrm{J}(\tau))</math>. Use of Hilbert's irreducibility theorem gives an infinite (and dense) set of rational numbers specializing {{math|''Ο<sub>n</sub>''}} to polynomials with Galois group {{math|PGL(2, '''Z'''/''n'''''Z''')}} over {{nowrap|<math>\mathbb{Q}</math>.}} The groups {{math|PGL(2, '''Z'''/''n'''''Z''')}} include infinitely many non-solvable groups.
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)