From Boolean Valued Analysis to Quantum Set Theory: Mathematical Worldview of Gaisi Takeuti †
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
On the Lattice Structure of Quantum Logic
BULL. AUSTRAL. MATH. SOC. MOS 8106, *8IOI, 0242 VOL. I (1969), 333-340 On the lattice structure of quantum logic P. D. Finch A weak logical structure is defined as a set of boolean propositional logics in which one can define common operations of negation and implication. The set union of the boolean components of a weak logical structure is a logic of propositions which is an orthocomplemented poset, where orthocomplementation is interpreted as negation and the partial order as implication. It is shown that if one can define on this logic an operation of logical conjunction which has certain plausible properties, then the logic has the structure of an orthomodular lattice. Conversely, if the logic is an orthomodular lattice then the conjunction operation may be defined on it. 1. Introduction The axiomatic development of non-relativistic quantum mechanics leads to a quantum logic which has the structure of an orthomodular poset. Such a structure can be derived from physical considerations in a number of ways, for example, as in Gunson [7], Mackey [77], Piron [72], Varadarajan [73] and Zierler [74]. Mackey [77] has given heuristic arguments indicating that this quantum logic is, in fact, not just a poset but a lattice and that, in particular, it is isomorphic to the lattice of closed subspaces of a separable infinite dimensional Hilbert space. If one assumes that the quantum logic does have the structure of a lattice, and not just that of a poset, it is not difficult to ascertain what sort of further assumptions lead to a "coordinatisation" of the logic as the lattice of closed subspaces of Hilbert space, details will be found in Jauch [8], Piron [72], Varadarajan [73] and Zierler [74], Received 13 May 1969. -
Relational Quantum Mechanics
Relational Quantum Mechanics Matteo Smerlak† September 17, 2006 †Ecole normale sup´erieure de Lyon, F-69364 Lyon, EU E-mail: [email protected] Abstract In this internship report, we present Carlo Rovelli’s relational interpretation of quantum mechanics, focusing on its historical and conceptual roots. A critical analysis of the Einstein-Podolsky-Rosen argument is then put forward, which suggests that the phenomenon of ‘quantum non-locality’ is an artifact of the orthodox interpretation, and not a physical effect. A speculative discussion of the potential import of the relational view for quantum-logic is finally proposed. Figure 0.1: Composition X, W. Kandinski (1939) 1 Acknowledgements Beyond its strictly scientific value, this Master 1 internship has been rich of encounters. Let me express hereupon my gratitude to the great people I have met. First, and foremost, I want to thank Carlo Rovelli1 for his warm welcome in Marseille, and for the unexpected trust he showed me during these six months. Thanks to his rare openness, I have had the opportunity to humbly but truly take part in active research and, what is more, to glimpse the vivid landscape of scientific creativity. One more thing: I have an immense respect for Carlo’s plainness, unaltered in spite of his renown achievements in physics. I am very grateful to Antony Valentini2, who invited me, together with Frank Hellmann, to the Perimeter Institute for Theoretical Physics, in Canada. We spent there an incredible week, meeting world-class physicists such as Lee Smolin, Jeffrey Bub or John Baez, and enthusiastic postdocs such as Etera Livine or Simone Speziale. -
The Mathematical Structure of the Aesthetic
Preprints (www.preprints.org) | NOT PEER-REVIEWED | Posted: 12 June 2017 doi:10.20944/preprints201706.0055.v1 Peer-reviewed version available at Philosophies 2017, 2, 14; doi:10.3390/philosophies2030014 Article A New Kind of Aesthetics – The Mathematical Structure of the Aesthetic Akihiro Kubota 1,*, Hirokazu Hori 2, Makoto Naruse 3 and Fuminori Akiba 4 1 Art and Media Course, Department of Information Design, Tama Art University, 2-1723 Yarimizu, Hachioji, Tokyo 192-0394, Japan; [email protected] 2 Interdisciplinary Graduate School, University of Yamanashi, 4-3-11 Takeda, Kofu,Yamanashi 400-8511, Japan; [email protected] 3 Network System Research Institute, National Institute of Information and Communications Technology, 4-2-1 Nukui-kita, Koganei, Tokyo 184-8795, Japan; [email protected] 4 Philosophy of Information Group, Department of Systems and Social Informatics, Nagoya University, Furo-cho, Chikusa-ku, Nagoya, Aichi 464-8601, Japan; [email protected] * Correspondence: [email protected]; Tel.: +81-42-679-5634 Abstract: This paper proposes a new approach to investigation into the aesthetics. Specifically, it argues that it is possible to explain the aesthetic and its underlying dynamic relations with axiomatic structure (the octahedral axiom derived category) based on contemporary mathematics – namely, category theory – and through this argument suggests the possibility for discussion about the mathematical structure of the aesthetic. If there was a way to describe the structure of aesthetics with the language of mathematical structures and mathematical axioms – a language completely devoid of arbitrariness – then we would make possible a synthetical argument about the essential human activity of “the aesthetics”, and we would also gain a new method and viewpoint on the philosophy and meaning of the act of creating a work of art and artistic activities. -
500 Natural Sciences and Mathematics
500 500 Natural sciences and mathematics Natural sciences: sciences that deal with matter and energy, or with objects and processes observable in nature Class here interdisciplinary works on natural and applied sciences Class natural history in 508. Class scientific principles of a subject with the subject, plus notation 01 from Table 1, e.g., scientific principles of photography 770.1 For government policy on science, see 338.9; for applied sciences, see 600 See Manual at 231.7 vs. 213, 500, 576.8; also at 338.9 vs. 352.7, 500; also at 500 vs. 001 SUMMARY 500.2–.8 [Physical sciences, space sciences, groups of people] 501–509 Standard subdivisions and natural history 510 Mathematics 520 Astronomy and allied sciences 530 Physics 540 Chemistry and allied sciences 550 Earth sciences 560 Paleontology 570 Biology 580 Plants 590 Animals .2 Physical sciences For astronomy and allied sciences, see 520; for physics, see 530; for chemistry and allied sciences, see 540; for earth sciences, see 550 .5 Space sciences For astronomy, see 520; for earth sciences in other worlds, see 550. For space sciences aspects of a specific subject, see the subject, plus notation 091 from Table 1, e.g., chemical reactions in space 541.390919 See Manual at 520 vs. 500.5, 523.1, 530.1, 919.9 .8 Groups of people Add to base number 500.8 the numbers following —08 in notation 081–089 from Table 1, e.g., women in science 500.82 501 Philosophy and theory Class scientific method as a general research technique in 001.4; class scientific method applied in the natural sciences in 507.2 502 Miscellany 577 502 Dewey Decimal Classification 502 .8 Auxiliary techniques and procedures; apparatus, equipment, materials Including microscopy; microscopes; interdisciplinary works on microscopy Class stereology with compound microscopes, stereology with electron microscopes in 502; class interdisciplinary works on photomicrography in 778.3 For manufacture of microscopes, see 681. -
A Characterization of the Canonical Extension of Boolean
A CHARACTERIZATION OF THE CANONICAL EXTENSION OF BOOLEAN HOMOMORPHISMS LUCIANO J. GONZALEZ´ Abstract. This article aims to obtain a characterization of the canon- ical extension of Boolean homomorphisms through the Stone-Cechˇ com- pactification. Then, we will show that one-to-one homomorphisms and onto homomorphisms extend to one-to-one homomorphisms and onto homomorphisms, respectively. 1. Introduction The concept of canonical extension of Boolean algebras with operators was introduced and studied by J´onsson and Tarski [13, 14]. Then, the notion of canonical extension was naturally generalized to the setting of distribu- tive lattices with operators [7]. Later on, the notion of canonical extension was generalized to the setting of lattices [8, 9, 6], and the more general setting of partially ordered sets [3]. The theory of completions for ordered algebraic structures, and in particular the theory of canonical extensions, is an important and useful tool to obtain complete relational semantics for several propositional logics such as modal logics, superintuitionistic logics, fragments of substructural logics, etc., see for instance [1, 5, 10, 16, 3]. The theory of Stone-Cechˇ compactifications of discrete spaces and in particular of discrete semigroup spaces has many applications to several branches of mathematics, see the book [12] and its references. Here we are interested in the characterization of the Stone-Cechˇ compactification of a discrete space through of the Stone duality for Boolean algebras. In this paper, we prove a characterization of the canonical extension of a arXiv:1702.06414v2 [math.LO] 1 Jun 2018 Boolean homomorphism between Boolean algebras [13] through the Stone- Cechˇ compactification of discrete spaces and the Stone duality for Boolean algebras. -
1 Elementary Set Theory
1 Elementary Set Theory Notation: fg enclose a set. f1; 2; 3g = f3; 2; 2; 1; 3g because a set is not defined by order or multiplicity. f0; 2; 4;:::g = fxjx is an even natural numberg because two ways of writing a set are equivalent. ; is the empty set. x 2 A denotes x is an element of A. N = f0; 1; 2;:::g are the natural numbers. Z = f:::; −2; −1; 0; 1; 2;:::g are the integers. m Q = f n jm; n 2 Z and n 6= 0g are the rational numbers. R are the real numbers. Axiom 1.1. Axiom of Extensionality Let A; B be sets. If (8x)x 2 A iff x 2 B then A = B. Definition 1.1 (Subset). Let A; B be sets. Then A is a subset of B, written A ⊆ B iff (8x) if x 2 A then x 2 B. Theorem 1.1. If A ⊆ B and B ⊆ A then A = B. Proof. Let x be arbitrary. Because A ⊆ B if x 2 A then x 2 B Because B ⊆ A if x 2 B then x 2 A Hence, x 2 A iff x 2 B, thus A = B. Definition 1.2 (Union). Let A; B be sets. The Union A [ B of A and B is defined by x 2 A [ B if x 2 A or x 2 B. Theorem 1.2. A [ (B [ C) = (A [ B) [ C Proof. Let x be arbitrary. x 2 A [ (B [ C) iff x 2 A or x 2 B [ C iff x 2 A or (x 2 B or x 2 C) iff x 2 A or x 2 B or x 2 C iff (x 2 A or x 2 B) or x 2 C iff x 2 A [ B or x 2 C iff x 2 (A [ B) [ C Definition 1.3 (Intersection). -
Mathematics 144 Set Theory Fall 2012 Version
MATHEMATICS 144 SET THEORY FALL 2012 VERSION Table of Contents I. General considerations.……………………………………………………………………………………………………….1 1. Overview of the course…………………………………………………………………………………………………1 2. Historical background and motivation………………………………………………………….………………4 3. Selected problems………………………………………………………………………………………………………13 I I. Basic concepts. ………………………………………………………………………………………………………………….15 1. Topics from logic…………………………………………………………………………………………………………16 2. Notation and first steps………………………………………………………………………………………………26 3. Simple examples…………………………………………………………………………………………………………30 I I I. Constructions in set theory.………………………………………………………………………………..……….34 1. Boolean algebra operations.……………………………………………………………………………………….34 2. Ordered pairs and Cartesian products……………………………………………………………………… ….40 3. Larger constructions………………………………………………………………………………………………..….42 4. A convenient assumption………………………………………………………………………………………… ….45 I V. Relations and functions ……………………………………………………………………………………………….49 1.Binary relations………………………………………………………………………………………………………… ….49 2. Partial and linear orderings……………………………..………………………………………………… ………… 56 3. Functions…………………………………………………………………………………………………………… ….…….. 61 4. Composite and inverse function.…………………………………………………………………………… …….. 70 5. Constructions involving functions ………………………………………………………………………… ……… 77 6. Order types……………………………………………………………………………………………………… …………… 80 i V. Number systems and set theory …………………………………………………………………………………. 84 1. The Natural Numbers and Integers…………………………………………………………………………….83 2. Finite induction -
Structure” of Physics: a Case Study∗ (Journal of Philosophy 106 (2009): 57–88)
The “Structure” of Physics: A Case Study∗ (Journal of Philosophy 106 (2009): 57–88) Jill North We are used to talking about the “structure” posited by a given theory of physics. We say that relativity is a theory about spacetime structure. Special relativity posits one spacetime structure; different models of general relativity posit different spacetime structures. We also talk of the “existence” of these structures. Special relativity says that the world’s spacetime structure is Minkowskian: it posits that this spacetime structure exists. Understanding structure in this sense seems important for understand- ing what physics is telling us about the world. But it is not immediately obvious just what this structure is, or what we mean by the existence of one structure, rather than another. The idea of mathematical structure is relatively straightforward. There is geometric structure, topological structure, algebraic structure, and so forth. Mathematical structure tells us how abstract mathematical objects t together to form different types of mathematical spaces. Insofar as we understand mathematical objects, we can understand mathematical structure. Of course, what to say about the nature of mathematical objects is not easy. But there seems to be no further problem for understanding mathematical structure. ∗For comments and discussion, I am extremely grateful to David Albert, Frank Arntzenius, Gordon Belot, Josh Brown, Adam Elga, Branden Fitelson, Peter Forrest, Hans Halvorson, Oliver Davis Johns, James Ladyman, David Malament, Oliver Pooley, Brad Skow, TedSider, Rich Thomason, Jason Turner, Dmitri Tymoczko, the philosophy faculty at Yale, audience members at The University of Michigan in fall 2006, and in 2007 at the Paci c APA, the Joint Session of the Aristotelian Society and Mind Association, and the Bellingham Summer Philosophy Conference. -
Math 788M: Computational Number Theory (Instructor’S Notes)
Math 788M: Computational Number Theory (Instructor’s Notes) The Very Beginning: • A positive integer n can be written in n steps. • The role of numerals (now O(log n) steps) • Can we do better? (Example: The largest known prime contains 258716 digits and doesn’t take long to write down. It’s 2859433 − 1.) Running Time of Algorithms: • A positive integer n in base b contains [logb n] + 1 digits. • Big-Oh & Little-Oh Notation (as well as , , ∼, ) Examples 1: log (1 + (1/n)) = O(1/n) Examples 2: [logb n] + 1 log n Examples 3: 1 + 2 + ··· + n n2 These notes are for a course taught by Michael Filaseta in the Spring of 1996 and being updated for Fall of 2007. Computational Number Theory Notes 2 Examples 4: f a polynomial of degree k =⇒ f(n) = O(nk) Examples 5: (r + 1)π ∼ rπ • We will want algorithms to run quickly (in a small number of steps) in comparison to the length of the input. For example, we may ask, “How quickly can we factor a positive integer n?” One considers the length of the input n to be of order log n (corresponding to the number of binary digits n has). An algorithm runs in polynomial time if the number of steps it takes is bounded above by a polynomial in the length of the input. An algorithm to factor n in polynomial time would require that it take O (log n)k steps (and that it factor n). Addition and Subtraction (of n and m): • We are taught how to do binary addition and subtraction in O(log n + log m) steps. -
Group Theory
Appendix A Group Theory This appendix is a survey of only those topics in group theory that are needed to understand the composition of symmetry transformations and its consequences for fundamental physics. It is intended to be self-contained and covers those topics that are needed to follow the main text. Although in the end this appendix became quite long, a thorough understanding of group theory is possible only by consulting the appropriate literature in addition to this appendix. In order that this book not become too lengthy, proofs of theorems were largely omitted; again I refer to other monographs. From its very title, the book by H. Georgi [211] is the most appropriate if particle physics is the primary focus of interest. The book by G. Costa and G. Fogli [102] is written in the same spirit. Both books also cover the necessary group theory for grand unification ideas. A very comprehensive but also rather dense treatment is given by [428]. Still a classic is [254]; it contains more about the treatment of dynamical symmetries in quantum mechanics. A.1 Basics A.1.1 Definitions: Algebraic Structures From the structureless notion of a set, one can successively generate more and more algebraic structures. Those that play a prominent role in physics are defined in the following. Group A group G is a set with elements gi and an operation ◦ (called group multiplication) with the properties that (i) the operation is closed: gi ◦ g j ∈ G, (ii) a neutral element g0 ∈ G exists such that gi ◦ g0 = g0 ◦ gi = gi , (iii) for every gi exists an −1 ∈ ◦ −1 = = −1 ◦ inverse element gi G such that gi gi g0 gi gi , (iv) the operation is associative: gi ◦ (g j ◦ gk) = (gi ◦ g j ) ◦ gk. -
Number Theory
“mcs-ftl” — 2010/9/8 — 0:40 — page 81 — #87 4 Number Theory Number theory is the study of the integers. Why anyone would want to study the integers is not immediately obvious. First of all, what’s to know? There’s 0, there’s 1, 2, 3, and so on, and, oh yeah, -1, -2, . Which one don’t you understand? Sec- ond, what practical value is there in it? The mathematician G. H. Hardy expressed pleasure in its impracticality when he wrote: [Number theorists] may be justified in rejoicing that there is one sci- ence, at any rate, and that their own, whose very remoteness from or- dinary human activities should keep it gentle and clean. Hardy was specially concerned that number theory not be used in warfare; he was a pacifist. You may applaud his sentiments, but he got it wrong: Number Theory underlies modern cryptography, which is what makes secure online communication possible. Secure communication is of course crucial in war—which may leave poor Hardy spinning in his grave. It’s also central to online commerce. Every time you buy a book from Amazon, check your grades on WebSIS, or use a PayPal account, you are relying on number theoretic algorithms. Number theory also provides an excellent environment for us to practice and apply the proof techniques that we developed in Chapters 2 and 3. Since we’ll be focusing on properties of the integers, we’ll adopt the default convention in this chapter that variables range over the set of integers, Z. 4.1 Divisibility The nature of number theory emerges as soon as we consider the divides relation a divides b iff ak b for some k: D The notation, a b, is an abbreviation for “a divides b.” If a b, then we also j j say that b is a multiple of a. -
Why Feynman Path Integration?
Journal of Uncertain Systems Vol.5, No.x, pp.xx-xx, 2011 Online at: www.jus.org.uk Why Feynman Path Integration? Jaime Nava1;∗, Juan Ferret2, Vladik Kreinovich1, Gloria Berumen1, Sandra Griffin1, and Edgar Padilla1 1Department of Computer Science, University of Texas at El Paso, El Paso, TX 79968, USA 2Department of Philosophy, University of Texas at El Paso, El Paso, TX 79968, USA Received 19 December 2009; Revised 23 February 2010 Abstract To describe physics properly, we need to take into account quantum effects. Thus, for every non- quantum physical theory, we must come up with an appropriate quantum theory. A traditional approach is to replace all the scalars in the classical description of this theory by the corresponding operators. The problem with the above approach is that due to non-commutativity of the quantum operators, two math- ematically equivalent formulations of the classical theory can lead to different (non-equivalent) quantum theories. An alternative quantization approach that directly transforms the non-quantum action functional into the appropriate quantum theory, was indeed proposed by the Nobelist Richard Feynman, under the name of path integration. Feynman path integration is not just a foundational idea, it is actually an efficient computing tool (Feynman diagrams). From the pragmatic viewpoint, Feynman path integral is a great success. However, from the founda- tional viewpoint, we still face an important question: why the Feynman's path integration formula? In this paper, we provide a natural explanation for Feynman's path integration formula. ⃝c 2010 World Academic Press, UK. All rights reserved. Keywords: Feynman path integration, independence, foundations of quantum physics 1 Why Feynman Path Integration: Formulation of the Problem Need for quantization.