• No results found

Continuity of homology and K-theory

N/A
N/A
Protected

Academic year: 2022

Share "Continuity of homology and K-theory"

Copied!
79
0
0

Laster.... (Se fulltekst nå)

Fulltekst

(1)

Continuity of homology and K-theory

Bjørn Ian Dundas

NMF100. September 14, 2018, Bergen

(2)

The goal of today’s talk/Disclaimer

The aim of today’s talk is to give enough background to appreciate:

Theorem [Clausen, Mathew, Morrow, 2018]Let p be a prime, A a noetherian (commutative) ring and I⊆A an ideal.

If A/p is “F-finite”1then

K(lim

n A/In)→lim

n K(A/In) is a p-adic equivalence.

A great theorem is like an arch or a bridge spanning a chasm. The arch depends on its keystone, but also the voussoirs: if one is missing the arch will fall.

You’ll pardon me for pointing to my voussoirs

1my friends in algebraic geometry tell me that this is an innocent assumption:

it means thatA/pis finitely generated over itspth powers.

(3)

K-theory

I one of the crowning achievements of the last century.

I an invariant encapsulating an enormous amount of information and was both a key structural framework and a spawning ground for a wide array of conjectures by many of the most prominent mathematicians (Grothendieck, Tate, Deligne, Borel, Quillen, Bott, Atiyah, Beilinson, Lichtenbaum, Milnor, Waldhausen, Friedlander, Serre, Suslin . . . )

I Early on, algebraic geometry and number theory were the central playgrounds, but K-theory quickly spread to manifold geometry, algebraic topology, functional analysis and mathematical physics.

I Unfortunately, not until around the turn of the millennium were we able to actually calculatemuch.2

I New tools: the trace methods of B¨okstedt, Hsiang and Madsen and the motivic cohomology of Suslin and Voevodsky.

I Since then a wealth of calculations has flowed from the hands of among others B¨okstedt, Geisser, Hesselholt, Madsen, Østvær, Rognes, Weibel . . .

2

(4)

K-theory

I one of the crowning achievements of the last century.

I an invariant encapsulating an enormous amount of information and was both a key structural framework and a spawning ground for a wide array of conjectures by many of the most prominent mathematicians (Grothendieck, Tate, Deligne, Borel, Quillen, Bott, Atiyah, Beilinson, Lichtenbaum, Milnor, Waldhausen, Friedlander, Serre, Suslin . . . )

I Early on, algebraic geometry and number theory were the central playgrounds, but K-theory quickly spread to manifold geometry, algebraic topology, functional analysis and mathematical physics.

I Unfortunately, not until around the turn of the millennium were we able to actually calculatemuch.2

I New tools: the trace methods of B¨okstedt, Hsiang and Madsen and the motivic cohomology of Suslin and Voevodsky.

I Since then a wealth of calculations has flowed from the hands of among others B¨okstedt, Geisser, Hesselholt, Madsen, Østvær, Rognes, Weibel . . .

2

(5)

K-theory

I one of the crowning achievements of the last century.

I an invariant encapsulating an enormous amount of information and was both a key structural framework and a spawning ground for a wide array of conjectures by many of the most prominent mathematicians (Grothendieck, Tate, Deligne, Borel, Quillen, Bott, Atiyah, Beilinson, Lichtenbaum, Milnor, Waldhausen, Friedlander, Serre, Suslin . . . )

I Early on, algebraic geometry and number theory were the central playgrounds, but K-theory quickly spread to manifold geometry, algebraic topology, functional analysis and mathematical physics.

I Unfortunately, not until around the turn of the millennium were we able to actually calculatemuch.2

I New tools: the trace methods of B¨okstedt, Hsiang and Madsen and the motivic cohomology of Suslin and Voevodsky.

I Since then a wealth of calculations has flowed from the hands of among others B¨okstedt, Geisser, Hesselholt, Madsen, Østvær, Rognes, Weibel . . .

2

(6)

K-theory

I one of the crowning achievements of the last century.

I an invariant encapsulating an enormous amount of information and was both a key structural framework and a spawning ground for a wide array of conjectures by many of the most prominent mathematicians (Grothendieck, Tate, Deligne, Borel, Quillen, Bott, Atiyah, Beilinson, Lichtenbaum, Milnor, Waldhausen, Friedlander, Serre, Suslin . . . )

I Early on, algebraic geometry and number theory were the central playgrounds, but K-theory quickly spread to manifold geometry, algebraic topology, functional analysis and mathematical physics.

I Unfortunately, not until around the turn of the millennium were we able to actually calculatemuch.2

I New tools: the trace methods of B¨okstedt, Hsiang and Madsen and the motivic cohomology of Suslin and Voevodsky.

I Since then a wealth of calculations has flowed from the hands of among others B¨okstedt, Geisser, Hesselholt, Madsen, Østvær, Rognes, Weibel . . .

2Some isolated fantastic results existed, e.g., Quillen, Borel, Suslin

(7)

K-theory

I one of the crowning achievements of the last century.

I an invariant encapsulating an enormous amount of information and was both a key structural framework and a spawning ground for a wide array of conjectures by many of the most prominent mathematicians (Grothendieck, Tate, Deligne, Borel, Quillen, Bott, Atiyah, Beilinson, Lichtenbaum, Milnor, Waldhausen, Friedlander, Serre, Suslin . . . )

I Early on, algebraic geometry and number theory were the central playgrounds, but K-theory quickly spread to manifold geometry, algebraic topology, functional analysis and mathematical physics.

I Unfortunately, not until around the turn of the millennium were we able to actually calculatemuch.2

