Families of polynomial mappings between groups

Eduardo Duez1
1 Department of Mathematics
The University of Texas at San Antonio (UTSA)

Abstract Algebra Research Topics for Undergraduates

2014 SACNAS Conference
Los Angeles, 17 October 2014

Work in collaboration with Jos Iovino, UTSA

http://math.utsa.edu/eduenez/2014LosAngelesSACNAS.pdf
Eduardo Duez (UTSA)

Polynomial mappings between groups

SACNAS 2014

1 / 15

What is a polynomial function?

Classical definition of polynomial on a field F
(say, F = Q or F = R):
f :FF
f (x) = a0 + a1 x + + an x n
for some n 0 and coefficients a0 , a1 , . . . , an F.
What about polynomials on other rings R
Classical definition:

(e.g., R = Z)?

f (x) = a0 + a1 x + + an x n
for some n 0 and coefficients a0 , a1 , . . . , an R.
Note that the definitions above are explicit rather than implicit.
They betray the abstract approach to algebra.
Eduardo Duez (UTSA)

Polynomial mappings between groups

SACNAS 2014

2 / 15

What is a polynomial function?

Classical definition of polynomial on a field F
(say, F = Q or F = R):
f :FF
f (x) = a0 + a1 x + + an x n
for some n 0 and coefficients a0 , a1 , . . . , an F.
What about polynomials on other rings R
Classical definition:

(e.g., R = Z)?

f (x) = a0 + a1 x + + an x n
for some n 0 and coefficients a0 , a1 , . . . , an R.
Note that the definitions above are explicit rather than implicit.
They betray the abstract approach to algebra.
Eduardo Duez (UTSA)

Polynomial mappings between groups

SACNAS 2014

2 / 15

What is a polynomial function?

Classical definition of polynomial on a field F
(say, F = Q or F = R):
f :FF
f (x) = a0 + a1 x + + an x n
for some n 0 and coefficients a0 , a1 , . . . , an F.
What about polynomials on other rings R
Classical definition:

(e.g., R = Z)?

f (x) = a0 + a1 x + + an x n
for some n 0 and coefficients a0 , a1 , . . . , an R.
Note that the definitions above are explicit rather than implicit.
They betray the abstract approach to algebra.
Eduardo Duez (UTSA)

Polynomial mappings between groups

SACNAS 2014

2 / 15

Properties of polynomial functions

Every constant function is a polynomial.

The identity function is a polynomial.
The sum of two polynomials is a polynomial.
The product of two polynomials is a polynomial.
Thus, the set P of polynomials is a subset of R R (set of all functions
R R) satisfying:
P includes the set PR of constants (a ring isomorphic to R).
P includes the identity function.
P is a subring of R R .
The classical definition amounts to the choice of P to be the minimal
set with those properties.

Eduardo Duez (UTSA)

Polynomial mappings between groups

SACNAS 2014

3 / 15

Properties of polynomial functions

Every constant function is a polynomial.

The identity function is a polynomial.
The sum of two polynomials is a polynomial.
The product of two polynomials is a polynomial.
Thus, the set P of polynomials is a subset of R R (set of all functions
R R) satisfying:
P includes the set PR of constants (a ring isomorphic to R).
P includes the identity function.
P is a subring of R R .
The classical definition amounts to the choice of P to be the minimal
set with those properties.

Eduardo Duez (UTSA)

Polynomial mappings between groups

SACNAS 2014

3 / 15

Properties of polynomial functions

Every constant function is a polynomial.

The identity function is a polynomial.
The sum of two polynomials is a polynomial.
The product of two polynomials is a polynomial.
Thus, the set P of polynomials is a subset of R R (set of all functions
R R) satisfying:
P includes the set PR of constants (a ring isomorphic to R).
P includes the identity function.
P is a subring of R R .
The classical definition amounts to the choice of P to be the minimal
set with those properties.

Eduardo Duez (UTSA)

Polynomial mappings between groups

