DOCSLIB.ORG

Toposes Toposes and Their Logic

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Toposes Toposes and Their Logic Building up to toposes Toposes and their logic Toposes James Leslie University of Edinurgh [email protected] April 2018 James Leslie Toposes Building up to toposes Toposes and their logic Overview 1 Building up to toposes Limits and colimits Exponenetiation Subobject classifiers 2 Toposes and their logic Toposes Heyting algebras James Leslie Toposes Limits and colimits Building up to toposes Exponenetiation Toposes and their logic Subobject classifiers Products Z f f1 f2 X × Y π1 π2 X Y James Leslie Toposes Limits and colimits Building up to toposes Exponenetiation Toposes and their logic Subobject classifiers Coproducts i i X 1 X + Y 2 Y f f1 f2 Z James Leslie Toposes e : E ! X is an equaliser if for any commuting diagram f Z h X Y g there is a unique h such that triangle commutes: f E e X Y g h h Z Limits and colimits Building up to toposes Exponenetiation Toposes and their logic Subobject classifiers Equalisers Suppose we have the following commutative diagram: f E e X Y g James Leslie Toposes Limits and colimits Building up to toposes Exponenetiation Toposes and their logic Subobject classifiers Equalisers Suppose we have the following commutative diagram: f E e X Y g e : E ! X is an equaliser if for any commuting diagram f Z h X Y g there is a unique h such that triangle commutes: f E e X Y g h h Z James Leslie Toposes The following is an equaliser diagram: f ker G i G H 0 Given a k such that following commutes: f K k G H ker G i G 0 k k K k : K ! ker(G), k(g) = k(g). Limits and colimits Building up to toposes Exponenetiation Toposes and their logic Subobject classifiers Equalisers - an example Let G; H be groups, f : G ! H a group homomorphism and 0 : G ! H the constant eH map. James Leslie Toposes Given a k such that following commutes: f K k G H ker G i G 0 k k K k : K ! ker(G), k(g) = k(g). Limits and colimits Building up to toposes Exponenetiation Toposes and their logic Subobject classifiers Equalisers - an example Let G; H be groups, f : G ! H a group homomorphism and 0 : G ! H the constant eH map. The following is an equaliser diagram: f ker G i G H 0 James Leslie Toposes k : K ! ker(G), k(g) = k(g). Limits and colimits Building up to toposes Exponenetiation Toposes and their logic Subobject classifiers Equalisers - an example Let G; H be groups, f : G ! H a group homomorphism and 0 : G ! H the constant eH map. The following is an equaliser diagram: f ker G i G H 0 Given a k such that following commutes: f K k G H ker G i G 0 k k K James Leslie Toposes Limits and colimits Building up to toposes Exponenetiation Toposes and their logic Subobject classifiers Equalisers - an example Let G; H be groups, f : G ! H a group homomorphism and 0 : G ! H the constant eH map. The following is an equaliser diagram: f ker G i G H 0 Given a k such that following commutes: f K k G H ker G i G 0 k k K k : K ! ker(G), k(g) = k(g). James Leslie Toposes q : Y ! Q is a coequaliser if for any commuting diagram f X Y h Z g there is a unique h such that the triangle commutes: f q X Y Q g h h Z Limits and colimits Building up to toposes Exponenetiation Toposes and their logic Subobject classifiers Coequalisers Suppose we have the following commutative diagram: f q X Y Q g James Leslie Toposes Limits and colimits Building up to toposes Exponenetiation Toposes and their logic Subobject classifiers Coequalisers Suppose we have the following commutative diagram: f q X Y Q g q : Y ! Q is a coequaliser if for any commuting diagram f X Y h Z g there is a unique h such that the triangle commutes: f q X Y Q g h h Z James Leslie Toposes Given a h such that the following commutes: 5z h q Z Z H Z Z=5Z 0 h h H h(g) = h(g). Look familiar? Limits and colimits Building up to toposes Exponenetiation Toposes and their logic Subobject classifiers Coequalisers - an example Let Z be a group under addition. The following is a coequaliser diagram: 5z q Z Z Z=5Z 0 James Leslie Toposes h(g) = h(g). Look familiar? Limits and colimits Building up to toposes Exponenetiation Toposes and their logic Subobject classifiers Coequalisers - an example Let Z be a group under addition. The following is a coequaliser diagram: 5z q Z Z Z=5Z 0 Given a h such that the following commutes: 5z h q Z Z H Z Z=5Z 0 h h H James Leslie Toposes Limits and colimits Building up to toposes Exponenetiation Toposes and their logic Subobject classifiers Coequalisers - an example Let Z be a group under addition. The following is a coequaliser diagram: 5z q Z Z Z=5Z 0 Given a h such that the following commutes: 5z h q Z Z H Z Z=5Z 0 h h H h(g) = h(g). Look familiar? James Leslie Toposes As a diagram: π P 2 Y π1 g X Z f Limits and colimits Building up to toposes Exponenetiation Toposes and their logic Subobject classifiers Pullbacks Take functions f : X ! Z, g : Y ! Z. The pullback of f and g the following set: P = f(x; y) 2 X × Y : f (x) = g(y)g James Leslie Toposes Limits and colimits Building up to toposes Exponenetiation Toposes and their logic Subobject classifiers Pullbacks Take functions f : X ! Z, g : Y ! Z. The pullback of f and g the following set: P = f(x; y) 2 X × Y : f (x) = g(y)g As a diagram: π P 2 Y π1 g X Z f James Leslie Toposes Limits and colimits Building up to toposes Exponenetiation Toposes and their logic Subobject classifiers Pullbacks The universal property: S h2 h π P 2 Y h1 π1 g X Z f James Leslie Toposes Limits and colimits Building up to toposes Exponenetiation Toposes and their logic Subobject classifiers Pullbacks - Intersection Take two subsets i : 2Z ,−! Z and j : 3Z ,−! Z. Their pullback is their intersection: i ∗ 6Z 3Z j∗ j 2 Z i Z James Leslie Toposes Q is (Y + Z)= ∼, where ∼ is generated by ∼= hf(f (x); g(x)) : x 2 X gi. Limits and colimits Building up to toposes Exponenetiation Toposes and their logic Subobject classifiers Pushouts Given two functions with same domain f : X ! Y , g : X ! Z, we can from their pushout square: X f Z X f Z g g q2 Y Y Q q1 James Leslie Toposes Limits and colimits Building up to toposes Exponenetiation Toposes and their logic Subobject classifiers Pushouts Given two functions with same domain f : X ! Y , g : X ! Z, we can from their pushout square: X f Z X f Z g g q2 Y Y Q q1 Q is (Y + Z)= ∼, where ∼ is generated by ∼= hf(f (x); g(x)) : x 2 X gi. James Leslie Toposes Limits and colimits Building up to toposes Exponenetiation Toposes and their logic Subobject classifiers Pushouts The universal property: X f Z g q2 h2 Y Q q1 h h1 S James Leslie Toposes fI A cone on D is an object A 2 A with maps (A −! D(I ))I 2I, such that the following commutes for all u : I ! J in I. A fJ fI D(J) D(I ) D(u) Limits and colimits Building up to toposes Exponenetiation Toposes and their logic Subobject classifiers Limits Let I be a small category. A diagram in A is a functor D : I ! A . James Leslie Toposes Limits and colimits Building up to toposes Exponenetiation Toposes and their logic Subobject classifiers Limits Let I be a small category. A diagram in A is a functor D : I ! A . fI A cone on D is an object A 2 A with maps (A −! D(I ))I 2I, such that the following commutes for all u : I ! J in I. A fJ fI D(J) D(I ) D(u) James Leslie Toposes Limits and colimits Building up to toposes Exponenetiation Toposes and their logic Subobject classifiers Limits πI A limit of D is a universal cone (L −! D(I ))I 2I such that the following commutes for all I ; J 2 I: A f fJ fI L πJ πI D(J) D(I ) D(u) James Leslie Toposes If I consists the following objects and maps, a limit of D : I ! A is an equaliser: · · If I consists the following objects and maps, a limit of D : I ! A is an pullback: · · · Limits and colimits Building up to toposes Exponenetiation Toposes and their logic Subobject classifiers Limit examples If I is a discrete, 2 object category, a limit of D : I ! A is a product. James Leslie Toposes If I consists the following objects and maps, a limit of D : I ! A is an pullback: · · · Limits and colimits Building up to toposes Exponenetiation Toposes and their logic Subobject classifiers Limit examples If I is a discrete, 2 object category, a limit of D : I ! A is a product. If I consists the following objects and maps, a limit of D : I ! A is an equaliser: · · James Leslie Toposes Limits and colimits Building up to toposes Exponenetiation Toposes and their logic Subobject classifiers Limit examples If I is a discrete, 2 object category, a limit of D : I ! A is a product.
Load more

