Zulip Chat Archive

Stream: Is there code for X?

Topic: Chain of intermediate fields


Ludwig Monnerjahn (Jul 17 2024 at 20:04):

I want to state the theorem:
xMx\in M if and only if there is a n0n\le 0 and chain
K0=L1L2LnCK_0 = L_1 \subset L_2 \subset \ldots \subset L_n \subset \mathbb{C} of subfields of C\mathbb{C} so that zLnz \in L_n and [Li+1:Li]=2fori=0,,n1 [L_{i+1}:L_i] = 2 \quad \text{for} \quad i = 0, \dots, n-1. K0K_0 is Q(N)\mathbb{Q}(N) for a set NCN\subset\mathbb{C}.

How do I formulate the chain to keep all the properties?

Daniel Weber (Jul 18 2024 at 06:12):

The chain itself can be a strictly monotone function Fin n → IntermediateField ℚ ℂ

Floris van Doorn (Jul 18 2024 at 11:36):

One tricky thing is that we want to be able to treat L (i+1) as a module over L i, because we want to talk about the dimension. I believe that is not easy to get from L i ≤ L (i + 1), since that is not a type-class.

Johan Commelin (Jul 18 2024 at 11:48):

In group theory there is docs#Subgroup.relIndex or something like that. Which computes the index between two subgroups. We could have a relDegree here.

Johan Commelin (Jul 18 2024 at 11:49):

It just returns junk if the side condition isn't met

Floris van Doorn (Jul 18 2024 at 12:16):

docs#Subgroup.relindex
That could be useful...

Antoine Chambert-Loir (Jul 18 2024 at 17:32):

As docs#Subgroup.relindex does for subgroups, you are not forced to return a junk stuff, you could return [L:KL][L : K \cap L] when you expect that KLK\le L.

Jz Pan (Jul 21 2024 at 19:46):

Floris van Doorn said:

One tricky thing is that we want to be able to treat L (i+1) as a module over L i, because we want to talk about the dimension. I believe that is not easy to get from L i ≤ L (i + 1), since that is not a type-class.

I think you can use docs#IntermediateField.extendScalars:

-- suppose you have `h : L i ≤ L (i + 1)`
Module.rank (L i) (IntermediateField.extendScalars h)

Meanwhile, I have a WIP IntermediateField.relrank in my computer (edit: #14987).

Ludwig Monnerjahn (Aug 30 2024 at 13:36):

Is there a way to mark this as a solved topic?

Ruben Van de Velde (Aug 30 2024 at 14:02):

Please don't (it exists, but doesn't work well)

Ludwig Monnerjahn (Aug 30 2024 at 14:15):

Ok, thank you.


Last updated: May 02 2025 at 03:31 UTC