SACNAS 2014

3 / 15

Is this a polynomial on the ring Z?

Consider the function f : Z Z:
f (n) =

n(n + 1)
n2 + n
=
.
2
2

f is not a polynomial on Z in the classical (strict) sense.

Exercise
e of all polynomials f : Q Q whose restriction
The set P
f Z : Z Z take integer values on integers is a subring of ZZ
including constants and the identity.
e is precisely the (additive) group generated by the polynomials
P
1,

x,

Eduardo Duez (UTSA)

x(x + 1)
,
2

...,

x(x + 1) . . . (x + k 1)
,
k!

Polynomial mappings between groups

....

SACNAS 2014

4 / 15

Is this a polynomial on the ring Z?

Consider the function f : Z Z:
f (n) =

n(n + 1)
n2 + n
=
.
2
2

f is not a polynomial on Z in the classical (strict) sense.

Exercise
e of all polynomials f : Q Q whose restriction
The set P
f Z : Z Z take integer values on integers is a subring of ZZ
including constants and the identity.
e is precisely the (additive) group generated by the polynomials
P
1,

x,

Eduardo Duez (UTSA)

x(x + 1)
,
2

...,

x(x + 1) . . . (x + k 1)
,
k!

Polynomial mappings between groups

....

SACNAS 2014

4 / 15

Is this a polynomial on the ring Z?

Consider the function f : Z Z:
f (n) =

n(n + 1)
n2 + n
=
.
2
2

f is not a polynomial on Z in the classical (strict) sense.

Exercise
e of all polynomials f : Q Q whose restriction
The set P
f Z : Z Z take integer values on integers is a subring of ZZ
including constants and the identity.
e is precisely the (additive) group generated by the polynomials
P
1,

x,

Eduardo Duez (UTSA)

x(x + 1)
,
2

...,

x(x + 1) . . . (x + k 1)
,
k!

Polynomial mappings between groups

....

SACNAS 2014

4 / 15

Is this a polynomial on the ring Z?

Consider the function f : Z Z:
f (n) =

n(n + 1)
n2 + n
=
.
2
2

f is not a polynomial on Z in the classical (strict) sense.

Exercise
e of all polynomials f : Q Q whose restriction
The set P
f Z : Z Z take integer values on integers is a subring of ZZ
including constants and the identity.
e is precisely the (additive) group generated by the polynomials
P
1,

x,

Eduardo Duez (UTSA)

x(x + 1)
,
2

...,

x(x + 1) . . . (x + k 1)
,
k!

Polynomial mappings between groups

....

SACNAS 2014

4 / 15

An abstract definition of polynomial mappings. . .

Fix groups G and H, both additive, but not necessarily abelian.
Let H G be the set of all functions f : G H.
Note that H G is a group under pointwise addition of functions as
usual.

Definition
For fixed g G, the step-g difference operator g : H G H G
(not a homomorphism) is defined by
g f (x) := f (x) + f (x + g).
Difference operators can be regarded algebraic versions of
infinitesimal differentiation.
Note that, for classical polynomials, difference operators strictly
decrease degree.
Eduardo Duez (UTSA)

Polynomial mappings between groups

SACNAS 2014

5 / 15

An abstract definition of polynomial mappings. . .

Fix groups G and H, both additive, but not necessarily abelian.
Let H G be the set of all functions f : G H.
Note that H G is a group under pointwise addition of functions as
usual.

Definition
For fixed g G, the step-g difference operator g : H G H G
(not a homomorphism) is defined by
g f (x) := f (x) + f (x + g).
Difference operators can be regarded algebraic versions of
infinitesimal differentiation.
Note that, for classical polynomials, difference operators strictly
decrease degree.
Eduardo Duez (UTSA)

Polynomial mappings between groups

SACNAS 2014

5 / 15

An abstract definition of polynomial mappings. . .

Fix groups G and H, both additive, but not necessarily abelian.
Let H G be the set of all functions f : G H.
Note that H G is a group under pointwise addition of functions as
usual.

