Tower of fields
In mathematics, a tower of fields is a sequence of field extensions
- F0 ⊆ F1 ⊆ ... ⊆ Fn ⊆ ...
The name comes from such sequences often being written in the form
A tower of fields may be finite or infinite.
Examples
- Q ⊆ R ⊆ C is a finite tower with rational, real and complex numbers.
- The sequence obtained by letting F0 be the rational numbers Q, and letting
- (i.e. Fn+1 is obtained from Fn by adjoining a 2nth root of 2) is an infinite tower.
- If p is a prime number the p th cyclotomic tower of Q is obtained by letting F0 = Q and Fn be the field obtained by adjoining to Q the pnth roots of unity. This tower is of fundamental importance in Iwasawa theory.
- The Golod–Shafarevich theorem shows that there are infinite towers obtained by iterating the Hilbert class field construction to a number field.
gollark: Unfortunately, my excellent code appears to not work properly.```c#include <stdio.h>#include <signal.h>#include <string.h>#include <stdlib.h>#include <sys/mman.h>#include <unistd.h>static void handler(int sig, siginfo_t *info, void *utterly_worthless_argument) { printf("oh bees segfault %08x\n", info->si_addr); int ps = getpagesize(); long ad = (long)info->si_addr; ad = ad - (ad % ps); mmap((void*)ad, 0x10000, PROT_NONE, MAP_ANONYMOUS|MAP_FIXED, -1, 0);}int main() { struct sigaction sa; sigemptyset(&sa.sa_mask); sa.sa_flags = SA_NODEFER; sa.sa_sigaction = handler; sigaction(SIGSEGV, &sa, NULL); *(int*)NULL = -3; printf("thing done\n"); return 0;}```
gollark: Why are people not arbitraging this?
gollark: I don't think you can do that without extra hardware.
gollark: No.
gollark: ffmpeg and other tools dealing with video encoding will have options for it.
References
- Section 4.1.4 of Escofier, Jean-Pierre (2001), Galois theory, Graduate Texts in Mathematics, 204, Springer-Verlag, ISBN 978-0-387-98765-1
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.