I New tools: the trace methods of B¨okstedt, Hsiang and Madsen and the motivic cohomology of Suslin and Voevodsky.

I Since then a wealth of calculations has flowed from the hands of among others B¨okstedt, Geisser, Hesselholt, Madsen, Østvær, Rognes, Weibel . . .

2

(8)

Continuity

For a functionf:

n→∞lim f(xn) =f( lim

n→∞xn)

“f commutes with taking the limit over a (convergent) sequence of numbers”

Questions

1. What should “continuity” mean for invariants?

2. What should “(convergent) sequence” mean?

(9)

A concrete example of a “sequence” converging to the power series

Consider the ringA[[t]] of power series

a0+a1t+a2t2+. . .

with coefficients in a ringA(you may takeAto be the integersZas an example).

A power series is uniquely given by its sequence oftruncatedpolynomials a0, a0+a1t, a0+a1t+a2t2, . . . ,

so, if we let A[[t]]/(tn) be the ring of truncated polynomials,3we see that we have ring homomorphisms

· · · →A[[t]]/(t3)→A[[t]]/(t2)→A[[t]]/(t) =A (chop off the highest degree) andA[[t]] = limn(A[[t]]/(tn)) is thelimit.

3careful: if you multiply two truncated polynomials, all resulting powerstmformnare set to zero

(10)

A concrete example of a “sequence” converging to the power series

Consider the ringA[[t]] of power series

a0+a1t+a2t2+. . .

with coefficients in a ringA(you may takeAto be the integersZas an example).

A power series is uniquely given by its sequence oftruncatedpolynomials a0, a0+a1t, a0+a1t+a2t2, . . . ,

so, if we let A[[t]]/(tn) be the ring of truncated polynomials,3we see that we have ring homomorphisms

· · · →A[[t]]/(t3)→A[[t]]/(t2)→A[[t]]/(t) =A (chop off the highest degree) andA[[t]] = limn(A[[t]]/(tn)) is thelimit.

3careful: if you multiply two truncated polynomials, all resulting powerstmformnare set to zero

(11)

A concrete example of a “sequence” converging to the power series

Consider the ringA[[t]] of power series

a0+a1t+a2t2+. . .

with coefficients in a ringA(you may takeAto be the integersZas an example).

A power series is uniquely given by its sequence oftruncatedpolynomials a0, a0+a1t, a0+a1t+a2t2, . . . ,

so, if we let A[[t]]/(tn) be the ring of truncated polynomials,3we see that we have ring homomorphisms

· · · →A[[t]]/(t3)→A[[t]]/(t2)→A[[t]]/(t) =A (chop off the highest degree) andA[[t]] = limn(A[[t]]/(tn)) is thelimit.

3careful: if you multiply two truncated polynomials, all resulting powerstmformnare set to zero

(12)

Question: What about invertible elements?

(an example of an “invariant”)

ExampleInA[[t]]/(t2)

(a0+a1t)(b0+b1t) =a0b0+ (a0b1+a1b0)t, so ifa0is invertible, then (a0+a1t)(a1

0aa1

0t) = 1.

In general, a truncated polynomial is invertible iff the constant term is invertible.

The same argument goes for power series: a0+a1t+. . . is invertible iff a0is invertible, or in other words, a unit4in A[[t]] is uniquely given by a sequence{a0+a1t+. . .antn}n of invertible truncated polynomials

the units in A[[t]]is the limit of the units in the truncated polynomial rings:

units(A[[t]]) =units(lim

n A[[t]]/(tn)) = lim

n units(A[[t]]/(tn)).

units(A) is aninvariant5 in the ringA. The above is an instance of the fact that units (A) is a continuousinvariant.

4“the units”= “the (group of) invertible elements”

5if I replaceAby something isomorphic, units(A) is replaced by something isomorphic. . .

(13)

Question: What about invertible elements?

(an example of an “invariant”)

ExampleInA[[t]]/(t2)

(a0+a1t)(b0+b1t) =a0b0+ (a0b1+a1b0)t, so ifa0is invertible, then (a0+a1t)(a1

0aa1

0t) = 1.

In general, a truncated polynomial is invertible iff the constant term is invertible.

The same argument goes for power series: a0+a1t+. . . is invertible iff a0is invertible, or in other words, a unit4in A[[t]] is uniquely given by a sequence{a0+a1t+. . .antn}n of invertible truncated polynomials

the units in A[[t]]is the limit of the units in the truncated polynomial rings:

units(A[[t]]) =units(lim

n A[[t]]/(tn)) = lim

n units(A[[t]]/(tn)).

units(A) is aninvariant5 in the ringA. The above is an instance of the fact that units (A) is a continuousinvariant.

4“the units”= “the (group of) invertible elements”

5if I replaceAby something isomorphic, units(A) is replaced by something isomorphic. . .

(14)

Question: What about invertible elements?

(an example of an “invariant”)

ExampleInA[[t]]/(t2)

(a0+a1t)(b0+b1t) =a0b0+ (a0b1+a1b0)t, so ifa0is invertible, then (a0+a1t)(a1

0aa1

0t) = 1.

In general, a truncated polynomial is invertible iff the constant term is invertible.

The same argument goes for power series: a0+a1t+. . . is invertible iff a0is invertible, or in other words, a unit4in A[[t]] is uniquely given by a sequence{a0+a1t+. . .antn}n of invertible truncated polynomials

the units in A[[t]]is the limit of the units in the truncated polynomial rings:

units(A[[t]]) =units(lim

n A[[t]]/(tn)) = lim

n units(A[[t]]/(tn)).

