Division rings with ranks joint work with Daniel Palacin Nadja - - PowerPoint PPT Presentation

division rings with ranks
SMART_READER_LITE
LIVE PREVIEW

Division rings with ranks joint work with Daniel Palacin Nadja - - PowerPoint PPT Presentation

Overview Division rings Division rings with ranks joint work with Daniel Palacin Nadja Hempel UCLA Udine, July 26, 2018 Nadja Hempel Division rings with ranks Overview Division rings 1 Overview 2 Division rings ranked/superrosy weight 1


slide-1
SLIDE 1

Overview Division rings

Division rings with ranks

joint work with Daniel Palacin Nadja Hempel

UCLA

Udine, July 26, 2018

Nadja Hempel Division rings with ranks

slide-2
SLIDE 2

Overview Division rings

1 Overview 2 Division rings

ranked/superrosy weight 1 finite burden

Nadja Hempel Division rings with ranks

slide-3
SLIDE 3

Overview Division rings

Overview

Nadja Hempel Division rings with ranks

slide-4
SLIDE 4

Overview Division rings ranked/superrosy weight 1 finite burden

Division rings

Nadja Hempel Division rings with ranks

slide-5
SLIDE 5

Overview Division rings ranked/superrosy weight 1 finite burden

Division rings

ranked/superrosy

Nadja Hempel Division rings with ranks

slide-6
SLIDE 6

Overview Division rings ranked/superrosy weight 1 finite burden

Rank function

Let D be a division ring carrying an ordinal-valued rank function among the definable sets in the imaginary expansion, i.e. rk : {Definable sets} → Ord, such that:

Nadja Hempel Division rings with ranks

slide-7
SLIDE 7

Overview Division rings ranked/superrosy weight 1 finite burden

Rank function

Let D be a division ring carrying an ordinal-valued rank function among the definable sets in the imaginary expansion, i.e. rk : {Definable sets} → Ord, such that:

1 rk(A) = 0 iff A is finite. Nadja Hempel Division rings with ranks

slide-8
SLIDE 8

Overview Division rings ranked/superrosy weight 1 finite burden

Rank function

Let D be a division ring carrying an ordinal-valued rank function among the definable sets in the imaginary expansion, i.e. rk : {Definable sets} → Ord, such that:

1 rk(A) = 0 iff A is finite. 2 The rank is preserved under definable bijections. Nadja Hempel Division rings with ranks

slide-9
SLIDE 9

Overview Division rings ranked/superrosy weight 1 finite burden

Rank function

Let D be a division ring carrying an ordinal-valued rank function among the definable sets in the imaginary expansion, i.e. rk : {Definable sets} → Ord, such that:

1 rk(A) = 0 iff A is finite. 2 The rank is preserved under definable bijections. 3 The Lascar inequalities: For a definable subgroup H of a

definable group G we have that rk(H) + rk(G/H) ≤ rk(G) ≤ rk(H) ⊕ rk(G/H),

Nadja Hempel Division rings with ranks

slide-10
SLIDE 10

Overview Division rings ranked/superrosy weight 1 finite burden

Lascar inequalities

For a definable subgroup H of a definable group G we have that rk(H) + rk(G/H) ≤ rk(G) ≤ rk(H) ⊕ rk(G/H),

Nadja Hempel Division rings with ranks

slide-11
SLIDE 11

Overview Division rings ranked/superrosy weight 1 finite burden

Lascar inequalities

For a definable subgroup H of a definable group G we have that rk(H) + rk(G/H) ≤ rk(G) ≤ rk(H) ⊕ rk(G/H), where the function ⊕ is the smallest symmetric strictly increasing function f among pairs of ordinals such that f (α, β + 1) = f (α, β) + 1.

Nadja Hempel Division rings with ranks

slide-12
SLIDE 12

Overview Division rings ranked/superrosy weight 1 finite burden

Lascar inequalities

For a definable subgroup H of a definable group G we have that rk(H) + rk(G/H) ≤ rk(G) ≤ rk(H) ⊕ rk(G/H), where the function ⊕ is the smallest symmetric strictly increasing function f among pairs of ordinals such that f (α, β + 1) = f (α, β) + 1. Example: See blackboard

