Introduction

to motivic
integration
and some
applications

Jorge Cely

Motivic
integration Introduction to motivic integration and some
Cluckers-
Loeser
approach
applications
Transfer
principles in
the Langlands
program Jorge Cely

University of Pittsburgh

April 21, 2012

 Introduction
to motivic
integration
and some
Some history of our tool
applications

Jorge Cely

Motivic
integration
Motivic integration was introduced by Kontsevich in a lecture
Cluckers-
in 1995 where he proved the equality of Betti numbers for
Loeser
approach
birationally equivalent Calabi-Yau manifolds. He was inspired in
Transfer
the theory of p-adic integration.
principles in
the Langlands
program
The “method”of his proof was developed by Denef and Loeser
and that is what we know as motivic integration. A short time
later, Clueckers and Loeser built a very general framework for
motivic integration based on model theory (I’ll talk about this
one).
There is another theory developed by Hrushovski and Kazhdan
also based on model theory.
 Introduction
to motivic
integration
and some
Motivic integration: generalities
applications

Jorge Cely

Motivic
integration In traditional measure theory the idea is to define a measure
Cluckers-
Loeser
over some subsets and this measure is real-valued. Motivic
approach measures are different, two novelties:
Transfer
principles in • The measure is not real-valued, instead it takes values in a
the Langlands
program Grothendieck group (I’ll explain this).
• The measurable sets are the definable sets in a formal
language. To define this we need some mathematical logic.
Of course, changing this we may expect strange things (at a
first glance) of concepts such as, measurable function, integral,
change of variables and so on.
 Introduction
to motivic
integration
and some
Some model theory
applications

Jorge Cely

Motivic
The idea of model theory is to use first order logic for study of
integration mathematical structures. One very important ingredient is the
Cluckers-
Loeser
formal language (syntax). These are the logical symbols:
approach
• Logical connectives ¬, ∧, ∨, →, ↔
Transfer
principles in
the Langlands
• Quantifier symbols ∃, ∀
program
• Equality symbol = and parenthesis (, )
• Variables x1 , x2 , . . .
Nonlogical symbols:
• Predicate symbols.
• Function symbols.
• Constant symbols.
 Introduction
to motivic
integration Given and structure M in a language L, we associate to M
and some
applications invariants of logical nature like Th(M), the set of first order
Jorge Cely L-sentences which are true in M or the category of definable
sets, this is the subsets of Mn given by formulas in the
Motivic
integration language L.
Cluckers-
Loeser
Consider the field of complex numbers C in the language of
approach rings Lring = {0, 1, +, −, ×}.Clearly, for all n ≥ 1
Transfer
principles in
the Langlands ∀xn . . . ∀x0 ∃y (xn y n + · · · + x1 y + x0 = 0) ∈ Th(C),
program

because C is algebraically closed. The unit circle is a definable

set of C2 because it is given by the formula

x 2 + y 2 = 1,

and in general, any affin variety is a definable set (by Hilbert’

basis theorem). Quantifier elimination (for Th(C)) tells us that
any definable subset is a Boolean combination of affin varieties.
 Introduction
to motivic
integration
and some
Example of a motivic measure:
applications

Jorge Cely
finite counting
Motivic In motivic measure, we take the measure of the formula rather
integration
than the measure of the definable subset that the formula
Cluckers-
Loeser defines. We focus the attention now on formulas rather than
approach
sets.
Transfer
principles in The motivic measure of a formula is a universal measure in the
the Langlands
program sense that the value assigned to the formula is independent of
any particular field.
Let φ(x) be a formula in the language of rings. For each finite
field Fq , consider

φ(Fq ) = {a ∈ Fnq : Fq |= φ(a)},

and count the elements in this set #φ(Fq ).

How do these numbers #φ(Fq ) vary with q > 0, power of a
prime?
 Introduction
to motivic
integration Idea of Grothendieck rings: we replace the objects of a
and some
applications category by equivalence classes of objects, by changing the
Jorge Cely notion of equivalence one can define the rings where the
Motivic
desired invariants take values.
integration In our example we start with the free abelian group on the set
Cluckers-
Loeser
of ring formulas. We impose two families of relations.
approach
• Scissor relations: For φ1 and φ2 two Lring -formulas
Transfer
principles in
the Langlands
program [φ1 ∨ φ2 ] = [φ1 ] + [φ2 ] − [φ1 ∧ φ2 ].