units(A) is aninvariant5 in the ringA. The above is an instance of the fact that units (A) is a continuousinvariant.

4“the units”= “the (group of) invertible elements”

5if I replaceAby something isomorphic, units(A) is replaced by something isomorphic. . .

(15)

Question: What about invertible elements?

(an example of an “invariant”)

ExampleInA[[t]]/(t2)

(a0+a1t)(b0+b1t) =a0b0+ (a0b1+a1b0)t, so ifa0is invertible, then (a0+a1t)(a1

0aa1

0t) = 1.

In general, a truncated polynomial is invertible iff the constant term is invertible.

The same argument goes for power series: a0+a1t+. . . is invertible iff a0is invertible, or in other words, a unit4in A[[t]] is uniquely given by a sequence{a0+a1t+. . .antn}n of invertible truncated polynomials

the units in A[[t]]is the limit of the units in the truncated polynomial rings:

units(A[[t]]) =units(lim

n A[[t]]/(tn)) = lim

n units(A[[t]]/(tn)).

units(A) is aninvariant5 in the ringA. The above is an instance of the fact that units (A) is a continuousinvariant.

4“the units”= “the (group of) invertible elements”

5if I replaceAby something isomorphic, units(A) is replaced by something isomorphic. . .

(16)

Question: What about invertible elements?

(an example of an “invariant”)

ExampleInA[[t]]/(t2)

(a0+a1t)(b0+b1t) =a0b0+ (a0b1+a1b0)t, so ifa0is invertible, then (a0+a1t)(a1

0aa1

0t) = 1.

In general, a truncated polynomial is invertible iff the constant term is invertible.

The same argument goes for power series: a0+a1t+. . . is invertible iff a0is invertible, or in other words, a unit4in A[[t]] is uniquely given by a sequence{a0+a1t+. . .antn}n of invertible truncated polynomials

the units in A[[t]]is the limit of the units in the truncated polynomial rings:

units(A[[t]]) =units(lim

n A[[t]]/(tn)) = lim

n units(A[[t]]/(tn)).

units(A) is aninvariant5 in the ringA. The above is an instance of the fact that units (A) is a continuousinvariant.

4“the units”= “the (group of) invertible elements”

5if I replaceAby something isomorphic, units(A) is replaced by something isomorphic. . .

(17)

Question: What about invertible elements?

(an example of an “invariant”)

ExampleInA[[t]]/(t2)

(a0+a1t)(b0+b1t) =a0b0+ (a0b1+a1b0)t, so ifa0is invertible, then (a0+a1t)(a1

0aa1

0t) = 1.

In general, a truncated polynomial is invertible iff the constant term is invertible.

The same argument goes for power series: a0+a1t+. . . is invertible iff a0is invertible, or in other words, a unit4in A[[t]] is uniquely given by a sequence{a0+a1t+. . .antn}n of invertible truncated polynomials

the units in A[[t]]is the limit of the units in the truncated polynomial rings:

units(A[[t]]) =units(lim

n A[[t]]/(tn)) = lim

n units(A[[t]]/(tn)).

units(A) is aninvariant5 in the ringA. The above is an instance of the fact that units (A) is a continuousinvariant.

4“the units”= “the (group of) invertible elements”

5if I replaceAby something isomorphic, units(A) is replaced by something isomorphic. . .

(18)

Hensel and Newton

(something relating to first year calculus)

Example. Let R=A[[t]] and I = (t) (all power series with constant term zero).

The projectionR→R/I =Asends a power seriesp=p(t) to its constant term ¯p=p(0),

“pis invertible iff ¯pis”.

In equations: Letf(x) =p·x−1 (NB: poly. w/coeff. inR)

“f has a root iff ¯f(x) = ¯p·x−1 has a root inR/I”

For arbitraryR andI we say that R→R/I is Henselif “Hensel’s criterion” is satisfied:

any polynomial f(x)w/coeff. in R has a root provided 1. f¯(x)(poly. w/coeff in R/I ) has a rootx¯0∈R/I and 2. f0(¯x0)is invertible in R/I . 6

Hensel’s criterion guarantees that Newton’s method will give you a sequence of partial solutions.

We’re mostly concerned with the special case whereR is completewrt. I, that is to say; an elementx∈Ris given uniquely by giving the sequence {x mod In}n:

R= lim

n R/In.

6In the example, point 2. is redundant sincef0x0) = ¯p= ¯x0−1by 1.

(19)

Hensel and Newton

(something relating to first year calculus)

Example. Let R=A[[t]] and I = (t) (all power series with constant term zero).

The projectionR→R/I =Asends a power seriesp=p(t) to its constant term ¯p=p(0),

“pis invertible iff ¯pis”.

In equations: Letf(x) =p·x−1 (NB: poly. w/coeff. inR)

“f has a root iff ¯f(x) = ¯p·x−1 has a root inR/I”

For arbitraryR andI we say that R→R/I is Henselif “Hensel’s criterion” is satisfied:

any polynomial f(x)w/coeff. in R has a root provided 1. f¯(x)(poly. w/coeff in R/I ) has a rootx¯0∈R/I and 2. f0(¯x0)is invertible in R/I . 6

Hensel’s criterion guarantees that Newton’s method will give you a sequence of partial solutions.

We’re mostly concerned with the special case whereR is completewrt. I, that is to say; an elementx∈Ris given uniquely by giving the sequence {x mod In}n:

R= lim

n R/In.

6In the example, point 2. is redundant sincef0x0) = ¯p= ¯x0−1by 1.

(20)

Hensel and Newton

(something relating to first year calculus)

Example. Let R=A[[t]] and I = (t) (all power series with constant term zero).