Nadja Hempel Division rings with ranks

slide-13
SLIDE 13

Overview Division rings ranked/superrosy weight 1 finite burden

Lascar inequalities

For a definable subgroup H of a definable group G we have that rk(H) + rk(G/H) ≤ rk(G) ≤ rk(H) ⊕ rk(G/H), where the function ⊕ is the smallest symmetric strictly increasing function f among pairs of ordinals such that f (α, β + 1) = f (α, β) + 1. Example: See blackboard Remark The Uþ rank satisfies the above properties.

Nadja Hempel Division rings with ranks

slide-14
SLIDE 14

Overview Division rings ranked/superrosy weight 1 finite burden

Easy consequences I

Let G and H be two definable groups and let f : H → G be a definable group morphism. Then rk(Kerf ) + rk(Imf ) ≤ rk(H) ≤ rk(Kerf ) ⊕ rk(Imf ).

Nadja Hempel Division rings with ranks

slide-15
SLIDE 15

Overview Division rings ranked/superrosy weight 1 finite burden

Easy consequences I

Let G and H be two definable groups and let f : H → G be a definable group morphism. Then rk(Kerf ) + rk(Imf ) ≤ rk(H) ≤ rk(Kerf ) ⊕ rk(Imf ). Consequences: if f is injective,

Nadja Hempel Division rings with ranks

slide-16
SLIDE 16

Overview Division rings ranked/superrosy weight 1 finite burden

Easy consequences I

Let G and H be two definable groups and let f : H → G be a definable group morphism. Then rk(Kerf ) + rk(Imf ) ≤ rk(H) ≤ rk(Kerf ) ⊕ rk(Imf ). Consequences: if f is injective, then rk(H) = rk(G) iff [G : Imf ] < ∞.

Nadja Hempel Division rings with ranks

slide-17
SLIDE 17

Overview Division rings ranked/superrosy weight 1 finite burden

Easy consequences I

Let G and H be two definable groups and let f : H → G be a definable group morphism. Then rk(Kerf ) + rk(Imf ) ≤ rk(H) ≤ rk(Kerf ) ⊕ rk(Imf ). Consequences: if f is injective, then rk(H) = rk(G) iff [G : Imf ] < ∞. if H < G, then

Nadja Hempel Division rings with ranks

slide-18
SLIDE 18

Overview Division rings ranked/superrosy weight 1 finite burden

Easy consequences I

Let G and H be two definable groups and let f : H → G be a definable group morphism. Then rk(Kerf ) + rk(Imf ) ≤ rk(H) ≤ rk(Kerf ) ⊕ rk(Imf ). Consequences: if f is injective, then rk(H) = rk(G) iff [G : Imf ] < ∞. if H < G, then rk(H) = rk(G) iff [G : H] < ∞.

Nadja Hempel Division rings with ranks

slide-19
SLIDE 19

Overview Division rings ranked/superrosy weight 1 finite burden

Easy consequences II (DCC)

There is no infinite descending of definable groups H0 > H1 > · · · > Hn > . . . each of them having infinite index in its predecessor. (no infinite strictly descending chain of ordinals)

Nadja Hempel Division rings with ranks

slide-20
SLIDE 20

Overview Division rings ranked/superrosy weight 1 finite burden

Easy consequences II (DCC)

There is no infinite descending of definable groups H0 > H1 > · · · > Hn > . . . each of them having infinite index in its predecessor. (no infinite strictly descending chain of ordinals) In particular, for infinite subdivision rings, we obtain that every descending chain stabilizes after finitely many steps.

Nadja Hempel Division rings with ranks

slide-21
SLIDE 21

Overview Division rings ranked/superrosy weight 1 finite burden

wide/negligible

Definition Let X be a definable set of rank ωα · n + β with β < ωα and n ∈ ω. A definable subset Y of X is

Nadja Hempel Division rings with ranks

slide-22
SLIDE 22

Overview Division rings ranked/superrosy weight 1 finite burden

wide/negligible

Definition Let X be a definable set of rank ωα · n + β with β < ωα and n ∈ ω. A definable subset Y of X is wide in X if rk(Y ) ≥ ωα · n.

Nadja Hempel Division rings with ranks