Recommended publications
  • Topos Theory
    Topos Theory Olivia Caramello Sheaves on a site Grothendieck topologies Grothendieck toposes Basic properties of Grothendieck toposes Subobject lattices Topos Theory Balancedness The epi-mono factorization Lectures 7-14: Sheaves on a site The closure operation on subobjects Monomorphisms and epimorphisms Exponentials Olivia Caramello The subobject classifier Local operators For further reading Topos Theory Sieves Olivia Caramello In order to ‘categorify’ the notion of sheaf of a topological space, Sheaves on a site Grothendieck the first step is to introduce an abstract notion of covering (of an topologies Grothendieck object by a family of arrows to it) in a category. toposes Basic properties Definition of Grothendieck toposes Subobject lattices • Given a category C and an object c 2 Ob(C), a presieve P in Balancedness C on c is a collection of arrows in C with codomain c. The epi-mono factorization The closure • Given a category C and an object c 2 Ob(C), a sieve S in C operation on subobjects on c is a collection of arrows in C with codomain c such that Monomorphisms and epimorphisms Exponentials The subobject f 2 S ) f ◦ g 2 S classifier Local operators whenever this composition makes sense. For further reading • We say that a sieve S is generated by a presieve P on an object c if it is the smallest sieve containing it, that is if it is the collection of arrows to c which factor through an arrow in P. If S is a sieve on c and h : d ! c is any arrow to c, then h∗(S) := fg | cod(g) = d; h ◦ g 2 Sg is a sieve on d.
    [Show full text]
  • A Few Points in Topos Theory
    A few points in topos theory Sam Zoghaib∗ Abstract This paper deals with two problems in topos theory; the construction of finite pseudo-limits and pseudo-colimits in appropriate sub-2-categories of the 2-category of toposes, and the definition and construction of the fundamental groupoid of a topos, in the context of the Galois theory of coverings; we will take results on the fundamental group of étale coverings in [1] as a starting example for the latter. We work in the more general context of bounded toposes over Set (instead of starting with an effec- tive descent morphism of schemes). Questions regarding the existence of limits and colimits of diagram of toposes arise while studying this prob- lem, but their general relevance makes it worth to study them separately. We expose mainly known constructions, but give some new insight on the assumptions and work out an explicit description of a functor in a coequalizer diagram which was as far as the author is aware unknown, which we believe can be generalised. This is essentially an overview of study and research conducted at dpmms, University of Cambridge, Great Britain, between March and Au- gust 2006, under the supervision of Martin Hyland. Contents 1 Introduction 2 2 General knowledge 3 3 On (co)limits of toposes 6 3.1 The construction of finite limits in BTop/S ............ 7 3.2 The construction of finite colimits in BTop/S ........... 9 4 The fundamental groupoid of a topos 12 4.1 The fundamental group of an atomic topos with a point . 13 4.2 The fundamental groupoid of an unpointed locally connected topos 15 5 Conclusion and future work 17 References 17 ∗e-mail: [email protected] 1 1 Introduction Toposes were first conceived ([2]) as kinds of “generalised spaces” which could serve as frameworks for cohomology theories; that is, mapping topological or geometrical invariants with an algebraic structure to topological spaces.
    [Show full text]
  • The Trace Factorisation of Stable Functors
    The Trace Factorisation of Stable Functors Paul Taylor 1998 Abstract A functor is stable if it has a left adjoint on each slice. Such functors arise as forgetful functors from categories of models of disjunctive theories. A stable functor factorises as a functor with a (global) left adjoint followed by a fibration of groupoids; Diers [D79] showed that in many cases the corresponding indexation is a well-known spectrum. Independently, Berry [B78,B79] constructed a cartesian closed category of posets and stable functors, which Girard [G85] developed into a model of polymorphism; the proof of cartesian closure implicitly makes use of this factorisation. Girard [G81] had earlier developed a technique in proof theory involving dilators (stable endofunctors of the category of ordinals), also using the factorisation. Although Diers [D81] knew of the existence of this factorisation system, his work used an additional assumption of preserving equalisers. However Lamarche [L88] observed that examples such as algebraically closed fields can be incorporated if this assumption is dropped, and also that (in the the search for cartesian closed categories) evaluation does not preserve equalisers. We find that Diers' definitions can be modified in a simple and elegant way which also throws light on the General Adjoint Functor Theorem and on factorisation systems. In this paper the factorisation system is constructed in detail and related back to Girard's examples; following him we call the intermediate category the trace. We also consider nat- ural and cartesian transformations between stable functors. We find that the latter (which must be the morphisms of the \stable functor category") have a simple connection with the factorisation, and induce a rigid adjunction (whose unit and counit are cartesian) between traces.
    [Show full text]
  • The Freyd-Mitchell Embedding Theorem States the Existence of a Ring R and an Exact Full Embedding a Ñ R-Mod, R-Mod Being the Category of Left Modules Over R
    The Freyd-Mitchell Embedding Theorem Arnold Tan Junhan Michaelmas 2018 Mini Projects: Homological Algebra arXiv:1901.08591v1 [math.CT] 23 Jan 2019 University of Oxford MFoCS Homological Algebra Contents 1 Abstract 1 2 Basics on abelian categories 1 3 Additives and representables 6 4 A special case of Freyd-Mitchell 10 5 Functor categories 12 6 Injective Envelopes 14 7 The Embedding Theorem 18 1 Abstract Given a small abelian category A, the Freyd-Mitchell embedding theorem states the existence of a ring R and an exact full embedding A Ñ R-Mod, R-Mod being the category of left modules over R. This theorem is useful as it allows one to prove general results about abelian categories within the context of R-modules. The goal of this report is to flesh out the proof of the embedding theorem. We shall follow closely the material and approach presented in Freyd (1964). This means we will encounter such concepts as projective generators, injective cogenerators, the Yoneda embedding, injective envelopes, Grothendieck categories, subcategories of mono objects and subcategories of absolutely pure objects. This approach is summarised as follows: • the functor category rA, Abs is abelian and has injective envelopes. • in fact, the same holds for the full subcategory LpAq of left-exact functors. • LpAqop has some nice properties: it is cocomplete and has a projective generator. • such a category embeds into R-Mod for some ring R. • in turn, A embeds into such a category. 2 Basics on abelian categories Fix some category C. Let us say that a monic A Ñ B is contained in another monic A1 Ñ B if there is a map A Ñ A1 making the diagram A B commute.
    [Show full text]
  • The Category of Sheaves Is a Topos Part 2
    The category of sheaves is a topos part 2 Patrick Elliott Recall from the last talk that for a small category C, the category PSh(C) of presheaves on C is an elementary topos. Explicitly, PSh(C) has the following structure: • Given two presheaves F and G on C, the exponential GF is the presheaf defined on objects C 2 obC by F G (C) = Hom(hC × F; G); where hC = Hom(−;C) is the representable functor associated to C, and the product × is defined object-wise. • Writing 1 for the constant presheaf of the one object set, the subobject classifier true : 1 ! Ω in PSh(C) is defined on objects by Ω(C) := fS j S is a sieve on C in Cg; and trueC : ∗ ! Ω(C) sends ∗ to the maximal sieve t(C). The goal of this talk is to refine this structure to show that the category Shτ (C) of sheaves on a site (C; τ) is also an elementary topos. To do this we must make use of the sheafification functor defined at the end of the first talk: Theorem 0.1. The inclusion functor i : Shτ (C) ! PSh(C) has a left adjoint a : PSh(C) ! Shτ (C); called sheafification, or the associated sheaf functor. Moreover, this functor commutes with finite limits. Explicitly, a(F) = (F +)+, where + F (C) := colimS2τ(C)Match(S; F); where Match(S; F) is the set of matching families for the cover S of C, and the colimit is taken over all covering sieves of C, ordered by reverse inclusion.
    [Show full text]
  • Notes on Categorical Logic
    Notes on Categorical Logic Anand Pillay & Friends Spring 2017 These notes are based on a course given by Anand Pillay in the Spring of 2017 at the University of Notre Dame. The notes were transcribed by Greg Cousins, Tim Campion, L´eoJimenez, Jinhe Ye (Vincent), Kyle Gannon, Rachael Alvir, Rose Weisshaar, Paul McEldowney, Mike Haskel, ADD YOUR NAMES HERE. 1 Contents Introduction . .3 I A Brief Survey of Contemporary Model Theory 4 I.1 Some History . .4 I.2 Model Theory Basics . .4 I.3 Morleyization and the T eq Construction . .8 II Introduction to Category Theory and Toposes 9 II.1 Categories, functors, and natural transformations . .9 II.2 Yoneda's Lemma . 14 II.3 Equivalence of categories . 17 II.4 Product, Pullbacks, Equalizers . 20 IIIMore Advanced Category Theoy and Toposes 29 III.1 Subobject classifiers . 29 III.2 Elementary topos and Heyting algebra . 31 III.3 More on limits . 33 III.4 Elementary Topos . 36 III.5 Grothendieck Topologies and Sheaves . 40 IV Categorical Logic 46 IV.1 Categorical Semantics . 46 IV.2 Geometric Theories . 48 2 Introduction The purpose of this course was to explore connections between contemporary model theory and category theory. By model theory we will mostly mean first order, finitary model theory. Categorical model theory (or, more generally, categorical logic) is a general category-theoretic approach to logic that includes infinitary, intuitionistic, and even multi-valued logics. Say More Later. 3 Chapter I A Brief Survey of Contemporary Model Theory I.1 Some History Up until to the seventies and early eighties, model theory was a very broad subject, including topics such as infinitary logics, generalized quantifiers, and probability logics (which are actually back in fashion today in the form of con- tinuous model theory), and had a very set-theoretic flavour.
    [Show full text]
  • Classifying Categories the Jordan-Hölder and Krull-Schmidt-Remak Theorems for Abelian Categories
    U.U.D.M. Project Report 2018:5 Classifying Categories The Jordan-Hölder and Krull-Schmidt-Remak Theorems for Abelian Categories Daniel Ahlsén Examensarbete i matematik, 30 hp Handledare: Volodymyr Mazorchuk Examinator: Denis Gaidashev Juni 2018 Department of Mathematics Uppsala University Classifying Categories The Jordan-Holder¨ and Krull-Schmidt-Remak theorems for abelian categories Daniel Ahlsen´ Uppsala University June 2018 Abstract The Jordan-Holder¨ and Krull-Schmidt-Remak theorems classify finite groups, either as direct sums of indecomposables or by composition series. This thesis defines abelian categories and extends the aforementioned theorems to this context. 1 Contents 1 Introduction3 2 Preliminaries5 2.1 Basic Category Theory . .5 2.2 Subobjects and Quotients . .9 3 Abelian Categories 13 3.1 Additive Categories . 13 3.2 Abelian Categories . 20 4 Structure Theory of Abelian Categories 32 4.1 Exact Sequences . 32 4.2 The Subobject Lattice . 41 5 Classification Theorems 54 5.1 The Jordan-Holder¨ Theorem . 54 5.2 The Krull-Schmidt-Remak Theorem . 60 2 1 Introduction Category theory was developed by Eilenberg and Mac Lane in the 1942-1945, as a part of their research into algebraic topology. One of their aims was to give an axiomatic account of relationships between collections of mathematical structures. This led to the definition of categories, functors and natural transformations, the concepts that unify all category theory, Categories soon found use in module theory, group theory and many other disciplines. Nowadays, categories are used in most of mathematics, and has even been proposed as an alternative to axiomatic set theory as a foundation of mathematics.[Law66] Due to their general nature, little can be said of an arbitrary category.
    [Show full text]
  • SHEAVES, TOPOSES, LANGUAGES Acceleration Based on A
    Chapter 7 Logic of behavior: Sheaves, toposes, and internal languages 7.1 How can we prove our machine is safe? Imagine you are trying to design a system of interacting components. You wouldn’t be doing this if you didn’t have a goal in mind: you want the system to do something, to behave in a certain way. In other words, you want to restrict its possibilities to a smaller set: you want the car to remain on the road, you want the temperature to remain in a particular range, you want the bridge to be safe for trucks to pass. Out of all the possibilities, your system should only permit some. Since your system is made of components that interact in specified ways, the possible behavior of the whole—in any environment—is determined by the possible behaviors of each of its components in their local environments, together with the precise way in which they interact.1 In this chapter, we will discuss a logic wherein one can describe general types of behavior that occur over time, and prove properties of a larger-scale system from the properties and interaction patterns of its components. For example, suppose we want an autonomous vehicle to maintain a distance of some safe R from other objects. To do so, several components must interact: a 2 sensor that approximates the real distance by an internal variable S0, a controller that uses S0 to decide what action A to take, and a motor that moves the vehicle with an 1 The well-known concept of emergence is not about possibilities, it is about prediction.
    [Show full text]
  • Diagram Chasing in Abelian Categories
    Diagram Chasing in Abelian Categories Toni Annala Contents 1 Overview 2 2 Abelian Categories 3 2.1 Denition and basic properties . .3 2.2 Subobjects and quotient objects . .6 2.3 The image and inverse image functors . 11 2.4 Exact sequences and diagram chasing . 16 1 Chapter 1 Overview This is a short note, intended only for personal use, where I x diagram chasing in general abelian categories. I didn't want to take the Freyd-Mitchell embedding theorem for granted, and I didn't like the style of the Freyd's book on the topic. Therefore I had to do something else. As this was intended only for personal use, and as I decided to include this to the application quite late, I haven't touched anything in chapter 2. Some vague references to Freyd's book are made in the passing, they mean the book Abelian Categories by Peter Freyd. How diagram chasing is xed then? The main idea is to chase subobjects instead of elements. The sections 2.1 and 2.2 contain many standard statements about abelian categories, proved perhaps in a nonstandard way. In section 2.3 we dene the image and inverse image functors, which let us transfer subobjects via a morphism of objects. The most important theorem in this section is probably 2.3.11, which states that for a subobject U of X, and a morphism f : X ! Y , we have ff −1U = U \ imf. Some other results are useful as well, for example 2.3.2, which says that the image functor associated to a monic morphism is injective.
    [Show full text]
  • E(6,<F>) = {Geg1:(,(G) = <L>(G)}
    PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 42, Number 1, January 1974 THE FIRST DERIVED EQUALISER OF A PAIR OF ABELIAN GROUP HOMOMORPHISMS TIM PORTER Abstract. In this note we attack the problem of classifying a pair of abelian group homomorphisms by introducing a con- struction which we call "the derived equaliser". After developing fairly simple methods for the calculation of these objects, we work an example in a simple case. Introduction. The simplicity of the classification, up to isomorphism, of group homomorphisms by their kernels and cokernels tends to over- shadow the problem for two or more homomorphisms. Recall that the First Isomorphism Theorem allows one to write any homomorphism as a composite of an epimorphism and an inclusion of a subgroup; the epi- morphism is determined (up to isomorphism of group homomorphisms) by its kernel, and the inclusion can either be regarded as an invariant itself or it can be determined by its cokernel. The diagram (1) Gi=*G* where d and <f>have isomorphic kernels and cokernels, may be very different indeed from the diagram, (2) <?i=*Gt where the two maps also have isomorphic kernels and cokernels. A first approximation to a classification of such pairs of homomorphisms is via their "equaliser" or "difference kernel" [1] which measures how much they differ. The equaliser of 6 and <f>in (1) is the subgroup E(6,<f>)= {geG1:(,(g)= <l>(g)}. This is by no means a complete invariant, but in this paper we will in- vestigate certain "derived invariants" of this for the case that Gr and G2 are abelian groups.
    [Show full text]
  • Ten Questions for Mathematics Teachers
    Teaching strategies Cognitive activation Lessons drawn Classroom climate Students’ attitudes Memorisation Pure & applied maths Control Socio-economic status Elaboration strategies Ten Questions for Mathematics Teachers ... and how PISA can help answer them PISA Ten Questions for Mathematics Teachers ... and how PISA can help answer them This work is published under the responsibility of the Secretary-General of the OECD. The opinions expressed and the arguments employed herein do not necessarily reflect the official views of the OECD member countries. This document and any map included herein are without prejudice to the status of or sovereignty over any territory, to the delimitation of international frontiers and boundaries and to the name of any territory, city or area. Please cite this publication as: OECD (2016), Ten Questions for Mathematics Teachers ... and how PISA can help answer them, PISA, OECD Publishing, Paris, http://dx.doi.or /10.1787/9789264265387-en. ISBN 978-9264-26537-0 (print) ISBN 978-9264-26538-7 (online) Series: PISA ISSN 1990-85 39 (print) ISSN 1996-3777 (online) The statistical data for Israel are supplied by and under the responsibility of the relevant Israeli authorities. The use of such data by the OECD is without prejudice to the status of the Golan Heights, East Jerusalem and Israeli settlements in the West Bank under the terms of international law. Latvia was not an OECD member at the time of preparation of this publication. Accordingly, Latvia is not included in the OECD average. Corrigenda to OECD publications may be found on line at: www.oecd.org/publishing/corrigenda. © OECD 2016 You can copy, download or print OECD content for your own use, and you can include excerpts from OECD publications, databases and multimedia products in your own documents, presentations, blogs, websites and teaching materials, provided that suitable acknowledgement of OECD as source and copyright owner is given.
    [Show full text]
  • VII Sheaf Theory
    VII Sheaf Theory Claudia Centazzo and Enrico M. Vitale 1. Introduction To write a few lines of introduction to a few pages of work on a real corner stone of mathematics like sheaf theory is not an easy task. So, let us try with . two introductions. 1.1. First introduction: for students (and everybody else). In the study of ordinary differential equations, when you face a Cauchy problem of the form n (n) 0 (n¡1) (i) (i) y = f(x; y; y ; : : : ; y ) ; y (x0) = y0 you know that the continuity of f is enough to get a local solution, i.e. a solution defined on an open neighborhood Ux0 of x0: But, to guarantee the existence of a global solution, the stronger Lipschitz condition on f is required. P n In complex analysis, we know that a power series an(z ¡ z0) uniformly converges on any compact space strictly contained in the interior of the convergence disc. This is equivalent to the local uniform convergence: for any z in the open disc, there is an open neighborhood Uz of z on which the series converges uniformly. But local uniform convergence does not imply uniform convergence on the whole disc. This gap between local uniform convergence and global uniform convergence is the reason why the theory of Weierstrass analytic functions exists. These are only two simple examples, which are part of everybody’s basic knowl- edge in mathematics, of the passage from local to global. Sheaf theory is precisely meant to encode and study such a passage. Sheaf theory has its origin in complex analysis (see, for example, [18]) and in the study of cohomology of spaces [8] (see also [26] for a historical survey of sheaf theory).
    [Show full text]