The projectionR→R/I =Asends a power seriesp=p(t) to its constant term ¯p=p(0),

“pis invertible iff ¯pis”.

In equations: Letf(x) =p·x−1 (NB: poly. w/coeff. inR)

“f has a root iff ¯f(x) = ¯p·x−1 has a root inR/I”

For arbitraryR andI we say that R→R/I is Henselif “Hensel’s criterion” is satisfied:

any polynomial f(x)w/coeff. in R has a root provided 1. f¯(x)(poly. w/coeff in R/I ) has a rootx¯0∈R/I and 2. f0(¯x0)is invertible in R/I . 6

Hensel’s criterion guarantees that Newton’s method will give you a sequence of partial solutions.

We’re mostly concerned with the special case whereR is completewrt. I, that is to say; an elementx∈Ris given uniquely by giving the sequence {x mod In}n:

R= lim

n R/In.

6In the example, point 2. is redundant sincef0x0) = ¯p= ¯x0−1by 1.

(21)

Hensel and Newton

(something relating to first year calculus)

Example. Let R=A[[t]] and I = (t) (all power series with constant term zero).

The projectionR→R/I =Asends a power seriesp=p(t) to its constant term ¯p=p(0),

“pis invertible iff ¯pis”.

In equations: Letf(x) =p·x−1 (NB: poly. w/coeff. inR)

“f has a root iff ¯f(x) = ¯p·x−1 has a root inR/I”

For arbitraryR andI we say that R→R/I is Henselif “Hensel’s criterion” is satisfied:

any polynomial f(x)w/coeff. in R has a root provided 1. f¯(x)(poly. w/coeff in R/I ) has a rootx¯0∈R/I and 2. f0(¯x0)is invertible in R/I . 6

Hensel’s criterion guarantees that Newton’s method will give you a sequence of partial solutions.

We’re mostly concerned with the special case whereR is completewrt. I, that is to say; an elementx∈Ris given uniquely by giving the sequence {x mod In}n:

R= lim

n R/In.

6In the example, point 2. is redundant sincef0x0) = ¯p= ¯x0−1by 1.

(22)

Hensel and Newton

(something relating to first year calculus)

Example. Let R=A[[t]] and I = (t) (all power series with constant term zero).

The projectionR→R/I =Asends a power seriesp=p(t) to its constant term ¯p=p(0),

“pis invertible iff ¯pis”.

In equations: Letf(x) =p·x−1 (NB: poly. w/coeff. inR)

“f has a root iff ¯f(x) = ¯p·x−1 has a root inR/I”

For arbitraryR andI we say that R→R/I is Henselif “Hensel’s criterion” is satisfied:

any polynomial f(x)w/coeff. in R has a root provided 1. f¯(x)(poly. w/coeff in R/I ) has a rootx¯0∈R/I and 2. f0(¯x0)is invertible in R/I . 6

Hensel’s criterion guarantees that Newton’s method will give you a sequence of partial solutions.

We’re mostly concerned with the special case whereR is completewrt. I, that is to say; an elementx∈Ris given uniquely by giving the sequence {x mod In}n:

R= lim

n R/In.

6In the example, point 2. is redundant sincef0x0) = ¯p= ¯x0−1by 1.

(23)

Invariants – another old example: FLT

Fermat’s last theorem was seemingly proved in 1847 by Gabriel Lam´e:

For each prime7 p, factor

zp=xp+yp= (x+y)(x+ζpy)· · ·(x+ζpp−1y)

(whereζp=e2πip ∈C); use unique factorization into prime factors, and . . . !

Liouville: Unfortunately this is wrong

7for instance,p= 23. We will only consider odd primes since even primes are odd

(24)

Invariants – another old example: FLT

Fermat’s last theorem was seemingly proved in 1847 by Gabriel Lam´e:

For each prime7 p, factor

zp=xp+yp= (x+y)(x+ζpy)· · ·(x+ζpp−1y)

(whereζp=e2πip ∈C); use unique factorization into prime factors, and . . . !

Liouville: Unfortunately this is wrong

7for instance,p= 23. We will only consider odd primes since even primes are odd

(25)

Kummer: unique factorization (UF) depends on the prime!

UF inZ[ζp]⊆Cis true forsomeprimes p, but false for others.9

Whether we have UF depends on an abelian group “ ˜K0(Z[ζp])”10 8

being trivial.

8Z[ζp] consists of all integral linear combinations of thepth roots of unity in the complex fieldC.

Z[ζp] is an example of a “number ring”:Z[ζp] is the “integers” in a finite extension of the rationals

9for instance forp= 23.

10K˜0(Z[ζp]) is an invariant in the ringZ[ζp] called the “ideal class group”, the “Picard group”, the “reduced Grothendieck group” or the “0th reduced K-group”

(26)

Kummer: unique factorization (UF) depends on the prime!

UF inZ[ζp]⊆Cis true forsomeprimes p, but false for others.9

Whether we have UF depends on an abelian group “ ˜K0(Z[ζp])”10 8

being trivial.

8Z[ζp] consists of all integral linear combinations of thepth roots of unity in the complex fieldC.

Z[ζp] is an example of a “number ring”:Z[ζp] is the “integers” in a finite extension of the rationals

9for instance forp= 23.

10K˜0(Z[ζp]) is an invariant in the ringZ[ζp] called the “ideal class group”, the “Picard group”, the “reduced Grothendieck group” or the “0th reduced K-group”

(27)

Kummer, ˜ K

0

(Z[ζ

p

]) and Fermat

More information can be gleaned from ˜K0(Z[ζp]):