slide-23
SLIDE 23

Overview Division rings ranked/superrosy weight 1 finite burden

wide/negligible

Definition Let X be a definable set of rank ωα · n + β with β < ωα and n ∈ ω. A definable subset Y of X is wide in X if rk(Y ) ≥ ωα · n. negligible with respect to X if rk(Y ) < ωα.

Nadja Hempel Division rings with ranks

slide-24
SLIDE 24

Overview Division rings ranked/superrosy weight 1 finite burden

wide/negligible

Definition Let X be a definable set of rank ωα · n + β with β < ωα and n ∈ ω. A definable subset Y of X is wide in X if rk(Y ) ≥ ωα · n. negligible with respect to X if rk(Y ) < ωα. If there is no confusion we simply say that Y is wide or respectively negligible.

Nadja Hempel Division rings with ranks

slide-25
SLIDE 25

Overview Division rings ranked/superrosy weight 1 finite burden

On the way to the main result

Lemma Any superrosy division ring has finite dimension (as a vector space)

  • ver any definable non-negligible subdivision ring.

Nadja Hempel Division rings with ranks

slide-26
SLIDE 26

Overview Division rings ranked/superrosy weight 1 finite burden

On the way to the main result

Lemma Any superrosy division ring has finite dimension (as a vector space)

  • ver any definable non-negligible subdivision ring.

proof: see blackboard

Nadja Hempel Division rings with ranks

slide-27
SLIDE 27

Overview Division rings ranked/superrosy weight 1 finite burden

On the way to the main result

Lemma Any superrosy division ring has finite dimension (as a vector space)

  • ver any definable non-negligible subdivision ring.

proof: see blackboard Lemma Any wide definable additive subgroup of a superrosy division ring has finite index. Proof uses Schlichtings’s theorem.

Nadja Hempel Division rings with ranks

slide-28
SLIDE 28

Overview Division rings ranked/superrosy weight 1 finite burden

On the way to the main result

Lemma Any superrosy division ring has finite dimension (as a vector space)

  • ver any definable non-negligible subdivision ring.

proof: see blackboard Lemma Any wide definable additive subgroup of a superrosy division ring has finite index. Proof uses Schlichtings’s theorem. Corollary Let D be a superrosy division ring. If a definable group morphism from D+ or D× to D+ has a negligible kernel, its image has finite index in D+.

Nadja Hempel Division rings with ranks

slide-29
SLIDE 29

Overview Division rings ranked/superrosy weight 1 finite burden

Main result

Theorem (H., Palacin) A division ring with a superrosy theory has finite dimension over its center.

Nadja Hempel Division rings with ranks

slide-30
SLIDE 30

Overview Division rings ranked/superrosy weight 1 finite burden

Division rings

weight 1

Nadja Hempel Division rings with ranks

slide-31
SLIDE 31

Overview Division rings ranked/superrosy weight 1 finite burden

Definition

Definition Let p be a type and λ be a cardinal. Then weight of p is at least λ if there is a non-forking extension tp(a/A) of p and a sequence (ai : i < λ) independent over A such that for all i < λ, we have that a | ⌣A ai.

Nadja Hempel Division rings with ranks

slide-32
SLIDE 32

Overview Division rings ranked/superrosy weight 1 finite burden

Definition

Definition Let p be a type and λ be a cardinal. Then weight of p is at least λ if there is a non-forking extension tp(a/A) of p and a sequence (ai : i < λ) independent over A such that for all i < λ, we have that a | ⌣A ai. weight 1: Let b be generic over A of weight 1. b | ⌣

A

a0 and b | ⌣

A

a1 ⇒ a0 | ⌣

A

a1

Nadja Hempel Division rings with ranks

slide-33
SLIDE 33

Overview Division rings ranked/superrosy weight 1 finite burden

Fact

Fact (Krupinski, Pillay) Let G be a group with a simple theory of weight 1 and A be a parameter set. Then the non-generic elements over A form a subgroup.

Nadja Hempel Division rings with ranks

slide-34
SLIDE 34

Overview Division rings ranked/superrosy weight 1 finite burden

Fact