• Congruence relations: We say that two formulas are

congruent
[φ1 ] = [φ2 ]
if there exists a Lring -formula ψ such that for any
pseudo-finite field K , the interpretation of ψ in K , this is
ψ(K ), gives a bijection between φ1 (K ) and φ2 (K ).
 Introduction
to motivic
integration
and some
Counting measure
applications

Jorge Cely
The Grothendieck group of ring formulas Sring is defined as the
Motivic
integration free abelian group (on Lring -formulas) subject to the relations
Cluckers- described above.
Loeser
approach We define the counting measure
Transfer
principles in
the Langlands
Lring -formulas −→ Sring
program

φ 7−→ [φ]
We put a ring structure on Sring by

[φ1 (x)][φ2 (y )] = [φ1 (x) ∧ φ2 (y )].

This definition also shows a trivial Fubini theorem for the

counting measure.
 Introduction
to motivic
integration
and some
The universal nature of the
applications

Jorge Cely
counting measure
Motivic
integration
For every finite field Fq we have a counting measure on ring
Cluckers-
Loeser formulas φ 7→ #φ(Fq ), the number of solutions of the formula
approach
in the field Fq .
Transfer
principles in
the Langlands
program What is the relation between these counting measures (for each
q) and the counting measure defined above?

Each formula φ gives a integer-valued function q 7→ #φ(Fq )

defined on the set of prime powers. Let F be the ring of
integer-valued functions on the set of prime powers and
consider F / ∼ where ∼ says that two functions are the same if
they agree almost everywhere.
 Introduction
to motivic
integration
and some
applications

Jorge Cely
Theorem
There exist N : Sring → F / ∼ ring homomorphism
Motivic
integration

Cluckers-
[φ] 7−→ N([φ])
Loeser
approach
where N([φ]) : {p r } → Z is given by
Transfer
principles in
the Langlands
program
q 7→ #φ(Fq )

In other words N respects counting.

The Grothendieck group can be improved here and some
theorems concerning quantifier elimination in pseudo-finite
fields (Fried-Sacerdote) are applied here. This theory is called
arithmetic motivic integration.
 Introduction
to motivic
integration
and some
Locally compact fields
applications

Jorge Cely

Motivic We move from finite fields and counting to locally compact

integration
fields and additive Haar measures.
Cluckers-
Loeser
approach
The idea is to develop a universal (motivic) measure linked to
Transfer
principles in
the Haar measure in a locally compact field but we want to do
the Langlands
program
it in such a way that does not depend on any particular locally
compact field. Formulas in Lring do not capture the extra
structure we need. Any locally compact field is related to either

R, Qp or Fp ((t)). So valued fields are our new objetcs!

Model theoretical question: what is the appropriate language

for study valued fields?
 Introduction
to motivic
integration
and some
Denef-Pas language
applications

Jorge Cely

Motivic
integration The Denef-Pas language is a three-sorted language LDP of the
Cluckers-
Loeser
form
approach

Transfer
principles in
(LVal , LRes , LOrd , ord, ac),
the Langlands
program with sorts for the valued field, the residue field and the value
group and for which we are given an angular component
function ac : K × → k × , where K is the valued field and k is
the residue field, this is a homomorphism that extends the
reduction map on the units. ord : K × → Γ is the valuation
map.
 Introduction
to motivic

integration
and some
The structure k((t)), k, Z
applications

Jorge Cely

Motivic
integration
Let k be a field. The field of formal laurent series k((t)) is a
Cluckers-
Loeser valued field with
approach

Transfer
principles in
ord(p) = N, ac(p) = aN
the Langlands
program P∞
where p = i=N ai t i , N 6= 0.

Then

k((t)), k, Z
is a structure in the Denef-Pas language.
 Introduction
to motivic
integration
and some
QE in the Denef-Pas language
applications

Jorge Cely

Motivic
integration Theorem
Cluckers- If (K , k, Γ) is a Henselian field in the Denef-Pas language with
Loeser
approach char (k) = 0, then Th(K , k, Γ) admits elimination of quantifiers
Transfer in the valued field sort.
principles in
the Langlands
program
This theorem says that we have QE relative to the residue field
and the value group. In other words, in order to have a good
understanding of the definable sets in the valued field we need
to understand the definable sets in the residue field and the
value group.
Good cases, Γ = Z or some elementary equivalent model and k
an algebraically closed field.
 Introduction
