Don't worry, no danger ahead! — This is just a short post about the German mathematician Ewald Warning and the theorems that bear his name.
It seems that Ewald Warning's name will be forever linked with that of Chevalley, for the Chevalley-Warning theorem is one of the rare modern results that can be taught to undergraduate students; in France, it is especially famous at the Agrégation level. (Warning published a second paper, in 1959, about the axioms of plane geometry.)
Warning's paper, Bemerkung zur vorstehenden Arbeit von Herrn Chevalley (About a previous work of Mr Chevalley), has been published in 1935 in the Publications of the mathematical seminar of Hamburg University (Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg), just after the mentioned paper of Chevalley. Emil Artin had a position in Hamburg at that time, which probably made the seminar very attractive; as a matter of fact, the same 1935 volume features a paper of Weil about Riemann-Roch, one of Burau about braids, one of Élie Cartan about homogeneous spaces, one of Santalo on geometric measure theory, etc.
1. The classic statement of the Chevalley—Warning theorem is the following.
Theorem 1. – Let be a prime number, let be a power of and let be a field with elements. Let be polynomials in variables and coefficients in , of degrees ; let . Let be their zero-set in . If , then divides .
This is really a theorem of Warning, and Chevalley's theorem was the weaker consequence that if , then contains at least two points. (In fact, Chevalley only considers the case , but his proof extends readily.) The motivation of Chevalley lied in the possibility to apply this remark to the reduced norm of a possibly noncommutative finite field (a polynomial of degree in variables which vanishes exactly at the origin), thus providing a proof of Wedderburn's theorem.
a) Chevalley's proof begins with a remark. For any polynomial , let be the polynomial obtained by replacing iteratively by in , until the degree of in each variable is . For all , one has ; moreover, using the fact that a polynomial in one variable of degree has at most roots, one proves that if for all , then .
Assume now that contains exactly one point, say , let , let . Both polynomials take the value at , and elsewhere; moreover, is reduced. Consequently, . Then
contradicting the hypothesis that .
b) Warning's proof is genuinely different. He first defines, for any subset of a reduced polynomial , and observes that if , and otherwise.
Take , so that . Using that and the expansion
, Warning derives from the equality
the relations
for all such that and . The particular case implies that divides . More generally:
Proposition 2. — For every polynomial of reduced degree , one has .
c) The classic proof of that result is even easier. Let us recall it swiftly. First of all, for every integer such that , one has . This can be proved in many ways, for example by using the fact that the multiplicative group of is cyclic; on the other hand, for every nonzero element of , the change of variables leaves this sum both unchanged and multiplied by so that taking such that , one sees that this sum vanishes. It follows from that that for every polynomial whose degree in some variable is , one has . This holds in particular if the total degree of is .
Taking as above proves theorem 1.
2. On the other hand there is a second Warning theorem, which seems to be absolutely neglected in France. It says the following:
Theorem 3. — Keep the same notation as in theorem 1. If is nonempty, then .
To prove this result, Warning starts from the following proposition:
Proposition 4. – Let be two parallel subspaces of dimension in . Then and are congruent modulo .
Let . Up to a change of coordinates, one may assume that and . Let
This is a polynomial of total degree is . For , one has if , if , and otherwise. Proposition 4 thus follows from proposition 2. It is now very easy to prove theorem 3 in the particular case where there exists one subspace of dimension such that . Indeed, by proposition 4, the same congruence will hold for every translate of . In particular, for every translate of , and there are distinct translates.
To prove the general case, let us choose a subspace of of dimension such that , and let us assume that is maximal.
Assume that . Let be the integer such that . For every -dimensional subspace of that contains , one has , by maximaility of , so that contains at least points. Since these subspaces are in 1-1 correspondence with the lines of the quotient space , their number is equal to . Consequently,
as was to be shown.
3. Classic theorems seem to an everlasting source of food for thought.
a) In 1999, Alon observed that Chevalley's theorem follows from the Combinatorial Nullstellensatz he had just proved. On the other hand, this approach allowed Brink (2011) to prove a similar result in general fields , but restricting the roots to belong to a product set , where are finite subsets of of cardinality . See that paper of Clarke, Forrow and Schmitt for further developments, in particular a version of Warning's second theorem.
b) In the case of hypersurfaces (with the notation of theorem 1, ), Ax proved in 1964 that the cardinality of is divisible not only by , but by . This led to renewed interest in the following years, especially in the works of Katz, Esnault, Berthelot, and the well has not dried up yet.
c) In 2011, Heath-Brown published a paper where he uses Ax's result to strengthen the congruence modulo of proposition 4 to a congruence modulo .
d) By a Weil restriction argument, a 1995 paper of Moreno-Moreno partially deduces the Chevalley-Warning theorem over a field of cardinality from its particular case over the prime field. I write partially because they obtain a divisibility by an expression of the form , while one expects . However, the same argument allows them to obtain a stronger bound which does not involve not the degrees of the polynomials, but the -weights of these degrees, that is the sum of their digits in their base expansions. Again, they obtain a divisibility by an expression of the form , and it is a natural question to wonder whether the divisibility by can be proved.
Wednesday, March 22, 2017
Sunday, February 5, 2017
Counting points and counting curves on varieties — Tribute to Daniel Perrin
Libellés :
agrégation
,
algebraic geometry
,
motivic integration
,
number theory
,
Poisson summation formula
$\require{enclose}\def\VarC{\mathrm{Var}_{\mathbf C}}\def\KVarC{K_0\VarC}$
Daniel Perrin is a French algebraic geometer who turned 70 last year. He his also well known in France for his wonderful teaching habilities. He was one of the cornerstones of the former École normale supérieure de jeunes filles, before it merged in 1985 with the rue d'Ulm school. From this time remains a Cours d'algèbre which is a must for all the students (and their teachers) who prepare the agrégation, the highest recruitment process for French high schools. He actually taught me Galois theory (at École normale supérieure in 1990/1991) and Algebraic Geometry (the year after, at Orsay). His teaching restlessly stresses the importance of examples. He has also been deeply involved in training future primary school teachers, as well as in devising the mathematical curriculum of high school students: he was responsible of the report on geometry. It has been a great honor for me to be invited to lecture during the celebration of his achievements that took place at Orsay on November, 23, 2016.
Diophantine equations are a source of numerous arithmetic problems. One of them has been put forward by Manin in the 80s and consists in studying the behavior of the number of solutions of such equations of given size, when the bound grows to infinity. A geometric analogue of this question considers the space of all curves with given degree which are drawn on a fixed complex projective, and is interested in their behavior when the degree tends to infinity. This was the topic of my lecture and is the subject of this post.
Let us first begin with an old problem, apparently studied by Dirichlet around 1840, and given a rigorous solution by Chebyshev and Cesáro around 1880: the probability that two integers be coprime is equal to 6/π2. Of course, there is no probability on the integers that has the properties one would expect, such as being invariant by translation, and the classical formalization of this problem states that the numbers of pairs (a,b) of integers such that 1≤a,b≤n and gcd(a,b)=1 grows as n2⋅6/π2 when n→+∞,
This can be proved relatively easily, for example as follows. Without the coprimality condition, there are n2 such integers. Now one needs to remove those pairs both of which entries are multiples of 2, and there are ⌊n/2⌋2 of those, those where a,b are both multiples of 3 (⌊n/3⌋2), and then comes 5, because we have already removed those even pairs, etc. for all prime numbers. But in this process, we have removed twice the pairs of integers both of which entries are multiples of 2⋅3=6, so we have to add them back, and then remove the pairs of integers both of which are multiples of 2⋅3⋅5, etc. This leads to the following formula for
the cardinality C(n) we are interested in:
$\displaystyle
C(n) = n^2 - \lfloor\frac n2\rfloor^2 - \lfloor \frac n3\rfloor^2-\lfloor \frac n5\rfloor^2 - \dots
+ \lfloor \frac n{2\cdot 3}\rfloor^2+\lfloor\frac n{2\cdot 5}\rfloor^2+\dots
- \lfloor \frac n{2\cdot 3\cdot 5} \rfloor^2 - \dots $.
Approximating ⌊n/a⌋ by n/a, this becomes
$\displaystyle
C(n) \approx n^2 - \left(\frac n2\right)-^2 - \left (\frac n3\right)^2-\left( \frac n5\rfloor\right)^2 - \dots
+ \left (\frac n{2\cdot 3}\right)^2+\left(\frac n{2\cdot 5}\right)^2+\dots
- \left (\frac n{2\cdot 3\cdot 5} \right)^2 - \dots $
which we recognize as
$\displaystyle
C(n)\approx n^2 \left(1-\frac1{2^2}\right) \left(1-\frac1{3^2}\right)\left(1-\frac1{5^2}\right) \dots
=n^2/\zeta(2)$,
where ζ(2) is the value at s=2 of Riemann's zeta function ζ(s). Now, Euler had revealed the truly arithmetic nature of π by proving in 1734 that ζ(2)=π2/6. The approximations we made in this calculation can be justified, and this furnishes a proof of the above claim.
We can put this question about integers in a broader perspective if we recall that the ring Z is a principal ideal domain (PID) and study the analogue of our problem in other PIDs, in particular for F[T], where F is a finite field; set q=Card(F). The above proof can be adapted easily (with simplifications, in fact) and shows that number of pairs (A,B) of monic polynomials of degrees ≤n such that gcd(A,B)=1 grows as qn(1−1/q) when n→+∞. The analogy becomes stronger if one observes that 1/(1−1/q) is the value at s=2 of 1/(1−q1−s), the Hasse-Weil zeta function of the affine line over F.
What can we say about our initial question if we replace the ring Z with the PID C[T]? Of course, there's no point in counting the set of pairs (A,B) of coprime monic polynomials of degree ≤n in C[T], because this set is infinite. Can we, however, describe this set? For simplicity, we will consider here the set Vn of pairs of coprime monic polynomials of degree precisely n. If we identify a monic polynomial of degree n with the sequence of its coefficients, we then view Vn as a subset of Cn×Cn. We first observe that Vn is an Zariski open subset of C2n: its complement Wn is defined by the vanishing of a polynomial in 2n variables — the resultant of A and B.
When n=0, we have V0=C0={pt}.
Let's look at n=1: the polynomials A=T+a and B=T+b are coprime if and only if a=b;
consequently, V1 is the complement of the diagonal in C2.
For n=2, this becomes more complicated: the resultant of the polynomials T2+aT+b and T2+cT+d is equal to a2d−abc−adc+b2−2bd+bc2+d2; however, it looks hard to guess some relevant properties of Vn (or of its complement) just by staring at this equation. In any case, we can say that V2 is the complement in C4 of the union of two sets, corresponding of the degree of the gcd of (A,B). When gcd(A,B)=2, one has A=B; this gives the diagonal, a subset of C4 isomorphic to C2; the set of pairs of polynomials (A,B) whose gcd has degree 1 is essentially C×V1: multiply a pair (A1,B1) of coprime polynomials of degree 1 by an arbitrary polynomial of the form (T−d).
Consequently,
\begin{align}V_2&=\mathbf C^4 - \left( \mathbf C^2 \cup \mathbf C\times V_1\right)\\
&= \mathbf C^4 - \left( \enclose{updiagonalstrike}{\mathbf C^2}\cup \left(\mathbf C\times (\mathbf C^2-\enclose{updiagonalstrike}{\mathbf C})\right)\right)\\
&=\mathbf C^4-\mathbf C^3
\end{align}
if we cancel the two C2 that appear. Except that this makes no sense!
However, there is a way to make this computation both meaningful and rigorous, and it consists in working in the Grothendieck ring $\KVarC$ of complex algebraic varieties. Its additive group is generated by isomorphism classes of algebraic varieties, with relations of the form [X]=[U]+[Z] for every Zariski closed subset Z of an algebraic variety X, with complement U=X−Z. This group has a natural ring structure for which [X][Y]=[X×Y]. Its unit element is the class of the point, [A0] if one wishes. An important element of this ring $\KVarC$ is the class L=[A1] of the affine line. The natural map $e\colon \VarC\to \KVarC$ given by e(X)=[X] is the universal Euler characteristic: it is the universal map from $\VarC$ to a ring such that e(X)=e(X−Z)+e(Z) and e(X×Y)=e(X)e(Y), where X,Y are complex varieties and Z is a Zariski closed subset of X.
In particular, it generalizes the classical Euler characteristic, the alternate sum of the dimensions of the cohomology groups (with compact support, if one wishes) of a variety. A subtler invariant of $\KVarC$ is given by mixed Hodge theory: there exists a unique ring morphism $\chi_{\mathrm H}\KVarC\to\mathbf Z[u,v]$ such that for every complex variety X, χH([X]) is the Hodge-Deligne polynomial of X. In particular, if X is projective and smooth, χH([X])=supp,qdimhq(X,ΩXp)upvq. If one replaces the field of complex numbers with a finite field F, one may actually count the numbers of F-points of X, and this furnishes yet another generalized Euler characteristic.
The preceding calculation shows that e(V0)=1, e(V1)=L2−L and e(V2)=L4−L3; more generally, one proves by induction that e(Vn)=L2n−L2n−1 for every integer n≥0.
Equivalently, one has e(Wn)=L2n−1 for all n. I have to admit that I see no obvious reason for the class of Wn to be equal to that of an affine space. However, as Ofer Gabber and Jean-Louis Colliot-Thélène pointed out to me during the talk, this resultant is the difference of two homogeneous polynomials p−q of degrees d=2 and d+1=3; consequently, the locus it defines is a rational variety — given a,b,c, there is generically a unique t such that p−q vanishes at (at,bt,ct,t).
These three results have a common interpretation if one brings in the projective line P1. Indeed, pairs (a,b) of coprime integers (up to ±1) correspond to rational points on P1, and if F is a field, then pairs (A,B) of coprime polynomials in F[T] correspond (up to F×) to elements of P1(F(T)).
In both examples, the numerical datum max(∣a∣,∣b∣) or max(deg(A),deg(B)) is called the height of the corresponding point.
In the case of the ring Z, or in the case of the ring F[T] where F is a finite field, one has an obvious but fundamental finiteness theorem: there are only finitely many points of P1 with bounded height. In the latter case, C[T], this naïve finiteness does not hold. Nevertheless, if one sees P1(C(T)) as an infinite dimensional variety — one needs infinitely many complex numbers to describe a rational function, then the points of bounded height constitute what is called a bounded family, a “finite dimensional” constructible set.
The last two examples have a common geometric interpretation. Namely, F(T) is the field of functions of a projective smooth algebraic curve C over F; in fact, C is the projective line again, but we may better ignore this coincidence. Then a point x∈P1(F(T))
corresponds to a morphism εx:C→P1, and the formula H(x)=deg(ϵx∗O(1)) relates the height H(x) of x to the degree of the morphism εx.
Since the notion of height generalizes from P1 to projective spaces Pn of higher dimension (and from Q to general number fields), this suggests a general question. Let V⊂Pn be a projective variety over a base field k hat can one say about the set of points x∈V(k) such that H(x)≤B, when the bound B grows to ∞?
The base field k can be either a number field, or the field of functions F(C) of a curve C over a finite field F, or the field of functions C(C) of a curve over the complex numbers. In the last two cases, the variety can even be taken to be constant, deduced from a variety V0 over F or C.
In a forthcoming post, I shall recall some results on these questions, especially the first one, and in particular explain an approach based on the Fourier summation formula. I will then explain a theorem proved with François Loeser where we make use of Hrushovski–Kazhdan's motivic Fourier summation formula in motivic integration to prove an instance of the third question.