Definition
For fixed g G, the step-g difference operator g : H G H G
(not a homomorphism) is defined by
g f (x) := f (x) + f (x + g).
Difference operators can be regarded algebraic versions of
infinitesimal differentiation.
Note that, for classical polynomials, difference operators strictly
decrease degree.
Eduardo Duez (UTSA)

Polynomial mappings between groups

SACNAS 2014

5 / 15

An abstract definition of polynomial mappings. . .

Fix groups G and H, both additive, but not necessarily abelian.
Let H G be the set of all functions f : G H.
Note that H G is a group under pointwise addition of functions as
usual.

Definition
For fixed g G, the step-g difference operator g : H G H G
(not a homomorphism) is defined by
g f (x) := f (x) + f (x + g).
Difference operators can be regarded algebraic versions of
infinitesimal differentiation.
Note that, for classical polynomials, difference operators strictly
decrease degree.
Eduardo Duez (UTSA)

Polynomial mappings between groups

SACNAS 2014

5 / 15

. . . an abstract definition of polynomial mappings

Definition (Leibmans polynomials)
Fix additive (not necessarily abelian) groups G, H.
Define a notion of degree of functions f H G recursively:
The only function of degree is the constant f (x) 0.
Every constant function f (x) h 6= 0 has degree 0.
For n = 0, 1, 2, 3, . . .
deg f n + 1

deg(g f ) n

for all g G.

A Leibman polynomial f : G H is a function such that deg f n

for some n.
The least such n is the (exact) degree deg f of f .
Otherwise f is not a Leibman polynomial, and we write
deg f = +.
Eduardo Duez (UTSA)

Polynomial mappings between groups

SACNAS 2014

6 / 15

. . . an abstract definition of polynomial mappings

Definition (Leibmans polynomials)
Fix additive (not necessarily abelian) groups G, H.
Define a notion of degree of functions f H G recursively:
The only function of degree is the constant f (x) 0.
Every constant function f (x) h 6= 0 has degree 0.
For n = 0, 1, 2, 3, . . .
deg f n + 1

deg(g f ) n

for all g G.

A Leibman polynomial f : G H is a function such that deg f n

for some n.
The least such n is the (exact) degree deg f of f .
Otherwise f is not a Leibman polynomial, and we write
deg f = +.
Eduardo Duez (UTSA)

Polynomial mappings between groups

SACNAS 2014

6 / 15

Examples of Leibman polynomials

Any (nonconstant) group homomorphism f : G H is a Leibman
polynomial, deg f = 1.
Any classical polynomial on a ring is a Leibman polynomial.
Any classical polynomial f : Q Q whose restriction f Z : Z Z
maps Z into Z is a Leibman polynomial on Z.
More generally, for any fixed h H and any Leibman polynomial f
on Z the function
f : Z H
f (n) = f (n)h
is a Leibman polynomial Z H

(a polynomial sequence in H).

A linear (quadratic, cubic, . . . , k -linear) form f : V F on a vector

space V /F is a Leibman polynomial of degree 1 (2, 3, . . . , k ).

Eduardo Duez (UTSA)

Polynomial mappings between groups

SACNAS 2014

7 / 15

Examples of Leibman polynomials

Any (nonconstant) group homomorphism f : G H is a Leibman
polynomial, deg f = 1.
Any classical polynomial on a ring is a Leibman polynomial.
Any classical polynomial f : Q Q whose restriction f Z : Z Z
maps Z into Z is a Leibman polynomial on Z.
More generally, for any fixed h H and any Leibman polynomial f
on Z the function
f : Z H
f (n) = f (n)h
is a Leibman polynomial Z H

(a polynomial sequence in H).

A linear (quadratic, cubic, . . . , k -linear) form f : V F on a vector

space V /F is a Leibman polynomial of degree 1 (2, 3, . . . , k ).

Eduardo Duez (UTSA)