The prime p is said to be regularif the only g ∈K˜0Z[ζp] with gp= 1is g = 1.

In fact,Kummer proved FLT for the regular primes.

Regular primes seem quite common: of the primes less than 100 only 37, 59 and 67 are irregular, but to this day one does not know if there are infinitely many.

Another way of saying thatp>3 is regular is to say that it does not divide the numerators of ζ(−1), ζ(−3), . . . , ζ(4−p)

whereζis the Riemann zeta-function, i.e., the continuation ofζ(s) =P

n=1n−s.Thesevalues ofζ(1−n) are easy to calculate, (known forn<108).

Example: ζ(−11) =32760691 , so 691 is irregular. ζ(−31) = 37·208360028141

16320 , so 37 is irregular.

(28)

Kummer, ˜ K

0

(Z[ζ

p

]) and Fermat

More information can be gleaned from ˜K0(Z[ζp]):

The prime p is said to be regularif the only g ∈K˜0Z[ζp] with gp= 1is g = 1.

In fact,Kummer proved FLT for the regular primes.

Regular primes seem quite common: of the primes less than 100 only 37, 59 and 67 are irregular, but to this day one does not know if there are infinitely many.

Another way of saying thatp>3 is regular is to say that it does not divide the numerators of ζ(−1), ζ(−3), . . . , ζ(4−p)

whereζis the Riemann zeta-function, i.e., the continuation ofζ(s) =P

n=1n−s.Thesevalues ofζ(1−n) are easy to calculate, (known forn<108).

Example: ζ(−11) =32760691 , so 691 is irregular. ζ(−31) = 37·208360028141

16320 , so 37 is irregular.

(29)

Kummer, ˜ K

0

(Z[ζ

p

]) and Fermat

More information can be gleaned from ˜K0(Z[ζp]):

The prime p is said to be regularif the only g ∈K˜0Z[ζp] with gp= 1is g = 1.

In fact,Kummer proved FLT for the regular primes.

Regular primes seem quite common: of the primes less than 100 only 37, 59 and 67 are irregular, but to this day one does not know if there are infinitely many.

Another way of saying thatp>3 is regular is to say that it does not divide the numerators of ζ(−1), ζ(−3), . . . , ζ(4−p)

whereζis the Riemann zeta-function, i.e., the continuation ofζ(s) =P

n=1n−s.Thesevalues ofζ(1−n) are easy to calculate, (known forn<108).

Example: ζ(−11) =32760691 , so 691 is irregular. ζ(−31) = 37·208360028141

16320 , so 37 is irregular.

(30)

Kummer, ˜ K

0

(Z[ζ

p

]) and Fermat

More information can be gleaned from ˜K0(Z[ζp]):

The prime p is said to be regularif the only g ∈K˜0Z[ζp] with gp= 1is g = 1.

In fact,Kummer proved FLT for the regular primes.

Regular primes seem quite common: of the primes less than 100 only 37, 59 and 67 are irregular, but to this day one does not know if there are infinitely many.

Another way of saying thatp>3 is regular is to say that it does not divide the numerators of ζ(−1), ζ(−3), . . . , ζ(4−p)

whereζis the Riemann zeta-function, i.e., the continuation ofζ(s) =P

n=1n−s.Thesevalues ofζ(1−n) are easy to calculate, (known forn<108).

Example: ζ(−11) =32760691 , so 691 is irregular. ζ(−31) = 37·208360028141

16320 , so 37 is irregular.

(31)

The invariant K

0

A

Introduced much later by Grothendieck to express his Riemann-Roch theorem

The Grothendieck groupK0Ais an invariant in the ringA11 It reveals some of the structure ofAand

if I replaceAby something isomorphicK0Ais replaced by something isomorphic.

We’ll enjoy knowing one way to constructK0A - it is through a process called “group completion”:

the process that takes the positive integers{1,2, . . .} and considers fractions “QP” subject to the equality

P·X Q·X = P

Q

giving the positive rationals (as an abelian group under multiplication).

11Kummer was interested in the caseA=Z[ζp]C

(32)

The invariant K

0

A

Introduced much later by Grothendieck to express his Riemann-Roch theorem

The Grothendieck groupK0Ais an invariant in the ringA11 It reveals some of the structure ofAand

if I replaceAby something isomorphicK0Ais replaced by something isomorphic.

We’ll enjoy knowing one way to constructK0A - it is through a process called “group completion”:

the process that takes the positive integers{1,2, . . .} and considers fractions “QP” subject to the equality

P·X Q·X = P

Q

giving the positive rationals (as an abelian group under multiplication).

11Kummer was interested in the caseA=Z[ζp]C

(33)

The invariant K

0

A

Introduced much later by Grothendieck to express his Riemann-Roch theorem

The Grothendieck groupK0Ais an invariant in the ringA11 It reveals some of the structure ofAand

if I replaceAby something isomorphicK0Ais replaced by something isomorphic.

We’ll enjoy knowing one way to constructK0A - it is through a process called “group completion”:

the process that takes the positive integers{1,2, . . .} and considers fractions “QP” subject to the equality

P·X Q·X = P

Q

giving the positive rationals (as an abelian group under multiplication).

11Kummer was interested in the caseA=Z[ζp]C

(34)

The invariant K

0

A

Group completion: the process that takes the positive integers{1,2, . . .}and considers fractions “QP” subject to the equality P·XQ·X = PQ to get the nonnegative rationals (an abelian group under multiplication).

First, consider the case whenAis a field (whichZ[ζp] is not).

Instead of the positive integers, consider the finite dimensional vector spaces An. If we consider “fractions” AAmn12 with the equality

