Abstract Motivic Homotopy Theory
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Category Theory
CMPT 481/731 Functional Programming Fall 2008 Category Theory Category theory is a generalization of set theory. By having only a limited number of carefully chosen requirements in the definition of a category, we are able to produce a general algebraic structure with a large number of useful properties, yet permit the theory to apply to many different specific mathematical systems. Using concepts from category theory in the design of a programming language leads to some powerful and general programming constructs. While it is possible to use the resulting constructs without knowing anything about category theory, understanding the underlying theory helps. Category Theory F. Warren Burton 1 CMPT 481/731 Functional Programming Fall 2008 Definition of a Category A category is: 1. a collection of ; 2. a collection of ; 3. operations assigning to each arrow (a) an object called the domain of , and (b) an object called the codomain of often expressed by ; 4. an associative composition operator assigning to each pair of arrows, and , such that ,a composite arrow ; and 5. for each object , an identity arrow, satisfying the law that for any arrow , . Category Theory F. Warren Burton 2 CMPT 481/731 Functional Programming Fall 2008 In diagrams, we will usually express and (that is ) by The associative requirement for the composition operators means that when and are both defined, then . This allow us to think of arrows defined by paths throught diagrams. Category Theory F. Warren Burton 3 CMPT 481/731 Functional Programming Fall 2008 I will sometimes write for flip , since is less confusing than Category Theory F. -
Higher-Dimensional Instantons on Cones Over Sasaki-Einstein Spaces and Coulomb Branches for 3-Dimensional N = 4 Gauge Theories
Two aspects of gauge theories higher-dimensional instantons on cones over Sasaki-Einstein spaces and Coulomb branches for 3-dimensional N = 4 gauge theories Von der Fakultät für Mathematik und Physik der Gottfried Wilhelm Leibniz Universität Hannover zur Erlangung des Grades Doktor der Naturwissenschaften – Dr. rer. nat. – genehmigte Dissertation von Dipl.-Phys. Marcus Sperling, geboren am 11. 10. 1987 in Wismar 2016 Eingereicht am 23.05.2016 Referent: Prof. Olaf Lechtenfeld Korreferent: Prof. Roger Bielawski Korreferent: Prof. Amihay Hanany Tag der Promotion: 19.07.2016 ii Abstract Solitons and instantons are crucial in modern field theory, which includes high energy physics and string theory, but also condensed matter physics and optics. This thesis is concerned with two appearances of solitonic objects: higher-dimensional instantons arising as supersymme- try condition in heterotic (flux-)compactifications, and monopole operators that describe the Coulomb branch of gauge theories in 2+1 dimensions with 8 supercharges. In PartI we analyse the generalised instanton equations on conical extensions of Sasaki- Einstein manifolds. Due to a certain equivariant ansatz, the instanton equations are reduced to a set of coupled, non-linear, ordinary first order differential equations for matrix-valued functions. For the metric Calabi-Yau cone, the instanton equations are the Hermitian Yang-Mills equations and we exploit their geometric structure to gain insights in the structure of the matrix equations. The presented analysis relies strongly on methods used in the context of Nahm equations. For non-Kähler conical extensions, focusing on the string theoretically interesting 6-dimensional case, we first of all construct the relevant SU(3)-structures on the conical extensions and subsequently derive the corresponding matrix equations. -
Arxiv:0704.1009V1 [Math.KT] 8 Apr 2007 Odo References
LECTURES ON DERIVED AND TRIANGULATED CATEGORIES BEHRANG NOOHI These are the notes of three lectures given in the International Workshop on Noncommutative Geometry held in I.P.M., Tehran, Iran, September 11-22. The first lecture is an introduction to the basic notions of abelian category theory, with a view toward their algebraic geometric incarnations (as categories of modules over rings or sheaves of modules over schemes). In the second lecture, we motivate the importance of chain complexes and work out some of their basic properties. The emphasis here is on the notion of cone of a chain map, which will consequently lead to the notion of an exact triangle of chain complexes, a generalization of the cohomology long exact sequence. We then discuss the homotopy category and the derived category of an abelian category, and highlight their main properties. As a way of formalizing the properties of the cone construction, we arrive at the notion of a triangulated category. This is the topic of the third lecture. Af- ter presenting the main examples of triangulated categories (i.e., various homo- topy/derived categories associated to an abelian category), we discuss the prob- lem of constructing abelian categories from a given triangulated category using t-structures. A word on style. In writing these notes, we have tried to follow a lecture style rather than an article style. This means that, we have tried to be very concise, keeping the explanations to a minimum, but not less (hopefully). The reader may find here and there certain remarks written in small fonts; these are meant to be side notes that can be skipped without affecting the flow of the material. -
Finite Field
Finite field From Wikipedia, the free encyclopedia In mathematics, a finite field or Galois field (so-named in honor of Évariste Galois) is a field that contains a finite number of elements. As with any field, a finite field is a set on which the operations of multiplication, addition, subtraction and division are defined and satisfy certain basic rules. The most common examples of finite fields are given by the integers mod n when n is a prime number. TheFinite number field - Wikipedia,of elements the of free a finite encyclopedia field is called its order. A finite field of order q exists if and only if the order q is a prime power p18/09/15k (where 12:06p is a amprime number and k is a positive integer). All fields of a given order are isomorphic. In a field of order pk, adding p copies of any element always results in zero; that is, the characteristic of the field is p. In a finite field of order q, the polynomial Xq − X has all q elements of the finite field as roots. The non-zero elements of a finite field form a multiplicative group. This group is cyclic, so all non-zero elements can be expressed as powers of a single element called a primitive element of the field (in general there will be several primitive elements for a given field.) A field has, by definition, a commutative multiplication operation. A more general algebraic structure that satisfies all the other axioms of a field but isn't required to have a commutative multiplication is called a division ring (or sometimes skewfield). -
$\Mathbb {F} 1 $ for Everyone
F1 for everyone Oliver Lorscheid Abstract. This text serves as an introduction to F1-geometry for the general math- ematician. We explain the initial motivations for F1-geometry in detail, provide an overview of the different approaches to F1 and describe the main achievements of the field. Prologue F1-geometry is a recent area of mathematics that emerged from certain heuristics in combinatorics, number theory and homotopy theory that could not be explained in the frame work of Grothendieck’s scheme theory. These ideas involve a theory of algebraic geometry over a hypothetical field F1 with one element, which includes a theory of algebraic groups and their homogeneous spaces, an arithmetic curve SpecZ over F1 that compactifies the arithmetic line SpecZ and K-theory that stays in close relation to homotopy theory of topological spaces such as spheres. Starting in the mid 2000’s, there was an outburst of different approaches towards such theories, which bent and extended scheme theory. Meanwhile some of the initial problems for F1-geometry have been settled and new applications have been found, for instance in cyclic homology and tropical geometry. The first thought that crosses one’s mind in this context is probably the question: What is the “field with one element”? Obviously, this oxymoron cannot be taken literally as it would imply a mathematical contradiction. It is resolved as follows. First of all we remark that we do not need to define F1 itself—what is needed for the aims of F1-geometry is a suitable category of schemes over F1. However, many approaches contain an explicit definition of F1, and in most cases, the field with one element is not a field and has two elements. -
10. Algebra Theories II 10.1 Essentially Algebraic Theory Idea: A
Page 1 of 7 10. Algebra Theories II 10.1 essentially algebraic theory Idea: A mathematical structure is essentially algebraic if its definition involves partially defined operations satisfying equational laws, where the domain of any given operation is a subset where various other operations happen to be equal. An actual algebraic theory is one where all operations are total functions. The most familiar example may be the (strict) notion of category: a small category consists of a set C0of objects, a set C1 of morphisms, source and target maps s,t:C1→C0 and so on, but composition is only defined for pairs of morphisms where the source of one happens to equal the target of the other. Essentially algebraic theories can be understood through category theory at least when they are finitary, so that all operations have only finitely many arguments. This gives a generalization of Lawvere theories, which describe finitary algebraic theories. As the domains of the operations are given by the solutions to equations, they may be understood using the notion of equalizer. So, just as a Lawvere theory is defined using a category with finite products, a finitary essentially algebraic theory is defined using a category with finite limits — or in other words, finite products and also equalizers (from which all other finite limits, including pullbacks, may be derived). Definition As alluded to above, the most concise and elegant definition is through category theory. The traditional definition is this: Definition. An essentially algebraic theory or finite limits theory is a category that is finitely complete, i.e., has all finite limits. -
Noncommutative Geometry and Arithmetic
Noncommutative Geometry and Arithmetic. Johns Hopkins University, March 22-25, 2011 JAMI Conference - Spring 2011 Conference Schedule TUESDAY MARCH 22, 2011 8:00-9:00 a.m. Registration and Breakfast Registration and Breakfast 9:00-10:00 a.m. A. Connes (IHES) An overview on the Jami Conference topics 10:00-10:30 a.m. Coffee Break Coffe Break 10:30-11:30 a.m. O. Viro (SUNY) Patchworking, tropical geometry and hyperfields 11:45-12:45 p.m. P. Lescot (U. de Rouen) The spectrum of a characteristic one algebra Lunch Break Lunch Break 2:30-3:30 p.m. C. Popescu (UCSD) Classical and Equivariant Iwasawa Theory 3:30-4:15 p.m. Refreshments Refreschments 4:15-5:15 p.m. G. Litvinov (Indep. U. of Moscow) Dequantization and mathematics over tropical and idempotent arithmetics 1 WEDNESDAY MARCH 23, 2011 8:00-9:00 a.m. Breakfast Breakfast 9:00-10:00 a.m. O. Lorsheid (CUNY) Blueprints and K-theory over F1 10:15-11:15 a.m. C. Consani (JHU) On the arithmetic of the BC-system I. 11:15-11:45 a.m. Coffee Break Coffee Break 11:45-12:45 p.m. A. Connes (IHES) On the arithmetic of the BC-system II. Lunch Break Lunch Break Lunch Break 2:30-3:30 p.m. Y. Andr´e(ENS Paris) Gevrey series and arithmetic Gevrey series. A survey. 3:30-4:15 p.m. Refreshments Refreschments 4:15-5:15 p.m. K. Thas (U. Gent) Incidental geometries over F1 2 THURSDAY MARCH 24, 2011 8:00-9:00 a.m. -
Category Theory and Diagrammatic Reasoning 3 Universal Properties, Limits and Colimits
Category theory and diagrammatic reasoning 13th February 2019 Last updated: 7th February 2019 3 Universal properties, limits and colimits A division problem is a question of the following form: Given a and b, does there exist x such that a composed with x is equal to b? If it exists, is it unique? Such questions are ubiquitious in mathematics, from the solvability of systems of linear equations, to the existence of sections of fibre bundles. To make them precise, one needs additional information: • What types of objects are a and b? • Where can I look for x? • How do I compose a and x? Since category theory is, largely, a theory of composition, it also offers a unifying frame- work for the statement and classification of division problems. A fundamental notion in category theory is that of a universal property: roughly, a universal property of a states that for all b of a suitable form, certain division problems with a and b as parameters have a (possibly unique) solution. Let us start from universal properties of morphisms in a category. Consider the following division problem. Problem 1. Let F : Y ! X be a functor, x an object of X. Given a pair of morphisms F (y0) f 0 F (y) x , f does there exist a morphism g : y ! y0 in Y such that F (y0) F (g) f 0 F (y) x ? f If it exists, is it unique? 1 This has the form of a division problem where a and b are arbitrary morphisms in X (which need to have the same target), x is constrained to be in the image of a functor F , and composition is composition of morphisms. -
○ Premi Emmy Noether De La SCM ○ Fotografia Matemàtica. Vint Anys
SCM / Notícies / 39 Edita la Societat Catalana de Matemàtiques Filial de l’Institut d’Estudis Catalans 39 ● Premi Emmy Noether de la SCM ● Fotografia matemàtica. Vint anys Juliol 2016 mirant el món amb ulls matemàtics ● Conversa entre Anton Aubanell i Sergi Múria ● Entrevista a Ferran Utzet, matemàtic i director de teatre Cintes de Möbius, Josep Canals Institut d’Estudis Catalans Coberta Notícies 39.indd 1 29/06/2016 15:34:48 ´Index Societat Catalana de Matematiques` La Junta informa 1 Editorial 2 President: Xavier Jarque i Ribera Vicepres.: Enric Ventura i Capell Internacional 3 Vicepres. adj.: Iolanda Guevara La columna de l’EMS 3 i Casanova 25 anys de la Societat Europea de Matem`atiques 5 Secretari: Albert Ruiz i Cirera Reuni´ode presidents de les societats de l’EMS 8 Tresorera: Nat`aliaCastellana i Vila Vocals: Albert Aviny´oi Andr´es Noticiari 10 Marta Berini i L´opez-Lara Publicacions Electr`oniquesde la SCM 10 N´uriaFagella i Rabionet Nou Departament de Matem`atiquesde la UPC 11 Alberto Herrero Izquierdo Nou Departament de Matem`atiquesi Inform`aticaUB 12 Josep Gran´ei Manlleu Les universitats informen 14 Carles Romero i Chesa Manuel Udina i Abell´o Activitats del MMACA 19 Delegat Llu´ısAlsed`a,nou director del CRM 21 de l’IEC: Joan Girbau i Bad´o Cangur 2016 22 Comunicacions: Activitats 26 XVIII Jornada Did`acticaMatem`aticad’ABEAM 26 Carrer del Carme, 47 08001 Barcelona Contribucions de John F. Nash 27 Tel.: 932 701 620 BGSMath Junior Meeting 28 Fax: 932 701 180 Art i matem`atiques:buscant la bellesa 29 A/e: [email protected] La Copa Cangur, des de dins 30 Secret`aria: N´uriaFuster Acte de presentaci´odels premis Noether 32 Tel.: 933 248 583 de 10 a 17 h LII Olimp´ıadaCatalana de Matem`atiques 33 LII Olimp´ıadaMatem`aticaEspanyola 34 SCM/Not´ıcies Activitats amb ajut de la Societat 36 Juliol 2016. -
Geometry Over the Field with One Element
GEOMETRY OVER THE FIELD WITH ONE ELEMENT OLIVER LORSCHEID 1. MOTIVATION Two main sources have led to the development of several notions of F1-geometry in the recent five years. We will concentrate on one of these, which originated as remark in a paper by Jacques Tits ([10]). For a wide class of schemes X (including affine space An, projective space Pn, the Grassmannian Gr(k, n), split reductive groups G), the function N(q) = #X(Fq) is described by a polynomial in q with integer coefficients, whenever q is a prime power. Taking the value N(1) sometimes gives interesting outcomes, but has a 0 of order r in other cases. A more interesting number is the lowest non-vanishing coefficient of the development of N(q) around q − 1, i.e. the number N(q) lim , q→1 (q − 1)r which Tits took to be the number #X(F1) of “F1-points” of X. The task at hand is to extend the definition of the above mentioned schemes X to schemes that are “defined over F1” such that their set of F1-points is a set of cardinality #X(F1). We describe some cases, and suggest an interpretation of the set of F1-points: n−1 • #P (F1) = n = #Mn with Mn := {1, . , n}. n • # Gr(k, n)(F1) = k = #Mk,n with Mk,n = {subsets of Mn with k elements}. r • If G is a split reductive group of rank r, T ' Gm ⊂ G is a maximal torus, N its nomalizer and W = N(Z)/T (Z), then the Bruhat decomposition G(Fq) = ` w∈W BwB(Fq) (where B is a Borel subgroup containing T ) implies that N(q) = P r d w∈W (q − 1) qw for certain dw ≥ 0. -
Functorial Semantics for Partial Theories
Functorial semantics for partial theories Di Liberti, —, Nester, Sobocinski TAL Seminari di Logica Torino–Udine TECH Introduction joint work with • Ivan Di Liberti (CAS) • Chad Nester (Taltech) • Pawel Sobocinski (Taltech) A category-theorist’ view on universal algebra. Opinions are my own. — the Twitter angry mob What’s the paper about? A variety theorem for partial algebraic theories (operations are partially defined). Plan of the talk 1a. A semiclassical look to algebraic theories; 1b. Essentially algebraic theories; 2a. Towards a Lawvere-like characterization; 2b. the variety theorem of PLTs. Two take-home messages The classical picture You could have invented universal algebra if only you knew category theory if you define it right, you won’t need a subscript. — Sammy Eilenberg Theories Fact: the category Finop is the free completion of • under finite products. [n] 2 Fin [n] = [1] + ··· + [1] n times Definition (Lawvere theory) A Lawvere theory is a functor p : Finop !L that is identity on objects (=‘idonob’) and strictly preserves products. p(n + m) = p[n] × p[m] There is a category Law of Lawvere theories and morphisms thereof. Theories Theorem It is equivalent to give 1. a Lawvere theory, in the sense above. (Lawvere, 1963) 2. a finitary monad T on Set.(Linton, 1966) 3. a finitary monadic LFP category over Set (Adàmek, Lawvere, Rosickỳ 2003) ( ) ! P⋄P!P 4. a cartesian operad P : Fin Set – a certain monoid 1!P in [Fin; Set] (probably known to Lawvere?). 5. a cocontinuous monad T on [Fin; Set], which is convolution monoidal. (cmc := convolution monoidally cocontinuous) 1 () 2 () 3 Let p : Finop !L be the theory, and consider the strict pullback in Cat: M(L) / [L; Set] _ U −◦p Set / [Finop; Set] A λn:An it’s a pullback in the 2-category of locally fin. -
Category Theory Course
Category Theory Course John Baez September 3, 2019 1 Contents 1 Category Theory: 4 1.1 Definition of a Category....................... 5 1.1.1 Categories of mathematical objects............. 5 1.1.2 Categories as mathematical objects............ 6 1.2 Doing Mathematics inside a Category............... 10 1.3 Limits and Colimits.......................... 11 1.3.1 Products............................ 11 1.3.2 Coproducts.......................... 14 1.4 General Limits and Colimits..................... 15 2 Equalizers, Coequalizers, Pullbacks, and Pushouts (Week 3) 16 2.1 Equalizers............................... 16 2.2 Coequalizers.............................. 18 2.3 Pullbacks................................ 19 2.4 Pullbacks and Pushouts....................... 20 2.5 Limits for all finite diagrams.................... 21 3 Week 4 22 3.1 Mathematics Between Categories.................. 22 3.2 Natural Transformations....................... 25 4 Maps Between Categories 28 4.1 Natural Transformations....................... 28 4.1.1 Examples of natural transformations........... 28 4.2 Equivalence of Categories...................... 28 4.3 Adjunctions.............................. 29 4.3.1 What are adjunctions?.................... 29 4.3.2 Examples of Adjunctions.................. 30 4.3.3 Diagonal Functor....................... 31 5 Diagrams in a Category as Functors 33 5.1 Units and Counits of Adjunctions................. 39 6 Cartesian Closed Categories 40 6.1 Evaluation and Coevaluation in Cartesian Closed Categories. 41 6.1.1 Internalizing Composition................. 42 6.2 Elements................................ 43 7 Week 9 43 7.1 Subobjects............................... 46 8 Symmetric Monoidal Categories 50 8.1 Guest lecture by Christina Osborne................ 50 8.1.1 What is a Monoidal Category?............... 50 8.1.2 Going back to the definition of a symmetric monoidal category.............................. 53 2 9 Week 10 54 9.1 The subobject classifier in Graph.................