Polynomial mappings between groups

SACNAS 2014

7 / 15

Examples of Leibman polynomials

Any (nonconstant) group homomorphism f : G H is a Leibman
polynomial, deg f = 1.
Any classical polynomial on a ring is a Leibman polynomial.
Any classical polynomial f : Q Q whose restriction f Z : Z Z
maps Z into Z is a Leibman polynomial on Z.
More generally, for any fixed h H and any Leibman polynomial f
on Z the function
f : Z H
f (n) = f (n)h
is a Leibman polynomial Z H

(a polynomial sequence in H).

A linear (quadratic, cubic, . . . , k -linear) form f : V F on a vector

space V /F is a Leibman polynomial of degree 1 (2, 3, . . . , k ).

Eduardo Duez (UTSA)

Polynomial mappings between groups

SACNAS 2014

7 / 15

The set of polynomial mappings G H

Definition
Let Ln (G, H) be the set of Leibman polynomials G H of degree at
most n, and L(G, H) the set of all Leibman polynomials.
If H is abelian, then Ln (G, H) (hence L(G, H)) is a group.
(The sum of two Leibman polynomials is a Leibman polynomial;
the negative of a Leibman polynomial is a Leibman polynomial).
However, L(G, H) is not a group in general.

Theorem (Leibman 2002)

If H is a nilpotent group, then L(G, H) is a group.
(However, Ln (G, H) need not be a group for fixed n.)

Remark
Leibman polynomials have awesome applications in ergodic theory,
but only when they belong together in a group.
Eduardo Duez (UTSA)

Polynomial mappings between groups

SACNAS 2014

8 / 15

The set of polynomial mappings G H

Definition
Let Ln (G, H) be the set of Leibman polynomials G H of degree at
most n, and L(G, H) the set of all Leibman polynomials.
If H is abelian, then Ln (G, H) (hence L(G, H)) is a group.
(The sum of two Leibman polynomials is a Leibman polynomial;
the negative of a Leibman polynomial is a Leibman polynomial).
However, L(G, H) is not a group in general.

Theorem (Leibman 2002)

If H is a nilpotent group, then L(G, H) is a group.
(However, Ln (G, H) need not be a group for fixed n.)

Remark
Leibman polynomials have awesome applications in ergodic theory,
but only when they belong together in a group.
Eduardo Duez (UTSA)

Polynomial mappings between groups

SACNAS 2014

8 / 15

The set of polynomial mappings G H

Definition
Let Ln (G, H) be the set of Leibman polynomials G H of degree at
most n, and L(G, H) the set of all Leibman polynomials.
If H is abelian, then Ln (G, H) (hence L(G, H)) is a group.
(The sum of two Leibman polynomials is a Leibman polynomial;
the negative of a Leibman polynomial is a Leibman polynomial).
However, L(G, H) is not a group in general.

Theorem (Leibman 2002)

If H is a nilpotent group, then L(G, H) is a group.
(However, Ln (G, H) need not be a group for fixed n.)

Remark
Leibman polynomials have awesome applications in ergodic theory,
but only when they belong together in a group.
Eduardo Duez (UTSA)

Polynomial mappings between groups

SACNAS 2014

8 / 15

The set of polynomial mappings G H

Definition
Let Ln (G, H) be the set of Leibman polynomials G H of degree at
most n, and L(G, H) the set of all Leibman polynomials.
If H is abelian, then Ln (G, H) (hence L(G, H)) is a group.
(The sum of two Leibman polynomials is a Leibman polynomial;
the negative of a Leibman polynomial is a Leibman polynomial).
However, L(G, H) is not a group in general.

Theorem (Leibman 2002)

If H is a nilpotent group, then L(G, H) is a group.
(However, Ln (G, H) need not be a group for fixed n.)

Remark
Leibman polynomials have awesome applications in ergodic theory,
but only when they belong together in a group.
Eduardo Duez (UTSA)