Am×Ax An×Ax =Am

An

we have done nothing but added the “negative dimensional vector spaces A−n” and demanded that Am×An=Am+n for all n,m∈Z.

Boring! K0(field)∼=Z.

12at this stage I don’t want to distinguish between different vector spaces of the same dimension, so I consider “isomorphism classes”

(35)

The invariant K

0

A

Group completion: the process that takes the positive integers{1,2, . . .}and considers fractions “QP” subject to the equality P·XQ·X = PQ to get the nonnegative rationals (an abelian group under multiplication).

First, consider the case whenAis a field (whichZ[ζp] is not).

Instead of the positive integers, consider the finite dimensional vector spaces An. If we consider “fractions” AAmn12 with the equality

Am×Ax An×Ax =Am

An

we have done nothing but added the “negative dimensional vector spaces A−n” and demanded that Am×An=Am+n for all n,m∈Z.

Boring! K0(field)∼=Z.

12at this stage I don’t want to distinguish between different vector spaces of the same dimension, so I consider “isomorphism classes”

(36)

The invariant K

0

A

Group completion: the process that takes the positive integers and considers fractions “PQ” subject to the equality P·XQ·X = PQ to get the nonnegative rationals.

Boring! K0(field) ={An|n∈Z} ∼=Z.

IfAis not a field, there are more things to consider than just theAns: there are “A-modules”13 P,Q with

P×Q=Am without eitherP orQ necessarily being of the formAn. 14

K0A is the abelian group you get by considering such fractions QP andK˜0A is what you get if you kill the subgroup Z∼={An|n∈Z} ⊆K1A.

One of the main results of classical algebraic number theory:

0OF is finite for any number ring OF. 15

13“A-modules are just like vector spaces except that the “scalars” are elements inA.

14These are called(finitely generated) projective A-modules.

For instance, ifA=Z×Zwith componentwise addition/multiplication, thenZ× {0}is a projectiveA-module not of the formAn. Similar things happen,e.g.,forA=Z[ζ23]

15“number ring”: the ring of integers in a finite extension ofQ;e.g.,Z[ζp]

(37)

The invariant K

0

A

Group completion: the process that takes the positive integers and considers fractions “PQ” subject to the equality P·XQ·X = PQ to get the nonnegative rationals.

Boring! K0(field) ={An|n∈Z} ∼=Z.

IfAis not a field, there are more things to consider than just theAns: there are “A-modules”13 P,Q with

P×Q=Am without eitherP orQ necessarily being of the formAn. 14

K0A is the abelian group you get by considering such fractions QP andK˜0A is what you get if you kill the subgroup Z∼={An|n∈Z} ⊆K1A.

One of the main results of classical algebraic number theory:

0OF is finite for any number ring OF. 15

13“A-modules are just like vector spaces except that the “scalars” are elements inA.

14These are called(finitely generated) projective A-modules.

For instance, ifA=Z×Zwith componentwise addition/multiplication, thenZ× {0}is a projectiveA-module not of the formAn. Similar things happen,e.g.,forA=Z[ζ23]

15“number ring”: the ring of integers in a finite extension ofQ;e.g.,Z[ζp]

(38)

The invariant K

0

A

Group completion: the process that takes the positive integers and considers fractions “PQ” subject to the equality P·XQ·X = PQ to get the nonnegative rationals.

Boring! K0(field) ={An|n∈Z} ∼=Z.

IfAis not a field, there are more things to consider than just theAns: there are “A-modules”13 P,Q with

P×Q=Am without eitherP orQ necessarily being of the formAn. 14

K0A is the abelian group you get by considering such fractions QP andK˜0A is what you get if you kill the subgroup Z∼={An|n∈Z} ⊆K1A.

One of the main results of classical algebraic number theory:

0OF is finite for any number ring OF. 15

13“A-modules are just like vector spaces except that the “scalars” are elements inA.

14These are called(finitely generated) projective A-modules.

For instance, ifA=Z×Zwith componentwise addition/multiplication, thenZ× {0}is a projectiveA-module not of the formAn. Similar things happen,e.g.,forA=Z[ζ23]

15“number ring”: the ring of integers in a finite extension ofQ;e.g.,Z[ζp]

(39)

The next invariants: K

1

A, K

2

A, . . .

LetF be a finite extension ofQandOF its ring of integers. Dedekind’s zeta function ζF(s) = X

06=I⊂OF

|OF/I|−s

(Riemann’s ifF=Q) contains a wealth of number theoretic information, but it is somewhat densely packed and you need to know some pieces in order to extract others.

For instance, ˜K0OF is packed together with information about the group units (OF) of invertible elements inOF, also crucial for Kummer’s proof. 16

1. More generally,K1A=GL(A)/E(A), measuring to what extent Gaussian elimination is possible inA: E(A) consists of the “elementary matrices” sitting inside the group GL(A) = units(M(A)) of invertible matrices. 17 Note: K1(OF) = units (OF).

2. K2Ameasures howuniqueGaussian elimination is. . .

16Exact sequence 0units(OF)units(F)L

m∈Max(OF)ZK˜0OF 0

17a similar argument as the one above (as applied to matrices) gives thatK1commutes with limits: ı.e..,K1

is continuous

(40)

The next invariants: K

1

A, K

2

A, . . .

LetF be a finite extension ofQandOF its ring of integers. Dedekind’s zeta function ζF(s) = X

06=I⊂OF

|OF/I|−s

(Riemann’s ifF=Q) contains a wealth of number theoretic information, but it is somewhat densely packed and you need to know some pieces in order to extract others.

