A Quadratic Refinement of the Grothendieck–Lefschetz–Verdier Trace Formula
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
THE SIX OPERATIONS for SHEAVES on ARTIN STACKS II: ADIC COEFFICIENTS ? by YVES LASZLO and MARTIN OLSSON
THE SIX OPERATIONS FOR SHEAVES ON ARTIN STACKS II: ADIC COEFFICIENTS ? by YVES LASZLO and MARTIN OLSSON ABSTRACT In this paper we develop a theory of Grothendieck’s six operations for adic constructible sheaves on Artin stacks continuing the study of the finite coefficients case in [14]. 1. Introduction In this paper we continue the study of Grothendieck’s six operations for sheaves on Artin stacks begun in [14]. Our aim in this paper is to extend the theory of finite coefficients of loc. cit. to a theory for adic sheaves. In a subsequent paper [15] we will use this theory to study perverse sheaves on Artin stacks. Throughout we work over an affine excellent finite-dimensional scheme S. Let ` be a prime invertible in S, and such that for any S-scheme X of finite type we have cd`(X) < ∞ (see [14], 1.0.1 for more discussion of this assumption). In what follows, all stacks considered will be algebraic locally of finite type over S. Let Λ be a complete discrete valuation ring with maximal ideal m and n with residue characteristic `, and for every n let Λn denote the quotient Λ/m so that Λ = lim Λ . We then define for any stack X a triangulated category ←− n Dc(X ,Λ) which we call the derived category of constructible Λ–modules on X (of course as in the classical case this is abusive terminology). The cat- egory Dc(X ,Λ) is obtained from the derived category of projective systems {Fn} of Λn–modules by localizing along the full subcategory of complexes whose cohomology sheaves are AR-null (see 2.1 for the meaning of this). -
Lecture Notes in Galois Theory
Lecture Notes in Galois Theory Lectures by Dr Sheng-Chi Liu Throughout these notes, signifies end proof, and N signifies end of example. Table of Contents Table of Contents i Lecture 1 Review of Group Theory 1 1.1 Groups . 1 1.2 Structure of cyclic groups . 2 1.3 Permutation groups . 2 1.4 Finitely generated abelian groups . 3 1.5 Group actions . 3 Lecture 2 Group Actions and Sylow Theorems 5 2.1 p-Groups . 5 2.2 Sylow theorems . 6 Lecture 3 Review of Ring Theory 7 3.1 Rings . 7 3.2 Solutions to algebraic equations . 10 Lecture 4 Field Extensions 12 4.1 Algebraic and transcendental numbers . 12 4.2 Algebraic extensions . 13 Lecture 5 Algebraic Field Extensions 14 5.1 Minimal polynomials . 14 5.2 Composites of fields . 16 5.3 Algebraic closure . 16 Lecture 6 Algebraic Closure 17 6.1 Existence of algebraic closure . 17 Lecture 7 Field Embeddings 19 7.1 Uniqueness of algebraic closure . 19 Lecture 8 Splitting Fields 22 8.1 Lifts are not unique . 22 Notes by Jakob Streipel. Last updated December 6, 2019. i TABLE OF CONTENTS ii Lecture 9 Normal Extensions 23 9.1 Splitting fields and normal extensions . 23 Lecture 10 Separable Extension 26 10.1 Separable degree . 26 Lecture 11 Simple Extensions 26 11.1 Separable extensions . 26 11.2 Simple extensions . 29 Lecture 12 Simple Extensions, continued 30 12.1 Primitive element theorem, continued . 30 Lecture 13 Normal and Separable Closures 30 13.1 Normal closure . 31 13.2 Separable closure . 31 13.3 Finite fields . -
MRD Codes: Constructions and Connections
MRD Codes: Constructions and Connections John Sheekey April 12, 2019 This preprint is of a chapter to appear in Combinatorics and finite fields: Difference sets, polynomials, pseudorandomness and applications. Radon Series on Computational and Applied Mathematics, K.-U. Schmidt and A. Winterhof (eds.). The tables on clas- sifications will be periodically updated (in blue) when further results arise. If you have any data that you would like to share, please contact the author. Abstract Rank-metric codes are codes consisting of matrices with entries in a finite field, with the distance between two matrices being the rank of their difference. Codes with maximum size for a fixed minimum distance are called Maximum Rank Distance (MRD) codes. Such codes were constructed and studied independently by Delsarte (1978), Gabidulin (1985), Roth (1991), and Cooperstein (1998). Rank-metric codes have seen renewed interest in recent years due to their applications in random linear network coding. MRD codes also have interesting connections to other topics such as semifields (finite nonassociative division algebras), finite geometry, linearized polynomials, and cryptography. In this chapter we will survey the known constructions and applications of MRD codes, and present some open problems. arXiv:1904.05813v1 [math.CO] 11 Apr 2019 1 Definitions and Preliminaries 1.1 Rank-metric codes Coding theory is the branch of mathematics concerned with the efficient and accurate transfer of information. Error-correcting codes are used when communication is over a channel in which errors may occur. This requires a set equipped with a distance function, and a subset of allowed codewords; if errors are assumed to be small, then a received message is decoded to the nearest valid codeword. -
Counting and Effective Rigidity in Algebra and Geometry
COUNTING AND EFFECTIVE RIGIDITY IN ALGEBRA AND GEOMETRY BENJAMIN LINOWITZ, D. B. MCREYNOLDS, PAUL POLLACK, AND LOLA THOMPSON ABSTRACT. The purpose of this article is to produce effective versions of some rigidity results in algebra and geometry. On the geometric side, we focus on the spectrum of primitive geodesic lengths (resp., complex lengths) for arithmetic hyperbolic 2–manifolds (resp., 3–manifolds). By work of Reid, this spectrum determines the commensurability class of the 2–manifold (resp., 3–manifold). We establish effective versions of these rigidity results by ensuring that, for two incommensurable arithmetic manifolds of bounded volume, the length sets (resp., the complex length sets) must disagree for a length that can be explicitly bounded as a function of volume. We also prove an effective version of a similar rigidity result established by the second author with Reid on a surface analog of the length spectrum for hyperbolic 3–manifolds. These effective results have corresponding algebraic analogs involving maximal subfields and quaternion subalgebras of quaternion algebras. To prove these effective rigidity results, we establish results on the asymptotic behavior of certain algebraic and geometric counting functions which are of independent interest. 1. INTRODUCTION 1.1. Inverse problems. 1.1.1. Algebraic problems. Given a degree d central division algebra D over a field k, the set of isomorphism classes of maximal subfields MF(D) of D is a basic and well studied invariant of D. Question 1. Do there exist non-isomorphic, central division algebras D1;D2=k with MF(D1) = MF(D2)? Restricting to the class of number fields k, by a well-known consequence of class field theory, when D=k is a quaternion algebra, MF(D) = MF(D0) if and only if D =∼ D0 as k–algebras. -
Triangulated Categories of Motives Over Fs Log Schemes
Triangulated Categories of Motives over fs Log Schemes by Doosung Park A dissertation submitted in partial satisfaction of the requirements for the degree of Doctor of Philosophy in Mathematics in the Graduate Division of the University of California, Berkeley Committee in charge: Professor Martin Olsson, Chair Professor Kam-Biu Luk Professor Constantin Teleman Professor Xinyi Yuan Fall 2016 Triangulated Categories of Motives over fs Log Schemes Copyright 2016 by Doosung Park Abstract Triangulated Categories of Motives over fs Log Schemes by Doosung Park Doctor of Philosophy in Mathematics University of California, Berkeley Professor Martin Olsson, Chair In this thesis, we construct triangulated categories of motives over fs log schemes with rational coefficients and formulate its six operations formalism. For these, we introduce pw- topology and log-weak equivalences to study the homotopy equivalences of fs log schemes. We also introduce equivariant cd-structures to deal with descent theory of motives more systematically. 1 Contents Contents i Introduction v 1 Construction 1 1.1 Premotivic categories . .1 1.2 Equivariant cd-structures . .4 1.3 Descents . 13 1.4 Compactness . 16 1.5 Localizing subcategories . 17 1.6 Bousfield localization . 22 1.7 log-localization . 27 2 Properties of premotivic triangulated categories 33 2.1 Elementary properties . 34 2.2 Localization property . 35 2.3 Support property . 36 2.4 Homotopy properties . 39 2.5 Purity . 40 2.6 Base change property . 42 2.7 Projection formula . 45 2.8 Orientation . 46 2.9 Log motivic categories . 46 3 Some results on log geometry and motives 48 3.1 Charts of log smooth morphisms . -
Grothendieck and the Six Operations
The Fifth International Conference on History of Modern Mathematics Xi’an, China August 18–24, 2019 Grothendieck and the six operations Luc Illusie Université Paris-Sud Plan 1. Serre’s duality theorem 2. Derived categories: Grothendieck’s revolution 3. The f ! functor: duality in the coherent setting 4. Duality in étale cohomology and the six operations 5. Further developments 1. Serre’s duality theorem Theorem 1 (ICM Amsterdam, 1954) k algebraically closed, X =k smooth, projective, irreducible, of dimension m, _ V a vector bundle on X , V = Hom(V ; OX ), i i 1 Ω := Λ ΩX =k . Then: m m (a) dimk H (X ; Ω ) = 1; (b) For all q 2 Z, the pairing Hq(X ; V ) ⊗ Hm−q(X ; V _ ⊗ Ωm) ! Hm(X ; Ωm)(!∼ k) is perfect. Remarks (a) Serre had previously proved (FAC) that, for any coherent sheaf q q F on X , and all q, dimk H (X ; F) < 1 and H (X ; F) = 0 for q > m. (b) Serre doesn’t exhibit a distinguished basis of Hm(X ; Ωm). Proof by induction on m, his vanishing theorems on Hq(X ; F(n)) for q > 0 and n large play a key role. Construction of a distinguished basis crucial in further work by Grothendieck et al. (c) Serre proved analogue for X =C smooth, compact analytic, V a vector bundle on X (Comm. Helv., 1955). Quite different techniques. Th. 1 revisited by Grothendieck: 1955-56, Sém. Bourbaki 149, May 1957 X =k smooth, projective, irreducible, dimension m as above. Theorem 2 (Grothendieck, loc. cit., Th. -
Computing Isomorphisms and Embeddings of Finite
Computing isomorphisms and embeddings of finite fields Ludovic Brieulle, Luca De Feo, Javad Doliskani, Jean-Pierre Flori and Eric´ Schost May 4, 2017 Abstract Let Fq be a finite field. Given two irreducible polynomials f; g over Fq, with deg f dividing deg g, the finite field embedding problem asks to compute an explicit descrip- tion of a field embedding of Fq[X]=f(X) into Fq[Y ]=g(Y ). When deg f = deg g, this is also known as the isomorphism problem. This problem, a special instance of polynomial factorization, plays a central role in computer algebra software. We review previous algorithms, due to Lenstra, Allombert, Rains, and Narayanan, and propose improvements and generalizations. Our detailed complexity analysis shows that our newly proposed variants are at least as efficient as previously known algorithms, and in many cases significantly better. We also implement most of the presented algorithms, compare them with the state of the art computer algebra software, and make the code available as open source. Our experiments show that our new variants consistently outperform available software. Contents 1 Introduction2 2 Preliminaries4 2.1 Fundamental algorithms and complexity . .4 2.2 The Embedding Description problem . 11 arXiv:1705.01221v1 [cs.SC] 3 May 2017 3 Kummer-type algorithms 12 3.1 Allombert's algorithm . 13 3.2 The Artin{Schreier case . 18 3.3 High-degree prime powers . 20 4 Rains' algorithm 21 4.1 Uniquely defined orbits from Gaussian periods . 22 4.2 Rains' cyclotomic algorithm . 23 5 Elliptic Rains' algorithm 24 5.1 Uniquely defined orbits from elliptic periods . -
Mor04, Mor12], Provides a Foundational Tool for 1 Solving Problems in A1-Enumerative Geometry
THE TRACE OF THE LOCAL A1-DEGREE THOMAS BRAZELTON, ROBERT BURKLUND, STEPHEN MCKEAN, MICHAEL MONTORO, AND MORGAN OPIE Abstract. We prove that the local A1-degree of a polynomial function at an isolated zero with finite separable residue field is given by the trace of the local A1-degree over the residue field. This fact was originally suggested by Morel's work on motivic transfers, and by Kass and Wickelgren's work on the Scheja{Storch bilinear form. As a corollary, we generalize a result of Kass and Wickelgren relating the Scheja{Storch form and the local A1-degree. 1. Introduction The A1-degree, first defined by Morel [Mor04, Mor12], provides a foundational tool for 1 solving problems in A1-enumerative geometry. In contrast to classical notions of degree, 1 n n the local A -degree is not integer valued: given a polynomial function f : Ak ! Ak with 1 1 A isolated zero p, the local A -degree of f at p, denoted by degp (f), is defined to be an element of the Grothendieck{Witt group of the ground field. Definition 1.1. Let k be a field. The Grothendieck{Witt group GW(k) is defined to be the group completion of the monoid of isomorphism classes of symmetric non-degenerate bilinear forms over k. The group operation is the direct sum of bilinear forms. We may also give GW(k) a ring structure by taking tensor products of bilinear forms for our multiplication. The local A1-degree, which will be defined in Definition 2.9, can be related to other important invariants at rational points. -
Hidden Number Problems
Hidden Number Problems Barak Shani A thesis submitted in fulfillment of the requirements for the degree of Doctor of Philosophy in Mathematics The University of Auckland 2017 Abstract The hidden number problem is the problem of recovering an unknown group element (the \hidden number") given evaluations of some function on products of the hidden number with known elements in the group. This problem enjoys a vast variety of applications, and provides cross-fertilisation among different areas of mathematics. Bit security is a research field in mathematical cryptology that studies leakage of in- formation in cryptographic systems. Of particular interest are public-key cryptosystems, where the study revolves around the information about the private keys that the public keys leak. Ideally no information is leaked, or more precisely extraction of partial in- formation about the secret keys is (polynomially) equivalent to extraction of the entire keys. Accordingly, studies in this field focus on reducing the problem of recovering the private key to the problem of recovering some information about it. This is done by designing algorithms that use the partial information to extract the keys. The hidden number problem was originated to study reductions of this kind. This thesis studies the hidden number problem in different groups, where the functions are taken to output partial information on the binary representation of the input. A spe- cial focus is directed towards the bit security of Diffie–Hellman key exchange. The study presented here provides new results on the hardness of extracting partial information about Diffie–Hellman keys. Contents 1 Introduction 1 1.1 Summary of Contributions . -
Invertible Objects in Motivic Homotopy Theory
Invertible Objects in Motivic Homotopy Theory Tom Bachmann M¨unchen2016 Invertible Objects in Motivic Homotopy Theory Tom Bachmann Dissertation an der Fakult¨atf¨urMathematik, Informatik und Statistik der Ludwig{Maximilians{Universit¨at M¨unchen vorgelegt von Tom Bachmann aus Chemnitz M¨unchen, den 19. Juli 2016 Erstgutachter: Prof. Dr. Fabien Morel Zweitgutachter: Prof. Dr. Marc Levine Drittgutachter: Prof. Dr. math. Oliver R¨ondigs Tag der m¨undlichen Pr¨ufung:18.11.2016 Eidesstattliche Versicherung Bachmann, Tom Name, Vorname Ich erkläre hiermit an Eides statt, dass ich die vorliegende Dissertation mit dem Thema Invertible Objects in Motivic Homotopy Theory selbständig verfasst, mich außer der angegebenen keiner weiteren Hilfsmittel bedient und alle Erkenntnisse, die aus dem Schrifttum ganz oder annähernd übernommen sind, als solche kenntlich gemacht und nach ihrer Herkunft unter Bezeichnung der Fundstelle einzeln nachgewiesen habe. Ich erkläre des Weiteren, dass die hier vorgelegte Dissertation nicht in gleicher oder in ähnlicher Form bei einer anderen Stelle zur Erlangung eines akademischen Grades eingereicht wurde. München, 1.12.2016 Ort, Datum Unterschrift Doktorandin/Doktorand Eidesstattliche Versicherung Stand: 31.01.2013 vi Abstract If X is a (reasonable) base scheme then there are the categories of interest in stable motivic homotopy theory SH(X) and DM(X), constructed by Morel-Voevodsky and others. These should be thought of as generalisations respectively of the stable homotopy category SH and the derived category of abelian groups D(Ab), which are studied in classical topology, to the \world of smooth schemes over X". Just like in topology, the categories SH(X); DM(X) are symmetric monoidal: there is a bifunctor (E; F ) 7! E ⊗ F satisfying certain properties; in particular there is a unit 1 satisfying E ⊗ 1 ' 1 ⊗ E ' E for all E. -
Six Operations on Dg Enhancements of Derived Categories of Sheaves and Applications
SIX OPERATIONS ON DG ENHANCEMENTS OF DERIVED CATEGORIES OF SHEAVES OLAF M. SCHNURER¨ Abstract. We lift Grothendieck–Verdier–Spaltenstein’s six functor formalism for derived categories of sheaves on ringed spaces over a field to differential graded enhancements. Our main tools come from enriched model category theory. Contents 1. Introduction 1 2. Description of the main results 9 3. Dg k-enriched functorial factorizations 17 4. Applications 24 5. Some 2-multicategories 37 6. Four operations 46 7. Two operations 67 8. The 2-multicategory of formulas 84 9. Some remarks on 2-morphisms in ENHk 87 Appendix A. Spaltenstein’s results generalized to ringed topoi 93 Appendix B. Change of universe 97 Appendix C. Some results on model categories 100 References 104 arXiv:1507.08697v3 [math.AG] 9 Jan 2018 1. Introduction 1.1. Grothendieck–Verdier–Spaltenstein’s six functor formalism in the topological L ∗ ! setting concerns the six functors ⊗ , RHom, Lα , Rα∗, Rα!, α between derived categories of sheaves on ringed spaces and their relations [Ver66, Spa88, KS94, SS16]. Nowadays, triangulated categories are often replaced by suitable differential graded (dg) enhancements because some useful constructions can be performed with dg cat- egories but not with triangulated categories [BK90, Kel06]. Therefore it is natural to ask whether Grothendieck–Verdier–Spaltenstein’s six functor formalism lifts to the level of dg enhancements. We give an affirmative answer to this question if we fix a field k and work with k-ringed spaces, i. e. pairs (X, O) consisting of a topological space X and a sheaf O of commutative k-algebras on X. -
Constructive and Computational Aspects of Cryptographic Pairings
Constructive and Computational Aspects of Cryptographic Pairings Michael Naehrig Constructive and Computational Aspects of Cryptographic Pairings PROEFSCHRIFT ter verkrijging van de graad van doctor aan de Technische Universiteit Eindhoven, op gezag van de Rector Magnificus, prof.dr.ir. C.J. van Duijn, voor een commissie aangewezen door het College voor Promoties in het openbaar te verdedigen op donderdag 7 mei 2009 om 16.00 uur door Michael Naehrig geboren te Stolberg (Rhld.), Duitsland Dit proefschrift is goedgekeurd door de promotor: prof.dr. T. Lange CIP-DATA LIBRARY TECHNISCHE UNIVERSITEIT EINDHOVEN Naehrig, Michael Constructive and Computational Aspects of Cryptographic Pairings / door Michael Naehrig. – Eindhoven: Technische Universiteit Eindhoven, 2009 Proefschrift. – ISBN 978-90-386-1731-2 NUR 919 Subject heading: Cryptology 2000 Mathematics Subject Classification: 94A60, 11G20, 14H45, 14H52, 14Q05 Printed by Printservice Technische Universiteit Eindhoven Cover design by Verspaget & Bruinink, Nuenen c Copyright 2009 by Michael Naehrig Fur¨ Lukas und Julius Promotor: prof.dr. T. Lange Commissie: prof.dr.dr.h.c. G. Frey (Universit¨at Duisburg-Essen) prof.dr. M. Scott (Dublin City University) prof.dr.ir. H.C.A. van Tilborg prof.dr. A. Blokhuis prof.dr. D.J. Bernstein (University of Illinois at Chicago) prof.dr. P.S.L.M. Barreto (Universidade de S˜ao Paulo) Alles, was man tun muss, ist, die richtige Taste zum richtigen Zeitpunkt zu treffen. Johann Sebastian Bach Thanks This dissertation would not exist without the help, encouragement, motivation, and company of many people. I owe much to my supervisor, Tanja Lange. I thank her for her support; for all the efforts she made, even in those years, when I was not her PhD student; for taking care of so many things; and for being a really good supervisor.