Polynomial mappings between groups

SACNAS 2014

8 / 15

Intermission: Ordinals
Ordinals are the extension of natural (counting) numbers
0, 1, 2, . . . , n, . . . to a transfinite (beyond finite) setting.
Some ordinals:
0, 1, 2, . . . , n, n + 1, . . . ,
, + 1, + 2, . . . , + n, . . . ,
2(= + ), 2 + 1, . . . , 2 + n, . . . ,
3(= + + ), 3 + 1, . . . , 3 + n, . . . ,
. . . , 2 (= ), 2 + 1, 2 + n, . . . ,
2 + , 2 + + 1, . . . , 2 + + n, . . . ,
2 + 2, 2 + 2 + 1, . . . , 2 + 2 + n, . . . ,
. . . , 2 + m, 2 + m + 1, . . . , 2 + m + n, . . . ,
. . . , 3 , . . . , 4 , . . . , k , . . . , , . . .
Eduardo Duez (UTSA)

Polynomial mappings between groups

SACNAS 2014

9 / 15

Intermission: Ordinals
Ordinals are the extension of natural (counting) numbers
0, 1, 2, . . . , n, . . . to a transfinite (beyond finite) setting.
Some ordinals:
0, 1, 2, . . . , n, n + 1, . . . ,
, + 1, + 2, . . . , + n, . . . ,
2(= + ), 2 + 1, . . . , 2 + n, . . . ,
3(= + + ), 3 + 1, . . . , 3 + n, . . . ,
. . . , 2 (= ), 2 + 1, 2 + n, . . . ,
2 + , 2 + + 1, . . . , 2 + + n, . . . ,
2 + 2, 2 + 2 + 1, . . . , 2 + 2 + n, . . . ,
. . . , 2 + m, 2 + m + 1, . . . , 2 + m + n, . . . ,
. . . , 3 , . . . , 4 , . . . , k , . . . , , . . .
Eduardo Duez (UTSA)

Polynomial mappings between groups

SACNAS 2014

9 / 15

A simpler definition of polynomial mappings

Definition (Polynomial function)
Fix additive (not necessarily abelian) groups G, H.
Define polynomial functions f H G recursively:
The constant function f (x) 0 is a polynomial.
If g f is a polynomial for all g G, then f is a polynomial.

Definition (Ordinal degree)

The ordinal degree deg f of a polynomial f H G is defined recursively:
deg(0) = 0 (the zero function has degree 0).
(Its just easier this way than the usual deg(0) = .)
deg f = > 0 if and only if is the least ordinal such that
deg(g f ) < for all g G.
Eduardo Duez (UTSA)

Polynomial mappings between groups

SACNAS 2014

10 / 15

A simpler definition of polynomial mappings

Definition (Polynomial function)
Fix additive (not necessarily abelian) groups G, H.
Define polynomial functions f H G recursively:
The constant function f (x) 0 is a polynomial.
If g f is a polynomial for all g G, then f is a polynomial.

Definition (Ordinal degree)

The ordinal degree deg f of a polynomial f H G is defined recursively:
deg(0) = 0 (the zero function has degree 0).
(Its just easier this way than the usual deg(0) = .)
deg f = > 0 if and only if is the least ordinal such that
deg(g f ) < for all g G.
Eduardo Duez (UTSA)

Polynomial mappings between groups

SACNAS 2014

10 / 15

Questions
Are there polynomials f H G of transfinite degree? For instance,
does f exist with deg f = (the first infinite countable ordinal)?
Is there a group of polynomials including polynomials of transfinite
degree?
We have some examples showing that the answer to both questions is
yes.
Are the answers to the questions above still yes if one insists on
the codomain group H being nonabelian? Non-nilpotent?
The answer is still yes, but we only have one example so far!
Can a theory, with nontrivial examples, be developed for
polynomials on semigroups rather than groups?
Ideally, examples will come accompanied by natural representations,
for example, as actions in measure spaces or in vector spaces (more
realistically, in separable Hilbert or Banach spaces).
This is particularly important for ergodic applications.
Eduardo Duez (UTSA)