to motivic
integration
and some
The setting for Cluecker-Loeser
applications

Jorge Cely
theory
Motivic We will denote by h[m, n, r ] the functor from the category
integration

Cluckers-
Fieldk to the category Sets given by
Loeser
approach
h[m, n, r ](K ) = K ((t))m × K n × Zr ,
Transfer
principles in
the Langlands
program
Given h[m, n, r ], we say that h is a definable subassignment if
there exists a formula φ in the Denef-Pas language with
coefficients in k((t)) and m free variables of the valued field
sort, with coeffients in k and n free variables of the residue field
sort, and r free variables of the value sort, such that for each
K ∈ Fieldk , h(K ) is the definable subset of K ((t))m × K n × Zr
give (or defined) by the formula φ. The definable
subassignments are just the connection (in a uniform way)
between the formulas and their corresponding definable sets.
 Introduction
to motivic
integration
and some
The category Defk
applications

Jorge Cely

Motivic
integration
Let h1 and h2 be two definable subassignments (probably of
Cluckers-
different functors). A morphism between h1 and h2 is a
Loeser
approach
definable subassignment G such that G (K ) is the graph of a
Transfer
function from h1 (K ) to h2 (K ) (note that this is just a definable
principles in
the Langlands
function in the Denef-Pas language between two definable
program sets), for each element in Fieldk .
Defk will denote the category of definable subassignments.
Let S ∈ Defk , we define DefS as the category of all [Y → S]
with Y ∈ Defk . S[m, n, r ] = S × h[m, n, r ]. We denote by
RDefS the category of definable subassignments of S[0, n, 0]
for some n ≥ 1.
 Introduction
to motivic
integration
and some
The ring A
applications

Jorge Cely

Motivic
integration

Cluckers-
Loeser Define    
approach
−1 1
A = Z L, L , ,
Transfer
principles in
1 − L−n n≥0
the Langlands
program where L is a formal symbol. For every q > 1, we have a ring
homomorphism vq : A → R defined by L → 7 q.

Define A+ = {a ∈ A : vq (a) ≥ 0 for all q > 1}

 Introduction
to motivic
integration
and some
Constructible motivic functions
applications

Jorge Cely
Let S be a definable subassignment. The ring of Presburger
Motivic functions on S is denoted by P(S) and is the subring of the
integration
ring of functions to A generated by
Cluckers-
Loeser
approach • Definable functions over S with values in Z.
Transfer
principles in
• Functions of the form Lα(s) , s ∈ S and α a definable
the Langlands
program
function over S with values in Z.
We consider the elements in the Grothendieck ring K0 (RDefS )
as integer valued functions of S:
for [Y → S] ∈ RDefS and x ∈ S(K ) assign to the point the
cardinality of the fiber of Y over x.
Define the ring of constructible motivic functions over S as

C(S) = P(S) ⊗P 0 (S) K0 (RDefS )

 Introduction
to motivic
integration
and some
Integration over Zn
applications

Jorge Cely
We
P say that a family (ai )i≥1 of elements in A is summable if
i |vq (ai )| converges for all q > 1.
Motivic
integration

Cluckers-
Let S be a definable subassignment. We say that φ is
Loeser
approach
S-integrable if for every s ∈ S the family (φ(s, i))i∈Zn is
Transfer
summable. The set of S-integrable functions is denoted by
principles in
the Langlands
IS P(S × Z n )
program
Theorem
There exists a unique homomorphism
µS : IS P(S × Zn ) → P(S) so that for every q > 1, s ∈ S and
φ ∈ IS P(S × Zn )
X
vq (µS (φ(s))) = vq (φ(s, i))
i∈Zn
 Introduction
to motivic
integration
and some
The motivic measure
applications

Jorge Cely

Motivic
integration

Cluckers-
One of the main results is the existence of a motivic measure
Loeser
approach
as a functor (relative to definable subassignments).
Transfer There exists a unique functor Z 7→ IS C+ (Z ) from the category
principles in
the Langlands DefS to the category of abelian semigroups, assigning to every
program
morphism f : Z → Y in DefS a morphism
f! : IS C+ (Z ) → IS C+ (Y ) that satisfies a list of axioms:
naturality, Fubini, disjoint union, projection formula, inclusions,
integration along residue field variables, integration along
Z-variables, volume of balls and graphs.
 Introduction
