Jump to content

Selmer group

From Wikipedia, the free encyclopedia
(Redirected from Selmer Group)

In arithmetic geometry, the Selmer group, named in honor of the work of Ernst Sejersted Selmer (1951) by John William Scott Cassels (1962), is a group constructed from an isogeny of abelian varieties.

The Selmer group of an isogeny

[edit]

The Selmer group of an abelian variety A with respect to an isogeny f : A → B of abelian varieties can be defined in terms of Galois cohomology as

where Av[f] denotes the f-torsion of Av and is the local Kummer map . Note that is isomorphic to . Geometrically, the principal homogeneous spaces coming from elements of the Selmer group have Kv-rational points for all places v of K. The Selmer group is finite. This implies that the part of the Tate–Shafarevich group killed by f is finite due to the following exact sequence

0 → B(K)/f(A(K)) → Sel(f)(A/K) → Ш(A/K)[f] → 0.

The Selmer group in the middle of this exact sequence is finite and effectively computable. This implies the weak Mordell–Weil theorem that its subgroup B(K)/f(A(K)) is finite. There is a notorious problem about whether this subgroup can be effectively computed: there is a procedure for computing it that will terminate with the correct answer if there is some prime p such that the p-component of the Tate–Shafarevich group is finite. It is conjectured that the Tate–Shafarevich group is in fact finite, in which case any prime p would work. However, if (as seems unlikely) the Tate–Shafarevich group has an infinite p-component for every prime p, then the procedure may never terminate.

Ralph Greenberg (1994) has generalized the notion of Selmer group to more general p-adic Galois representations and to p-adic variations of motives in the context of Iwasawa theory.

The Selmer group of a finite Galois module

[edit]

More generally one can define the Selmer group of a finite Galois module M (such as the kernel of an isogeny) as the elements of H1(GK,M) that have images inside certain given subgroups of H1(GKv,M).

In the beginning

[edit]

In his 1954 paper 'A Conjecture Concerning Rational Points On Cubic Curves'[1], Selmer investigates generators for the rational points on certain cubic curves using two descents. He notes that a method used by Cassels[2] points to an insufficiency in the methods of detecting generators used previously by Selmer. However, the method of Cassels is also insufficient to detect all generators. Selmer examines the situation numerically, and formulates the conjecture[1]:

When a second descent exists, the number of generators found is an even number less than what is indicated by the first descent.

Cassels explores the situation in a series of eight papers, beginning in 1959 with 'Arithmetic on curves of genus 1: I. On a conjecture of Selmer'.[3] In the (1962) third paper in the series, 'Arithmetic on curves of genus 1. III. The Tate–Šafarevič and Selmer groups'[4], Cassels remarks:

We shall call it a Selmer group because Selmer initiated the present work.

And thus we have the Selmer groups.

References

[edit]
  1. ^ a b Selmer, Ernst S. (1954). "A conjecture concerning rational points on cubic curves". Mathematica Scandinavica. 2: 49–54. Retrieved 24 December 2024.
  2. ^ Cassels, J. W. S. (1950). "The rational solutions of the diophantine equation" (PDF). Acta Mathematica. 82 (0): 243–273. doi:10.1007/BF02398279. ISSN 0001-5962. Retrieved 24 December 2024.
  3. ^ Cassels, J.W.S. (1959). "Arithmetic on Curves of Genus 1. I. On a conjecture of Selmer". crll. 1959 (202): 52–99. doi:10.1515/crll.1959.202.52. ISSN 0075-4102.
  4. ^ Cassels, J. W. S. (1963). "Arithmetic on Curves of Genus 1 III. The Tate-Šafarevič and Selmer Groups". Proceedings of the London Mathematical Society. s3-13 (1): 768–768. doi:10.1112/plms/s3-13.1.768-s. Retrieved 24 December 2024.

See also

[edit]