Polynomial mappings between groups

SACNAS 2014

11 / 15

Questions
Are there polynomials f H G of transfinite degree? For instance,
does f exist with deg f = (the first infinite countable ordinal)?
Is there a group of polynomials including polynomials of transfinite
degree?
We have some examples showing that the answer to both questions is
yes.
Are the answers to the questions above still yes if one insists on
the codomain group H being nonabelian? Non-nilpotent?
The answer is still yes, but we only have one example so far!
Can a theory, with nontrivial examples, be developed for
polynomials on semigroups rather than groups?
Ideally, examples will come accompanied by natural representations,
for example, as actions in measure spaces or in vector spaces (more
realistically, in separable Hilbert or Banach spaces).
This is particularly important for ergodic applications.
Eduardo Duez (UTSA)

Polynomial mappings between groups

SACNAS 2014

11 / 15

Questions
Are there polynomials f H G of transfinite degree? For instance,
does f exist with deg f = (the first infinite countable ordinal)?
Is there a group of polynomials including polynomials of transfinite
degree?
We have some examples showing that the answer to both questions is
yes.
Are the answers to the questions above still yes if one insists on
the codomain group H being nonabelian? Non-nilpotent?
The answer is still yes, but we only have one example so far!
Can a theory, with nontrivial examples, be developed for
polynomials on semigroups rather than groups?
Ideally, examples will come accompanied by natural representations,
for example, as actions in measure spaces or in vector spaces (more
realistically, in separable Hilbert or Banach spaces).
This is particularly important for ergodic applications.
Eduardo Duez (UTSA)

Polynomial mappings between groups

SACNAS 2014

11 / 15

Questions
Are there polynomials f H G of transfinite degree? For instance,
does f exist with deg f = (the first infinite countable ordinal)?
Is there a group of polynomials including polynomials of transfinite
degree?
We have some examples showing that the answer to both questions is
yes.
Are the answers to the questions above still yes if one insists on
the codomain group H being nonabelian? Non-nilpotent?
The answer is still yes, but we only have one example so far!
Can a theory, with nontrivial examples, be developed for
polynomials on semigroups rather than groups?
Ideally, examples will come accompanied by natural representations,
for example, as actions in measure spaces or in vector spaces (more
realistically, in separable Hilbert or Banach spaces).
This is particularly important for ergodic applications.
Eduardo Duez (UTSA)

Polynomial mappings between groups

SACNAS 2014

11 / 15

Questions
Are there polynomials f H G of transfinite degree? For instance,
does f exist with deg f = (the first infinite countable ordinal)?
Is there a group of polynomials including polynomials of transfinite
degree?
We have some examples showing that the answer to both questions is
yes.
Are the answers to the questions above still yes if one insists on
the codomain group H being nonabelian? Non-nilpotent?
The answer is still yes, but we only have one example so far!
Can a theory, with nontrivial examples, be developed for
polynomials on semigroups rather than groups?
Ideally, examples will come accompanied by natural representations,
for example, as actions in measure spaces or in vector spaces (more
realistically, in separable Hilbert or Banach spaces).
This is particularly important for ergodic applications.
Eduardo Duez (UTSA)

Polynomial mappings between groups

SACNAS 2014

11 / 15

Questions
Are there polynomials f H G of transfinite degree? For instance,
does f exist with deg f = (the first infinite countable ordinal)?
Is there a group of polynomials including polynomials of transfinite
degree?
We have some examples showing that the answer to both questions is
yes.
Are the answers to the questions above still yes if one insists on
the codomain group H being nonabelian? Non-nilpotent?
The answer is still yes, but we only have one example so far!
Can a theory, with nontrivial examples, be developed for
polynomials on semigroups rather than groups?
Ideally, examples will come accompanied by natural representations,
for example, as actions in measure spaces or in vector spaces (more
realistically, in separable Hilbert or Banach spaces).
This is particularly important for ergodic applications.
Eduardo Duez (UTSA)