to motivic
integration
and some
What is the role of model theory?
applications

Jorge Cely

Motivic
integration

Cluckers-
Loeser
approach
• Quantifier elimination / cell decomposition theorems are
Transfer important for the evaluation of the integrals.
principles in
the Langlands
program
• Transfer principles in the spirit of Ax-Kochen-Ershov (Next
slide).
• In both theories, Cluckers-Loeser and
Hrushovski-Kazhdan, definability replaces measure theory.
 Introduction
to motivic
integration
and some
Ax-Kochen-Ershov theorem
applications

Jorge Cely

Motivic
integration
In the middle 60’s, in a series of three papers Diophantine
Cluckers-
problems over local fields I, II, III, Ax-Kochen obtained the first
Loeser
approach
results in the model theory of the p-adic numbers, the next
Transfer theorem is one of their results. Independently Ershov proved
principles in
the Langlands
some of their results.
program
Theorem
Let φ be a sentence in the language of rings. For all but finitely
prime numbers p, φ is true in Fp ((X )) if and only if it is true in
Qp . Moreover, there exists N ∈ N such that for any two local
fields K , K 0 with isomorphic residue fields of characteristic > N
one has that φ is true in K if and only if it is true in K 0 .
 Introduction
to motivic
integration
and some
Ax-Kochen theorem for p-adic
applications

Jorge Cely
integrals
Motivic
integration Let k be a number field with ring of integers O, AO the
Cluckers-
Loeser
collection of all p-adic completion of k and BO the set of all
approach
local fields over O of positive characteristic. LO denotes the
Transfer
principles in usual Denef-Pas language but we allow the elements in O[[t]]
the Langlands
program as parameters in the formulas.
Theorem
Let S, Λ be definable subassignments. Let φ be a function in
IC (S → Λ, LO ). Then there exist N ∈ N such that for all K1 in
AO , K2 in BO with kK1 ∼= kK2 and charkK1 > N

µK1 ,ΛK1 (φK1 ) = 0 if and only if µK2 ,ΛK2 (φK2 ) = 0

 Introduction
to motivic
integration
and some
Orbital Integrals
applications

Jorge Cely

Motivic
integration Let G be a p-adic group and g its Lie algebra, and let X ∈ g.
Cluckers- An orbital integral at X is a distribution on the space of
Loeser
approach Schwartz-Bruhat functions on g defined by
Transfer Z
principles in
the Langlands ΦG (X , f ) = f (g −1 Xg )d ∗ g
program
G /CG (X )

where CG (X ) is the centralizer of X in G and d ∗ g represents

the invariant measure on the quotient.

Question (Hales): can we use motivic integration to compute

the orbital integrals in a p-independent way?
 Introduction
to motivic
integration
and some
Applications
applications

Jorge Cely

Motivic
integration Cluckers, Hales and Loeser proved some identities of orbital
Cluckers- integrals (related with the so-called Fundamental Lemma and
Loeser
approach the Langlands program) using a transfer principle for integrals
Transfer
principles in
with parameters.
the Langlands The main issue is to show definability of all the ingredients
program
involved. The difficulty lies in the space of integration and the
measure in the quotient, these things vary with X .

Recently Gordon, Cluckers and Halupczok have found new

transfer principles (for motivic exponential functions). All of
them have applications to the Langlands program.
 Introduction
to motivic
integration
and some
From Hrushovski-Kazhdan paper...
applications

Jorge Cely

Motivic
integration “Since Weil’s Foundations, algebraic varieties have been
Cluckers- understood independently of a particular base field; thus an
Loeser
approach algebraic group G exists prior to the abstract or topological
Transfer
principles in
groups of points G(F), taken over various fields F. For Hecke
the Langlands algebras, or other geometric objects whose definition requires
program
integration, no comparable viewpoint exists. One uses the
topology and measure theory of each local field separately;
since a field F has measure zero from the point of view of any
nontrivial finite extension, at the foundational level there is no
direct connection between the objects obtained over different
fields. The main thrust of this paper is the development of a
theory of integration over valued fields, which is geometric in
the sense of Weil.”