Diophantine equations are a source of numerous arithmetic problems. One of them has been put forward by Manin in the 80s and consists in studying the behavior of the number of solutions of such equations of given size, when the bound grows to infinity. A geometric analogue of this question considers the space of all curves with given degree which are drawn on a fixed complex projective, and is interested in their behavior when the degree tends to infinity. This was the topic of my lecture and is the subject of this post.
Let us first begin with an old problem, apparently studied by Dirichlet around 1840, and given a rigorous solution by Chebyshev and Cesáro around 1880: the probability that two integers be coprime is equal to 6/π2. Of course, there is no probability on the integers that has the properties one would expect, such as being invariant by translation, and the classical formalization of this problem states that the numbers of pairs (a,b) of integers such that 1≤a,b≤n and gcd(a,b)=1 grows as n2⋅6/π2 when n→+∞,
This can be proved relatively easily, for example as follows. Without the coprimality condition, there are n2 such integers. Now one needs to remove those pairs both of which entries are multiples of 2, and there are ⌊n/2⌋2 of those, those where a,b are both multiples of 3 (⌊n/3⌋2), and then comes 5, because we have already removed those even pairs, etc. for all prime numbers. But in this process, we have removed twice the pairs of integers both of which entries are multiples of 2⋅3=6, so we have to add them back, and then remove the pairs of integers both of which are multiples of 2⋅3⋅5, etc. This leads to the following formula for
the cardinality C(n) we are interested in:
$\displaystyle
C(n) = n^2 - \lfloor\frac n2\rfloor^2 - \lfloor \frac n3\rfloor^2-\lfloor \frac n5\rfloor^2 - \dots
+ \lfloor \frac n{2\cdot 3}\rfloor^2+\lfloor\frac n{2\cdot 5}\rfloor^2+\dots
- \lfloor \frac n{2\cdot 3\cdot 5} \rfloor^2 - \dots $.
Approximating ⌊n/a⌋ by n/a, this becomes
$\displaystyle
C(n) \approx n^2 - \left(\frac n2\right)-^2 - \left (\frac n3\right)^2-\left( \frac n5\rfloor\right)^2 - \dots
+ \left (\frac n{2\cdot 3}\right)^2+\left(\frac n{2\cdot 5}\right)^2+\dots
- \left (\frac n{2\cdot 3\cdot 5} \right)^2 - \dots $
which we recognize as
$\displaystyle
C(n)\approx n^2 \left(1-\frac1{2^2}\right) \left(1-\frac1{3^2}\right)\left(1-\frac1{5^2}\right) \dots
=n^2/\zeta(2)$,
where ζ(2) is the value at s=2 of Riemann's zeta function ζ(s). Now, Euler had revealed the truly arithmetic nature of π by proving in 1734 that ζ(2)=π2/6. The approximations we made in this calculation can be justified, and this furnishes a proof of the above claim.
We can put this question about integers in a broader perspective if we recall that the ring Z is a principal ideal domain (PID) and study the analogue of our problem in other PIDs, in particular for F[T], where F is a finite field; set q=Card(F). The above proof can be adapted easily (with simplifications, in fact) and shows that number of pairs (A,B) of monic polynomials of degrees ≤n such that gcd(A,B)=1 grows as qn(1−1/q) when n→+∞. The analogy becomes stronger if one observes that 1/(1−1/q) is the value at s=2 of 1/(1−q1−s), the Hasse-Weil zeta function of the affine line over F.
What can we say about our initial question if we replace the ring Z with the PID C[T]? Of course, there's no point in counting the set of pairs (A,B) of coprime monic polynomials of degree ≤n in C[T], because this set is infinite. Can we, however, describe this set? For simplicity, we will consider here the set Vn of pairs of coprime monic polynomials of degree precisely n. If we identify a monic polynomial of degree n with the sequence of its coefficients, we then view Vn as a subset of Cn×Cn. We first observe that Vn is an Zariski open subset of C2n: its complement Wn is defined by the vanishing of a polynomial in 2n variables — the resultant of A and B.
When n=0, we have V0=C0={pt}.
Let's look at n=1: the polynomials A=T+a and B=T+b are coprime if and only if a=b;
consequently, V1 is the complement of the diagonal in C2.
For n=2, this becomes more complicated: the resultant of the polynomials T2+aT+b and T2+cT+d is equal to a2d−abc−adc+b2−2bd+bc2+d2; however, it looks hard to guess some relevant properties of Vn (or of its complement) just by staring at this equation. In any case, we can say that V2 is the complement in C4 of the union of two sets, corresponding of the degree of the gcd of (A,B). When gcd(A,B)=2, one has A=B; this gives the diagonal, a subset of C4 isomorphic to C2; the set of pairs of polynomials (A,B) whose gcd has degree 1 is essentially C×V1: multiply a pair (A1,B1) of coprime polynomials of degree 1 by an arbitrary polynomial of the form (T−d).
Consequently,
\begin{align}V_2&=\mathbf C^4 - \left( \mathbf C^2 \cup \mathbf C\times V_1\right)\\
&= \mathbf C^4 - \left( \enclose{updiagonalstrike}{\mathbf C^2}\cup \left(\mathbf C\times (\mathbf C^2-\enclose{updiagonalstrike}{\mathbf C})\right)\right)\\
&=\mathbf C^4-\mathbf C^3
\end{align}
if we cancel the two C2 that appear. Except that this makes no sense!
However, there is a way to make this computation both meaningful and rigorous, and it consists in working in the Grothendieck ring $\KVarC$ of complex algebraic varieties. Its additive group is generated by isomorphism classes of algebraic varieties, with relations of the form [X]=[U]+[Z] for every Zariski closed subset Z of an algebraic variety X, with complement U=X−Z. This group has a natural ring structure for which [X][Y]=[X×Y]. Its unit element is the class of the point, [A0] if one wishes. An important element of this ring $\KVarC$ is the class L=[A1] of the affine line. The natural map $e\colon \VarC\to \KVarC$ given by e(X)=[X] is the universal Euler characteristic: it is the universal map from $\VarC$ to a ring such that e(X)=e(X−Z)+e(Z) and e(X×Y)=e(X)e(Y), where X,Y are complex varieties and Z is a Zariski closed subset of X.
In particular, it generalizes the classical Euler characteristic, the alternate sum of the dimensions of the cohomology groups (with compact support, if one wishes) of a variety. A subtler invariant of $\KVarC$ is given by mixed Hodge theory: there exists a unique ring morphism $\chi_{\mathrm H}\KVarC\to\mathbf Z[u,v]$ such that for every complex variety X, χH([X]) is the Hodge-Deligne polynomial of X. In particular, if X is projective and smooth, χH([X])=supp,qdimhq(X,ΩXp)upvq. If one replaces the field of complex numbers with a finite field F, one may actually count the numbers of F-points of X, and this furnishes yet another generalized Euler characteristic.
The preceding calculation shows that e(V0)=1, e(V1)=L2−L and e(V2)=L4−L3; more generally, one proves by induction that e(Vn)=L2n−L2n−1 for every integer n≥0.
Equivalently, one has e(Wn)=L2n−1 for all n. I have to admit that I see no obvious reason for the class of Wn to be equal to that of an affine space. However, as Ofer Gabber and Jean-Louis Colliot-Thélène pointed out to me during the talk, this resultant is the difference of two homogeneous polynomials p−q of degrees d=2 and d+1=3; consequently, the locus it defines is a rational variety — given a,b,c, there is generically a unique t such that p−q vanishes at (at,bt,ct,t).
These three results have a common interpretation if one brings in the projective line P1. Indeed, pairs (a,b) of coprime integers (up to ±1) correspond to rational points on P1, and if F is a field, then pairs (A,B) of coprime polynomials in F[T] correspond (up to F×) to elements of P1(F(T)).
In both examples, the numerical datum max(∣a∣,∣b∣) or max(deg(A),deg(B)) is called the height of the corresponding point.
In the case of the ring Z, or in the case of the ring F[T] where F is a finite field, one has an obvious but fundamental finiteness theorem: there are only finitely many points of P1 with bounded height. In the latter case, C[T], this naïve finiteness does not hold. Nevertheless, if one sees P1(C(T)) as an infinite dimensional variety — one needs infinitely many complex numbers to describe a rational function, then the points of bounded height constitute what is called a bounded family, a “finite dimensional” constructible set.
The last two examples have a common geometric interpretation. Namely, F(T) is the field of functions of a projective smooth algebraic curve C over F; in fact, C is the projective line again, but we may better ignore this coincidence. Then a point x∈P1(F(T))
corresponds to a morphism εx:C→P1, and the formula H(x)=deg(ϵx∗O(1)) relates the height H(x) of x to the degree of the morphism εx.
Since the notion of height generalizes from P1 to projective spaces Pn of higher dimension (and from Q to general number fields), this suggests a general question. Let V⊂Pn be a projective variety over a base field k hat can one say about the set of points x∈V(k) such that H(x)≤B, when the bound B grows to ∞?
The base field k can be either a number field, or the field of functions F(C) of a curve C over a finite field F, or the field of functions C(C) of a curve over the complex numbers. In the last two cases, the variety can even be taken to be constant, deduced from a variety V0 over F or C.
- When k is a number field, this set is a finite set; how does its cardinality grows? This is a question that Batyrev and Manin have put forward at the end of the 80s, and which has attracted a lot of attention since.
- When k=F(C) is a function field over a finite field, this set is again a finite set; how does its cardinality grows? This question has been proposed by Emmanuel Peyre by analogy with the question of Batyrev and Manin.
- When k=C(C) is a function field over C, this set identifies with a closed subscheme of the Grothendieck-Hilbert scheme of V; what can one say about its geometry, in particular about its class in $\KVarC$? Again, this question has been proposed by Emmanuel Peyre around 2000.
In a forthcoming post, I shall recall some results on these questions, especially the first one, and in particular explain an approach based on the Fourier summation formula. I will then explain a theorem proved with François Loeser where we make use of Hrushovski–Kazhdan's motivic Fourier summation formula in motivic integration to prove an instance of the third question.
Monday, January 9, 2017
“May you and all your students flourish.”
Francis Su was the former president of the Mathematical Association of America. He just gave a beautiful address at the AMS-MAA Joint Meeting, entitled “Mathematics for Human Flourishing”.
Basically, when asked about the goal of mathematics, the answer is often related to its contribution to the progress of mankind through the advancement of science. Francis Su explicits what the deepest goal of mathematics may be: contribute to the flourishing not only of mankind as a whole, but of each of us as human beings. Starting from Aristotle's view that a well-lived life goes through the exercise of “virtue” — excellence of character leading to the excellence of conduct. He then quotes five basic desires which mathematics help fulfill while cultivating such virtues: play, beauty, truth, justice and love.
Francis Su's address is full of personal stories, encounters, and quotes, and I invite all of you either to watch the video on the Facebook page of the MAA, or to read its transcript on Francis Su's blog.
On the beginning of this New Year, I would just like to conclude this short message by repeating his
final wish: ”May you and all your students flourish!”
Basically, when asked about the goal of mathematics, the answer is often related to its contribution to the progress of mankind through the advancement of science. Francis Su explicits what the deepest goal of mathematics may be: contribute to the flourishing not only of mankind as a whole, but of each of us as human beings. Starting from Aristotle's view that a well-lived life goes through the exercise of “virtue” — excellence of character leading to the excellence of conduct. He then quotes five basic desires which mathematics help fulfill while cultivating such virtues: play, beauty, truth, justice and love.
Francis Su's address is full of personal stories, encounters, and quotes, and I invite all of you either to watch the video on the Facebook page of the MAA, or to read its transcript on Francis Su's blog.
On the beginning of this New Year, I would just like to conclude this short message by repeating his
final wish: ”May you and all your students flourish!”
Subscribe to:
Posts
(
Atom
)