Polynomial mappings between groups

SACNAS 2014

11 / 15

Why would anyone care?

Groups of polynomial mappings la Leibman have hitherto been
the de facto framework relative to which the complexity of ergodic
actions is measured. This framework is used at the heart of a long
series of increasingly sophisticated inductive arguments of ergodic
descent originating with Furstenbergs (breathtaking!) ergodic
proof of Szemerdis theorem on arithmetic progressions on
subsets of positive density of N.
I

Extending the framework beyond Leibmans theory will have an

immediate impact on ergodic theory.

Semigroup actions arise naturally in ergodic theory. One isnt

always lucky enough to have invertible actions!
A model-theoretical approach to ergodic theory requires a very
clean algebraic framework.
Ordinal degree is an analog (or conceivably an example) of
Morley rank in the theory of stable groups whose roots are in
logic and model theory.
Plus, polynomials are fun!
Eduardo Duez (UTSA)

Polynomial mappings between groups

SACNAS 2014

12 / 15

Why would anyone care?

Groups of polynomial mappings la Leibman have hitherto been
the de facto framework relative to which the complexity of ergodic
actions is measured. This framework is used at the heart of a long
series of increasingly sophisticated inductive arguments of ergodic
descent originating with Furstenbergs (breathtaking!) ergodic
proof of Szemerdis theorem on arithmetic progressions on
subsets of positive density of N.
I

Extending the framework beyond Leibmans theory will have an

immediate impact on ergodic theory.

Semigroup actions arise naturally in ergodic theory. One isnt

always lucky enough to have invertible actions!
A model-theoretical approach to ergodic theory requires a very
clean algebraic framework.
Ordinal degree is an analog (or conceivably an example) of
Morley rank in the theory of stable groups whose roots are in
logic and model theory.
Plus, polynomials are fun!
Eduardo Duez (UTSA)

Polynomial mappings between groups

SACNAS 2014

12 / 15

Why would anyone care?

Groups of polynomial mappings la Leibman have hitherto been
the de facto framework relative to which the complexity of ergodic
actions is measured. This framework is used at the heart of a long
series of increasingly sophisticated inductive arguments of ergodic
descent originating with Furstenbergs (breathtaking!) ergodic
proof of Szemerdis theorem on arithmetic progressions on
subsets of positive density of N.
I

Extending the framework beyond Leibmans theory will have an

immediate impact on ergodic theory.

Semigroup actions arise naturally in ergodic theory. One isnt

always lucky enough to have invertible actions!
A model-theoretical approach to ergodic theory requires a very
clean algebraic framework.
Ordinal degree is an analog (or conceivably an example) of
Morley rank in the theory of stable groups whose roots are in
logic and model theory.
Plus, polynomials are fun!
Eduardo Duez (UTSA)

Polynomial mappings between groups

SACNAS 2014

12 / 15

Why would anyone care?

Groups of polynomial mappings la Leibman have hitherto been
the de facto framework relative to which the complexity of ergodic
actions is measured. This framework is used at the heart of a long
series of increasingly sophisticated inductive arguments of ergodic
descent originating with Furstenbergs (breathtaking!) ergodic
proof of Szemerdis theorem on arithmetic progressions on
subsets of positive density of N.
I

Extending the framework beyond Leibmans theory will have an

immediate impact on ergodic theory.

Semigroup actions arise naturally in ergodic theory. One isnt

always lucky enough to have invertible actions!
A model-theoretical approach to ergodic theory requires a very
clean algebraic framework.
Ordinal degree is an analog (or conceivably an example) of
Morley rank in the theory of stable groups whose roots are in
logic and model theory.
Plus, polynomials are fun!
Eduardo Duez (UTSA)

Polynomial mappings between groups

SACNAS 2014

12 / 15

Why would anyone care?