For instance, ˜K0OF is packed together with information about the group units (OF) of invertible elements inOF, also crucial for Kummer’s proof. 16

1. More generally,K1A=GL(A)/E(A), measuring to what extent Gaussian elimination is possible inA: E(A) consists of the “elementary matrices” sitting inside the group GL(A) = units(M(A)) of invertible matrices. 17 Note: K1(OF) = units (OF).

2. K2Ameasures howuniqueGaussian elimination is. . .

16Exact sequence 0units(OF)units(F)L

m∈Max(OF)ZK˜0OF 0

17a similar argument as the one above (as applied to matrices) gives thatK1commutes with limits: ı.e..,K1

is continuous

(41)

The next invariants: K

1

A, K

2

A, . . .

LetF be a finite extension ofQandOF its ring of integers. Dedekind’s zeta function ζF(s) = X

06=I⊂OF

|OF/I|−s

(Riemann’s ifF=Q) contains a wealth of number theoretic information, but it is somewhat densely packed and you need to know some pieces in order to extract others.

For instance, ˜K0OF is packed together with information about the group units (OF) of invertible elements inOF, also crucial for Kummer’s proof. 16

1. More generally,K1A=GL(A)/E(A), measuring to what extent Gaussian elimination is possible inA: E(A) consists of the “elementary matrices” sitting inside the group GL(A) = units(M(A)) of invertible matrices. 17 Note: K1(OF) = units (OF).

2. K2Ameasures howuniqueGaussian elimination is. . .

16Exact sequence 0units(OF)units(F)L

m∈Max(OF)ZK˜0OF 0

17a similar argument as the one above (as applied to matrices) gives thatK1commutes with limits: ı.e..,K1

is continuous

(42)

The next invariants: K

1

A, K

2

A, . . .

LetF be a finite extension ofQandOF its ring of integers. Dedekind’s zeta function ζF(s) = X

06=I⊂OF

|OF/I|−s

(Riemann’s ifF=Q) contains a wealth of number theoretic information, but it is somewhat densely packed and you need to know some pieces in order to extract others.

For instance, ˜K0OF is packed together with information about the group units (OF) of invertible elements inOF, also crucial for Kummer’s proof. 16

1. More generally,K1A=GL(A)/E(A), measuring to what extent Gaussian elimination is possible inA: E(A) consists of the “elementary matrices” sitting inside the group GL(A) = units(M(A)) of invertible matrices. 17 Note: K1(OF) = units (OF).

2. K2Ameasures howuniqueGaussian elimination is. . .

16Exact sequence 0units(OF)units(F)L

m∈Max(OF)ZK˜0OF 0

17a similar argument as the one above (as applied to matrices) gives thatK1commutes with limits: ı.e..,K1

is continuous

(43)

Higher K-theory is defined as K

0

is, but respecting symmetries. . .

K0Ais the set consisting of

0. fractions PP+ of iso classes of finitely generated projectiveA-modules, 1. subject to the relation PP+×X×X = PP+

K(A) is the space consisting of 0. a point for each pair (P+,P),

1. a path from (P+,P) to (P1+,P1) for each pair of isomorphismP±×X ∼=P1±, 2. a surface between two such paths for each compatible isomorphismX ∼=X0 (i.e., an

invertible matrix ifX =X0 =An) . . .

(44)

Higher K-theory is defined as K

0

is, but respecting symmetries. . .

K0Ais the set consisting of

0. fractions PP+ of iso classes of finitely generated projectiveA-modules, 1. subject to the relation PP+×X×X = PP+

K(A) is the space consisting of 0. a point for each pair (P+,P),

1. a path from (P+,P) to (P1+,P1) for each pair of isomorphismP±×X ∼=P1±, 2. a surface between two such paths for each compatible isomorphismX ∼=X0 (i.e., an

invertible matrix ifX =X0 =An) . . .

(45)

Higher K-theory is defined as K

0

is, but respecting symmetries. . .

K0Ais the set consisting of

0. fractions PP+ of iso classes of finitely generated projectiveA-modules, 1. subject to the relation PP+×X×X = PP+

K(A) is the space consisting of 0. a point for each pair (P+,P),

1. a path from (P+,P) to (P1+,P1) for each pair of isomorphismP±×X ∼=P1±, 2. a surface between two such paths for each compatible isomorphismX ∼=X0 (i.e., an

invertible matrix ifX =X0 =An) . . .

(46)

Higher K-theory is defined as K

0

is, but respecting symmetries. . .

K0Ais the set consisting of

0. fractions PP+ of iso classes of finitely generated projectiveA-modules, 1. subject to the relation PP+×X×X = PP+

K(A) is the space consisting of 0. a point for each pair (P+,P),

1. a path from (P+,P) to (P1+,P1) for each pair of isomorphismP±×X ∼=P1±, 2. a surface between two such paths for each compatible isomorphismX ∼=X0 (i.e., an

invertible matrix ifX =X0 =An) . . .

(47)

Higher K-theory

K(A) is the space consisting of 0. a point for each pair (P+,P),

1. a path from (P+,P) to (P1+,P1) for each pair of isomorphismP±×X ∼=P1±, 2. a surface between two such paths for each compatible isomorphismX ∼=X0 (i.e., an

invertible matrix ifX =X0 =An) . . . Then

0. K0Ais the set of path components ofK(A) 1. K1Ais the fundamental group ofK(A), . . .

n. if Ais a number ring, all the homotopy groups KnAare involved in the zeta functions, giving an vastly more powerful invariant

Picture K-theory as a highly structured zeta-function with periodicity phenomena18 and localizations mirroring the functional equation and meromorphic continuation.