Fact (Krupinski, Pillay) Let G be a group with a simple theory of weight 1 and A be a parameter set. Then the non-generic elements over A form a subgroup. proof: See blackboard

Nadja Hempel Division rings with ranks

slide-35
SLIDE 35

Overview Division rings ranked/superrosy weight 1 finite burden

Fact

Fact (Krupinski, Pillay) Let G be a group with a simple theory of weight 1 and A be a parameter set. Then the non-generic elements over A form a subgroup. proof: See blackboard Corollary Let D be a division ring with a simple theory of weight 1 and A be a parameter set. Then the non-generic elements over A form a subdivision ring.

Nadja Hempel Division rings with ranks

slide-36
SLIDE 36

Overview Division rings ranked/superrosy weight 1 finite burden

Main result

Theorem (H., Palacin) A division ring with a simple theory and a generic of weight one is a field.

Nadja Hempel Division rings with ranks

slide-37
SLIDE 37

Overview Division rings ranked/superrosy weight 1 finite burden

Division rings

finite burden

Nadja Hempel Division rings with ranks

slide-38
SLIDE 38

Overview Division rings ranked/superrosy weight 1 finite burden

Definition

Given a division ring D and a natural number n, we introduce the following property: (†)n For any definable subgroups H0, . . . , Hn of D+, there exists some j ≤ n such that [

i=j Hi : i≤n Hi] < ∞.

Nadja Hempel Division rings with ranks

slide-39
SLIDE 39

Overview Division rings ranked/superrosy weight 1 finite burden

Definition

Given a division ring D and a natural number n, we introduce the following property: (†)n For any definable subgroups H0, . . . , Hn of D+, there exists some j ≤ n such that [

i=j Hi : i≤n Hi] < ∞.

Remark A definable division ring of burden n satisfies (†)n.

Nadja Hempel Division rings with ranks

slide-40
SLIDE 40

Overview Division rings ranked/superrosy weight 1 finite burden

Results (H., Palacin)

Let D be a division ring that satisfies (†)n.

Nadja Hempel Division rings with ranks

slide-41
SLIDE 41

Overview Division rings ranked/superrosy weight 1 finite burden

Results (H., Palacin)

Let D be a division ring that satisfies (†)n. D has dimension at most n over any infinite definable subfield, in particular over its center.

Nadja Hempel Division rings with ranks

slide-42
SLIDE 42

Overview Division rings ranked/superrosy weight 1 finite burden

Results (H., Palacin)

Let D be a division ring that satisfies (†)n. D has dimension at most n over any infinite definable subfield, in particular over its center. D has the DCC on definable subfields.

Nadja Hempel Division rings with ranks

slide-43
SLIDE 43

Overview Division rings ranked/superrosy weight 1 finite burden

Results (H., Palacin)

Let D be a division ring that satisfies (†)n. D has dimension at most n over any infinite definable subfield, in particular over its center. D has the DCC on definable subfields. If n = 1 (e. g. D is an inp-minimal division ring) then D is commutative.

Nadja Hempel Division rings with ranks

slide-44
SLIDE 44

Overview Division rings ranked/superrosy weight 1 finite burden

Definable group actions

Fact (Hrushovski) Any definable group of automorphisms acting definably on a definable superstable field is trivial.

Nadja Hempel Division rings with ranks

slide-45
SLIDE 45

Overview Division rings ranked/superrosy weight 1 finite burden

Definable group actions

Fact (Hrushovski) Any definable group of automorphisms acting definably on a definable superstable field is trivial. Proposition (H., Palacin) If F is a field satisfying (†)n , then any definable group of automorphisms acting definably on F has size at most n.

Nadja Hempel Division rings with ranks

slide-46
SLIDE 46

Overview Division rings ranked/superrosy weight 1 finite burden

Definable group actions

Fact (Hrushovski) Any definable group of automorphisms acting definably on a definable superstable field is trivial. Proposition (H., Palacin) If F is a field satisfying (†)n and the algebraic closure of the prime field of F in F is infinite, then any definable group of automorphisms acting definably on F has size at most n.

Nadja Hempel Division rings with ranks

slide-47
SLIDE 47

Overview Division rings ranked/superrosy weight 1 finite burden

Thank you

Nadja Hempel Division rings with ranks