Groups of polynomial mappings la Leibman have hitherto been
the de facto framework relative to which the complexity of ergodic
actions is measured. This framework is used at the heart of a long
series of increasingly sophisticated inductive arguments of ergodic
descent originating with Furstenbergs (breathtaking!) ergodic
proof of Szemerdis theorem on arithmetic progressions on
subsets of positive density of N.
I

Extending the framework beyond Leibmans theory will have an

immediate impact on ergodic theory.

Semigroup actions arise naturally in ergodic theory. One isnt

always lucky enough to have invertible actions!
A model-theoretical approach to ergodic theory requires a very
clean algebraic framework.
Ordinal degree is an analog (or conceivably an example) of
Morley rank in the theory of stable groups whose roots are in
logic and model theory.
Plus, polynomials are fun!
Eduardo Duez (UTSA)

Polynomial mappings between groups

SACNAS 2014

12 / 15

Why would anyone care?

Groups of polynomial mappings la Leibman have hitherto been
the de facto framework relative to which the complexity of ergodic
actions is measured. This framework is used at the heart of a long
series of increasingly sophisticated inductive arguments of ergodic
descent originating with Furstenbergs (breathtaking!) ergodic
proof of Szemerdis theorem on arithmetic progressions on
subsets of positive density of N.
I

Extending the framework beyond Leibmans theory will have an

immediate impact on ergodic theory.

Semigroup actions arise naturally in ergodic theory. One isnt

always lucky enough to have invertible actions!
A model-theoretical approach to ergodic theory requires a very
clean algebraic framework.
Ordinal degree is an analog (or conceivably an example) of
Morley rank in the theory of stable groups whose roots are in
logic and model theory.
Plus, polynomials are fun!
Eduardo Duez (UTSA)

Polynomial mappings between groups

SACNAS 2014

12 / 15

Goodbye

Thank you!

Eduardo Duez (UTSA)

Polynomial mappings between groups

SACNAS 2014

13 / 15

References
Vitaly Bergelson, Weakly mixing PET, Ergodic Theory Dynam.
Systems 7 (1987), no. 3, 337349. MR 912373 (89g:28022)
V. Bergelson and A. Leibman, Polynomial extensions of van der
Waerdens and Szemerdis theorems, J. Amer. Math. Soc. 9
(1996), no. 3, 725753. MR 1325795 (96j:11013)
Eduardo Dueez and Jos Iovino, Model theory and the mean
ergodic theorem for abelian unitary actions, Preprint.
arXiv:1409.6208.
Harry Furstenberg, Ergodic behavior of diagonal measures and a
theorem of Szemerdi on arithmetic progressions, J. Analyse
Math. 31 (1977), 204256. MR 0498471 (58 #16583)
A. Leibman, Polynomial sequences in groups, J. Algebra 201
(1998), no. 1, 189206. MR 1608723 (99c:20044)
, Polynomial mappings of groups, Israel J. Math. 129
(2002),
2960. MR 1910931
(2003g:20060)
Eduardo Duez (UTSA)
Polynomial mappings between groups
SACNAS 2014

14 / 15

Appendix: A group including polynomials of degree

Let Z(0) = Z, Z(1) = Z, . . . , Z(n) = Z, . . . , be a sequence of
(identical) copies of the infinite cyclic group Z.
Let 1n = 1 Z(n) be the unity of Z(n) .
L
Let G = Z = n< Z(n) be the direct sum of all these groups.
Write a typical element x G as
X
x=
xn 1(n)
n<

for an almost-zero sequence {xn | n < } in Z.

For any sequence f = {fn | n < } of (say, classical) polynomials
fn : Z Z, let f : G Z be the function
X
x 7
fn (xn ).
n<

The set {f }f of all such functions is a group (subgroup of ZG ).

P
The function : x 7 n< xnn has degree .
Eduardo Duez (UTSA)

Polynomial mappings between groups

SACNAS 2014

15 / 15