18like the one of the Lichtenbaum-Quillen conjecture, but also higher periodicity coming from stable homotopy theory

(48)

Higher K-theory

K(A) is the space consisting of 0. a point for each pair (P+,P),

1. a path from (P+,P) to (P1+,P1) for each pair of isomorphismP±×X ∼=P1±, 2. a surface between two such paths for each compatible isomorphismX ∼=X0 (i.e., an

invertible matrix ifX =X0 =An) . . . Then

0. K0Ais the set of path components ofK(A) 1. K1Ais the fundamental group ofK(A), . . .

n. if Ais a number ring, all the homotopy groups KnAare involved in the zeta functions, giving an vastly more powerful invariant

Picture K-theory as a highly structured zeta-function with periodicity phenomena18 and localizations mirroring the functional equation and meromorphic continuation.

18like the one of the Lichtenbaum-Quillen conjecture, but also higher periodicity coming from stable homotopy theory

(49)

Higher K-theory

K(A) is the space consisting of 0. a point for each pair (P+,P),

1. a path from (P+,P) to (P1+,P1) for each pair of isomorphismP±×X ∼=P1±, 2. a surface between two such paths for each compatible isomorphismX ∼=X0 (i.e., an

invertible matrix ifX =X0 =An) . . . Then

0. K0Ais the set of path components ofK(A) 1. K1Ais the fundamental group ofK(A), . . .

n. if Ais a number ring, all the homotopy groups KnAare involved in the zeta functions, giving an vastly more powerful invariant

Picture K-theory as a highly structured zeta-function with periodicity phenomena18 and localizations mirroring the functional equation and meromorphic continuation.

18like the one of the Lichtenbaum-Quillen conjecture, but also higher periodicity coming from stable homotopy theory

(50)

Higher K-theory

K(A) is the space consisting of 0. a point for each pair (P+,P),

1. a path from (P+,P) to (P1+,P1) for each pair of isomorphismP±×X ∼=P1±, 2. a surface between two such paths for each compatible isomorphismX ∼=X0 (i.e., an

invertible matrix ifX =X0 =An) . . . Then

0. K0Ais the set of path components ofK(A) 1. K1Ais the fundamental group ofK(A), . . .

n. if Ais a number ring, all the homotopy groups KnAare involved in the zeta functions, giving an vastly more powerful invariant

Picture K-theory as a highly structured zeta-function with periodicity phenomena18 and localizations mirroring the functional equation and meromorphic continuation.

18like the one of the Lichtenbaum-Quillen conjecture, but also higher periodicity coming from stable homotopy theory

(51)

Higher K-theory

K-theory as a “highly structured zeta-function with periodicity phenomena and localizations mirroring the functional equation and meromorphic continuation”.

However, K-theory is not restricted to algebra and number theory. It is an important invariant in geometry (algebraic and topological), physics, . . . 19

For instance,starting with finite sets instead of projective modules, K-theory gives you the

“sphere spectrum” – a base ring more fundamental than the integers20 – encoding homotopy groups of spheres.

19. . . diffeomorphisms of manifolds, vector bundles, functional analysis, algebraic geometry, . . . For some examples beyond my core competence, you may for instance open the Wikipedia page on K-theory (physics) and read stuff like “In condensed matter physics K-theory has also found important applications,. . . ”

20The sphere spectrum is the ground ring for many of the homology theories we will be talking about

(52)

Higher K-theory

K-theory as a “highly structured zeta-function with periodicity phenomena and localizations mirroring the functional equation and meromorphic continuation”.

However, K-theory is not restricted to algebra and number theory. It is an important invariant in geometry (algebraic and topological), physics, . . . 19

For instance,starting with finite sets instead of projective modules, K-theory gives you the

“sphere spectrum” – a base ring more fundamental than the integers20 – encoding homotopy groups of spheres.

19. . . diffeomorphisms of manifolds, vector bundles, functional analysis, algebraic geometry, . . . For some examples beyond my core competence, you may for instance open the Wikipedia page on K-theory (physics) and read stuff like “In condensed matter physics K-theory has also found important applications,. . . ”

20The sphere spectrum is the ground ring for many of the homology theories we will be talking about

(53)

An inconvenient truth

K-theory is notcontinuous: for instance, the difference between K2(Z/p[[t]])and the corresponding limit of truncated polynomial algebras is an uncountable rational vector space!

However, this should be seen as a feature of the difference between algebra and topology and not as a bug,21 and there is a remedy peeling away these unwanted rational vector spaces, called(profinite) completion.

– The passage fromK(A) to its completionKb(A) kills this unwanted noise.

– For finite torsion and free summands in the two will always correspond.

– Completion itself is continuous and does not contribute any complexity.

21similar to the fact that when you look at it discretely the set of invertible realsR− {0}={±1} ×R+is enormous, but topologically it has just two components, each of which is contractible – and rational vector spaces

(54)

An inconvenient truth

K-theory is notcontinuous: for instance, the difference between K2(Z/p[[t]])and the corresponding limit of truncated polynomial algebras is an uncountable rational vector space!

However, this should be seen as a feature of the difference between algebra and topology and not as a bug,21 and there is a remedy peeling away these unwanted rational vector spaces, called(profinite) completion.

– The passage fromK(A) to its completionKb(A) kills this unwanted noise.

– For finite torsion and free summands in the two will always correspond.

– Completion itself is continuous and does not contribute any complexity.

21similar to the fact that when you look at it discretely the set of invertible realsR− {0}={±1} ×R+is enormous, but topologically it has just two components, each of which is contractible – and rational vector spaces

Referanser

RELATERTE DOKUMENTER