Fun with F_un
- Looking for F_un
- The F_un folklore
- Absolute linear algebra
- F_un and braid groups
- F_un with Manin
Recall that an n-braid consists of n strictly descending elastic strings connecting n inputs at the top (named 1,2,…,n) to n outputs at the bottom (labeled 1,2,…,n) upto isotopy (meaning that we may pull and rearrange the strings in any way possible within 3-dimensional space). We can always change the braid slightly such that we can divide the interval between in- and output in a number of subintervals such that in each of those there is at most one crossing.
n-braids can be multiplied by putting them on top of each other and connecting the outputs of the first braid trivially to the inputs of the second. For example the 5-braid on the left can be written as
with
the braid on the top 3 subintervals and
the braid on the lower 5 subintervals.
In this way (and using our claim that there can be at most 1 crossing in each subinterval) we can write any n-braid as a word in the generators
(with
) being the overcrossing between inputs i and i+1. Observe that the undercrossing is then the inverse
. For example, the braid on the left corresponds to the word

Clearly there are relations among words in the generators. The easiest one we have already used implicitly namely that
is the trivial braid.
Emil Artin proved in the 1930-ies that all such relations are consequences of two sets of ‘obvious’ relations. The first being commutation relations between crossings when the strings are far enough from each other. That is we have
whenever 
=
The second basic set of relations involves crossings using a common string

=
Starting with the 5-braid at the top, we can use these relations to reduce it to a simpler form. At each step we have outlined to region where the relations are applied
=
=
=
These beautiful braid-pictures were produced using the braid-metapost program written by Stijn Symens.
Tracing a string from an input to an output assigns to an n-braid a permutation on n letters. In the above example, the permutation is
. As this permutation doesn’t change under applying basic reduction, this gives a group-morphism

from the braid group on n strings
to the symmetric group. We have seen
before that the symmetric group
has a F-un interpretation as the linear group
over the field with one element. Hence, we can ask whether there is also a F-un interpretation of the n-string braid group and of the above group-morphism.
Kapranov and Smirnov suggest in
their paper that the n-string braid group
is the general linear group over the polynomial ring
over the field with one element and that the evaluation morphism (setting t=0)
gives the groupmorphism 
The rationale behind this analogy is a theorem of
Drinfeld’s saying that over a finite field
, the
profinite completion of
is embedded in the fundamental group of the space of q-polynomials of degree n in much the same way as the n-string braid group
is the fundamental group of the space of complex polynomials of degree n without multiple roots.
And, now that we know the basics of absolute linear algebra, we can give an absolute braid-group representation
![\mathbb{B}_n = GL</em>n(\mathbb{F}_1[t]) \rightarrow GL</em>n(\mathbb{F}_{1^n}) \mathbb{B}_n = GL</em>n(\mathbb{F}_1[t]) \rightarrow GL</em>n(\mathbb{F}_{1^n})](/latexrender/pictures/a6178dd7ea8a2d4e849585fafd3565b4.gif)
obtained by sending each generator
to the matrix over
(remember that
where
are the n-th roots of unity)

and it is easy to see that these matrices do indeed satisfy Artin’s defining relations for
.
following the
and that a d-dimensional vectorspace over this field is a pointed set
where
is a free
-set consisting of n.d elements. Note that in absolute linear algebra we are not allowed to have addition of vectors and have to define everything in terms of scalar multiplication (or if you want, the
-action). In the hope of keeping you awake, we will include an F-un interpretation of the power residue symbol.
, that is, correspond to the disjoint union of free
.
the vectorspace cooresponding to the Cartesian product of free
are respectively d and e, then
consists of n.d.n.e elements, so is of dimension n.d.e. In order to have a sensible notion of tensor-products we have to eliminate the n-factor. We do this by identifying
with
and call the corresponding vectorspace
. If we denote the image of
then the identification merely says we can pull the
.
of an
(representants of the different
for some powers of the primitive n-th root of unity
and some permutation
. We define the determinant
. One verifies that the determinant is multiplicative and independent of the choice of basis.
-dimensional
. That is, the det-functor remembers the dimension modulo n. These mod-n features are a recurrent theme in absolute linear algebra. Another example, which will become relevant when we come to reciprocity laws :
. Then, a
vectorspace
is represented by a
matrix having one nonzero entry in every row and column being equal to +1 or -1. Hence, the determinant
.
on the 2d non-zero elements of
the determinant gives the sign of the permutation!
For a prime power
with
,
and hence that
we have the power residue symbol
is a linear automorphism on the
and hence we can look at its F-un determinant
. The F-un interpretation of a classical lemma by
consisting of full
to correspond to the free
obtained by identifying all elements of W with the zero-element in
between
such that the invers image of 0 consists of full
and for every element
we have that the number of pre-images
is congruent to 1 modulo n. Observe that under an equivalence
.![\xymatrix{0 \ar[r] & V_1^{\bullet} \ar[r]^{\alpha} & V^{\bullet} \ar[r]^{\beta} & V</em>2^{\bullet} \ar[r] & 0} \xymatrix{0 \ar[r] & V_1^{\bullet} \ar[r]^{\alpha} & V^{\bullet} \ar[r]^{\beta} & V</em>2^{\bullet} \ar[r] & 0}](/latexrender/pictures/4b09f3494a5c4a3a3847994c0f408106.gif)
a set-theoretic inclusion, the composition
to be the zero-map and with the additional assumption that the map induced by 

.
to turn usual
the field of one element, have their own collection of semi-secret texts, surrounded by whispers, of which they try to decode every single line in search of enlightenment. Fortunately, you do not have to search the shelves of the Bibliotheque National in Paris, but the depths of the internet to find them as huge, bandwidth-unfriendly, scanned documents.
The first are the lecture notes “Lectures on zeta functions and motives” by
, cast in the language reminiscent of Grothendieck’s motives. We postulate the existence of a category with tensor product
whose objects correspond not only to the divisors of the Hasse-Weil zeta functions of schemes over
, whose zeta function is
, and whose zeroth power is “the absolute point” which is teh base for Kurokawa’s direct products. We add some speculations about the role of
The second one is the unpublished paper “Cohomology determinants and reciprocity laws : number field case” by
limit of linear algebra over the finite field
, the “field with one element”, whose vector spaces are just sets. One can postulate, of course, that
is the absolute point, but the real problem is to develop non-trivial consequences of this point of view.”
is the symmetric group
, the identification via permutation matrices (having exactly one 1 in every row and column)
but as
by
. Clearly, linear maps between such ‘extended’ spaces must be maps of pointed sets, that is, sending
.
with
, then
is the cyclic group of order n.
determines an n-set of linear dependent vectors
. In other words, any
elements and there are exactly
is a basis if (and only if)
.
is a
. In particular, a linear isomorphism of
is a
for a permutation
.
elements. The dimension
and the general linear group
is the wreath product of
with
, the identification as matrices with exactly one non-zero entry (being an n-th root of unity) in every row and every column.
elements. Assume that
. It is well known that the group of units
is cyclic of order
so by the assumption we can identify
is an
. In other words,
becomes (via restriction of scalars) an
.
when
. (to be continued)![\xymatrix{\vtx{} \ar@/^/[rr]^a & & \vtx{} \ar@(u,ur)^x \ar@(d,dr)_y \ar@/^/[ll]^b} \xymatrix{\vtx{} \ar@/^/[rr]^a & & \vtx{} \ar@(u,ur)^x \ar@(d,dr)_y \ar@/^/[ll]^b}](/latexrender/pictures/8529687a23e614554de321ec4b6310f3.gif)