87 Pages

1201-005

Course: MATH 1201, Fall 2008
School: UCLA
Rating:
 
 
 
 
 

Word Count: 68525

Document Preview

Bulletin The of Symbolic Logic Volume 12, Number 1, March 2006 REVIEWS The Association for Symbolic Logic publishes analytical reviews of selected books and articles in the eld of symbolic logic. The reviews were published in The Journal of Symbolic Logic from the founding of the Journal in 1936 until the end of 1999. The Association moved the reviews to this Bulletin, beginning in 2000. The Reviews Section is...

Register Now

Unformatted Document Excerpt

Coursehero >> California >> UCLA >> MATH 1201

Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

Course Hero has millions of student submitted documents similar to the one below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.
Bulletin The of Symbolic Logic Volume 12, Number 1, March 2006 REVIEWS The Association for Symbolic Logic publishes analytical reviews of selected books and articles in the eld of symbolic logic. The reviews were published in The Journal of Symbolic Logic from the founding of the Journal in 1936 until the end of 1999. The Association moved the reviews to this Bulletin, beginning in 2000. The Reviews Section is edited by Alasdair Urquhart (Managing Editor), Steve Awodey, John Baldwin, Lev Beklemishev, Mirna D amonja, David Evans, Erich Gr del, Denis z a Hirschfeldt, Roger Maddux, Luke Ong, Grigori Mints, Volker Peckhaus, and Sawomir Solecki. Authors and publishers are requested to send, for review, copies of books to ASL, Box 742, Vassar College, 124 Raymond Avenue, Poughkeepsie, NY 12604, USA. In a review, a reference JSL XLIII 148, for example, refers either to the publication reviewed on page 148 of volume 43 of the Journal, or to the review itself (which contains full bibliographical information for the reviewed publication). Analogously, a reference BSL VII 376 refers to the review beginning on page 376 in volume 7 of this Bulletin, or to the publication there reviewed. JSL LV 347 refers to one of the reviews or one of the publications reviewed or listed on page 347 of volume 55 of the Journal, with reliance on the context to show which one is meant. The reference JSL LIII 318(3) is to the third item on page 318 of volume 53 of the Journal, that is, to van Heijenoorts Frege and vagueness, and JSL LX 684(8) refers to the eighth item on page 684 of volume 60 of the Journal, that is, to Tarskis Truth and proof. References such as 495 or 2801 are to entries so numbered in A bibliography of symbolic logic (the Journal, vol. 1, pp. 121218). Ilijas Farah. Analytic quotients. Memoirs of the American Mathematical Society vol. 148 no. 702, American Mathematical Society, Providence, R.I., 2000, xvi + 177 pp. The Boolean algebra PN of subsets of the natural numbers has some very well-known ideals, starting with the ideal [N]< of nite sets and the ideal Z of sets of asymptotic density zero; going a little farther we have the ideal Zlog of sets A N such that n lim 1X1 = 0. ln n i An i + 1 For any such ideal we can consider the corresponding quotient Boolean algebra PN/I. The algebra PN/[N]< has long been recognised as one of the fundamental objects of set-theoretic analysis, topology and combinatorics. The others have not been studied so systematically, but show on the briefest of acquaintanceships the potential for generating fascinating questions. In this extraordinary monograph we are given some tools for tackling these questions which are surely going to be part of the essential kit for anyone working in the area. The most striking results concern the representation of Boolean homomorphisms between quotient algebras in terms of functions from PN to itself or between conite subsets of N. The rst steps are already far from being obvious; we need denitions which will lead to a useful classication scheme. One is well known. A P-ideal is an ideal I such that for every sequence In nN in I there is an I I such that In \ I is nite for every n. The next is natural enough to the lateral thinker: an ideal I is analytic if it is an analytic c 2006, Association for Symbolic Logic 1079-8986/06/1201-0005/$2.70 126 REVIEWS 127 subset of PN when PN is given its usual compact metric topology, that is, is identied with the Cantor set in [0, 1]. Returning to the combinatorial aspect, I is ccc over [N]< if for any uncountable family A PN \ I there are distinct a, b A such that a b is innite. Concerning homomorphisms between quotient spaces, let us say that a function F : PN PN represents : PN/I PN/J if (a ) = (F (a)) for every a N. We shall be looking for representations F which are continuous, or have the Baire property, or are asymptotically additive, that is, for which there are disjoint sequences Ki i N , Li i N S in [N]< such that F (a) = i N F (a Ki ) Li for every a N. A striking facteasy to prove when you know howis that a Boolean homomorphism between quotients has a continuous representation i it has a representation with the Baire property. Our starting point is the following remarkable result due to S. Solecki (Annals of Pure and Applied Logic, vol. 99 (1999) pp. 5172): a proper ideal of PN containing all nite sets is an analytic P-ideal i it is of the form Exh( ) for some lower semi-continuous submeasure on PN. I see I have to give some more denitions. A submeasure on PN is a functional : PN [0, ] such that () = 0 and (a) (a b) (a) + (b) for all a, b N. It is lower semi-continuous if it is lower semi-continuous for the topology of PN, that is, if (a) = limn (a n) for every a N. Now Exh( ) is the ideal {a : limn (a \n) = 0}. 1 If (a) = 1 for every non-empty set a, Exh( ) = [N]< ; if (a) = supn1 n #(a n), Exh( ) = Z. One more denition. A submeasure on PN is entirely non-pathological if whenever a N and > 0 there is an additive functional : PN [0, [ such that and a + a; it is easy to check that naturally arising submeasures generally have this property. Now I can state one of the new theorems from this memoir. If is an entirely non-pathological lower semi-continuous submeasure on PN, I is an ideal including [N]< , and : PN/I PN/ Exh( ) is a Boolean homomorphism, then has a continuous representation i there is an h : N N such that a = h 1 [a] for every a N. The proof uses some remarkable calculations on nite sets. The requirement that a homomorphism should have a continuous representation is visibly a strong one, and even after discovering that our favourite ideals are derivable from good submeasures most of us would expect the last theorem to have limited applicability. And indeed there are simple examples of homomorphisms, either injective or surjective, which do not have continuous representations. But we come now to the heart of the monograph. a S. Shelah and J. Stepr ns (Proceedings of the American Mathematical Society, vol. 104 (1988) pp. 12201225) showed that if the Proper Forcing Axiom is true then every automorphism of PN/[N]< is trivial, that is, there are conite sets I , J N and a bijection h : J I such that a = h 1 [a] for every a N. Here we nd that if PFA is true, I and J are analytic P-ideals, and : PN/I PN/J is a Boolean isomorphism, then has a continuous representation; if J is of the form Exh( ) for some entirely non-pathological submeasure , then is trivial. For these results we have to work hard. The key seems to be to look at the ideal K of those a N such that the restriction of to the principal ideal generated by a can be represented by a continuous function, and show that K is ccc over [N]< , that a single continuous function can represent on the ideal {a : a K}, that thi...
Find millions of documents on Course Hero - Study Guides, Lecture Notes, Reference Materials, Practice Exams and more. Course Hero has millions of course specific materials providing students with the best way to expand their education.

Below is a small sample set of documents:

UCLA - MATH - 1201
The Bulletin of Symbolic Logic Volume 12, Number 1, March 20062005 ANNUAL MEETING OF THE ASSOCIATION FOR SYMBOLIC LOGIC Stanford University, Stanford, CA March 1922, 2005The Annual Meeting of the Association was held on the campus of Stanford Univ
UCLA - MATH - 1201
The Bulletin of Symbolic Logic Volume 12, Number 1, March 2006NOTICES The 2005 Sacks Prize Awarded to A. Montalban. The ASL Committee on Prizes and Awards has selected Antonio Montalb n of the the University of Chicago as the recipient of a the
UCLA - CS - 232
Object-Oriented Type InferenceJens Palsberg and Michael I. Schwartzbachpalsberg@daimi.aau.dk and mis@daimi.aau.dkComputer Science Department, Aarhus University Ny Munkegade, DK-8000 rhus C, Denmark AAbstractWe present a new approach to inferri
UCLA - CS - 232
Scalable Propagation-Based Call Graph Construction AlgorithmsFrank TipIBM T.J. Watson Research Center P.O. Box 704 Yorktown Heights, NY 10598Jens PalsbergDept. of Computer Science Purdue University West Lafayette, IN 47907tip@watson.ibm.com AB
UCLA - CS - 232
Closure Analysis in Constraint FormJENS PALSBERG Aarhus UniversityFlow analyses of untyped higher-order functional programs have in the past decade been presented by Ayers, Bondorf, Consel, Jones, Heintze, Sestoft, Shivers, Steckler, Wand, and oth
UCLA - CS - 232
Register Allocation via Coloring of Chordal GraphsFernando Magno Quinto Pereira and Jens Palsberg aUCLA Computer Science Department University of California, Los AngelesAbstract. We present a simple algorithm for register allocation which is comp
UCLA - CS - 232
Type-Safe Method InliningNeal Glew a Jens Palsberg bCorporation Santa Clara, CA 95054 aglew@acm.org Computer Science Department 4531K Boelter Hall, Los Angeles, CA 90095 palsberg@ucla.edub UCLA a IntelAbstract In a typed language such as Java, i
UCLA - CS - 232
A Type System Equivalent to Flow Analysis Jens Palsberg Patrick OKeefeAbstract Flow-based safety analysis of higher-order languages has been studied by Shivers, and Palsberg and Schwartzbach. Open until now is the problem of nding a type system tha
UCLA - CS - 232
Stack Size Analysis for Interrupt-driven Programs 1Krishnendu Chatterjee a Di Ma c Rupak Majumdar e Tian Zhao d Thomas A. Henzinger a,b Jens Palsberg e,a Departmentof Electrical Engineering and Computer Sciences University of California, Berkeley
UCLA - M - 230
UCLA - MATH - 0202
The Bulletin of Symbolic Logic Volume 2, Number 2, June 1996THE DISCOVERY OF MY COMPLETENESS PROOFSLEON HENKINDedicated to my teacher, Alonzo Church, in his 91st year. 1. Introduction. This paper deals with aspects of my doctoral dissertation1
UCLA - MATH - 0203
The Bulletin of Symbolic Logic Volume 2, Number 3, Sept. 1996COMPUTABILITY AND RECURSIONROBERT I. SOAREAbstract. We consider the informal concept of computability or eective calculability and two of the formalisms commonly used to dene it, (Tur
UCLA - CS - 268
Lecture 1: IntroductionAdministrivia Why vision? Where are we at? What you need to know Quick review of linear algebra, optimizationStefano Soatto (c)UCLA Vision Lab1What is vision?From the 3-D world to 2-D images: image format
UCLA - CS - 268
CS268: MACHINE PERCEPTIONLab 2 Due according to schedule on websiteThis assignment is meant to help you familiarize with rigid, ane, projective transformations as well as with linear, least-squares estimation. Dowload from the class website the 6 p
UCLA - CS - 268
CS268: MACHINE PERCEPTIONLab 1 Due according to schedule on websiteThis assignment is meant for you to familiarize with the programming environment. We will assume by default that you have Matlab available. This is the case if you are using a CS de
UCLA - CS - 268
A PRIMER IN PROJECTIVE GEOMETRYProjective geometry can be approached in many ways.It can be conceived as an extension of Euclidean geometry, by adding points where lines that never meet (parallels) do meet (points at innity). The construction of pr
UCLA - CS - 268
Fundamentals of Image Processinghany.farid@dartmouth.edu http:/www.cs.dartmouth.edu/~farid0. Mathematical Foundations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 0.1: Vectors 0.2: Matrices 0.3: Vect
UCLA - EE - 103
UCLA Fall Quarter 2008-09Electrical Engineering 103 Applied Numerical ComputingProfessor L. VandenbergheNotes written in collaboration with S. Boyd (Stanford Univ.)Contents1 Vectors 1.1 Denitions and notation . . 1.2 Zero and unit vectors . .
UCLA - EE - 103
EE103 (Fall 2008-09)1. Vectors denition and notation inner products and norms linear functions angle between vectors11Vectorsn-vector x: x1 x2 x= . . xn set of n-vectors is denoted Rn also written as x = (x1, x2, . . . , xn) xi
UCLA - EE - 103
EE103 (Fall 2008-09)Vectorsn-vector x: x1 x x = .2 . xn 1. Vectors denition and notation inner products and norms linear functions angle between vectors set of n-vectors is denoted Rn also written as x = (x1, x2, . . . , xn) xi: i
UCLA - EE - 103
EE103 (Fall 2008-09)2. Matrices denition and notation matrix-vector product matrix-matrix product matrix inverse orthogonal matrices cost of matrix operations21Matricesm n-matrix A: a11 a12 a1n a21 a22 a2n A= . . . . . . . am1 a
UCLA - EE - 103
EE103 (Fall 2008-09)Matricesm n-matrix A:2. Matrices denition and notation matrix-vector product matrix-matrix product matrix inverse orthogonal matrices cost of matrix operations a11 a12 a1n a a22 a2n A = 21 . . . . . . . am1 am
UCLA - EE - 103
EE103 (Fall 2008-09)3. Linear equations linear equations example: polynomial interpolation applications geometrical interpretation left and right inverse range and nullspace31Linear equationsm equations in n variables x1, x2, . . . , xn:
UCLA - EE - 103
EE103 (Fall 2008-09)4. Triangular matrices terminology forward and backward substitution inverse41Terminologya square matrix A is lower triangular if aij = 0 for j &gt; i a11 a21 . . 0 a22 . . 0 0 0 0 . 0 0 an1,n1 0 an,n1 ann
UCLA - EE - 103
EE103 (Fall 2008-09)Terminologya square matrix A is lower triangular if aij = 0 for j &gt; i a11 a21 . . 0 a22 . . 0 0 0 0 . 0 0 an1,n1 0 an,n1 ann 4. Triangular matrices terminology forward and backward substitution inverse A=
UCLA - EE - 103
EE103 (Fall 2008-09)5. The Cholesky factorization positive (semi-)denite matrices examples the Cholesky factorization solving Ax = b with A positive denite inverse of a positive denite matrix permutation matrices sparse Cholesky factorizatio
UCLA - EE - 103
EE103 (Fall 2008-09)Positive (semi-)denite matrices A is positive denite if A is symmetric and xT Ax &gt; 0 for all x = 0 A is positive semidenite if A is symmetric and xT Ax 0 for all x Note: if A is symmetric of order n, thenn n n5. The Choles
UCLA - EE - 103
EE103 (Fall 2008-09)6. The LU factorization factor-solve method nonsingular matrices LU factorization solving Ax = b with A nonsingular the inverse of a nonsingular matrix LU factorization algorithm eect of rounding error sparse LU factoriz
UCLA - EE - 103
EE103 (Fall 2008-09)Factor-solve approachto solve Ax = b, rst write A as a product of simple matrices A = A1 A2 Ak6. The LU factorization factor-solve method nonsingular matrices LU factorization solving Ax = b with A nonsingular the inv
UCLA - EE - 103
EE103 (Fall 2008-09)7. The condition number Ax = b when A is singular condition of a set of linear equations matrix norm condition number71Linear equations with singular coecient matrixif A is nonsingular, then Ax = b has a unique solutio
UCLA - EE - 103
EE103 (Fall 2008-09)Linear equations with singular coecient matrixif A is nonsingular, then Ax = b has a unique solution for every b if A is singular, then Ax = b has zero or innitely many solutions:7. The condition number Ax = b when A is sin
UCLA - EE - 103
EE103 (Fall 2008-09)8. Linear least-squares denition examples and applications81DenitionOverdetermined linear equations Ax = b for most b, cannot solve for x Least-squares formulation m n(A is m n with m &gt; n)minimizeAx b = (i=1
UCLA - EE - 103
EE103 (Fall 2008-09)DenitionOverdetermined linear equations Ax = b for most b, cannot solve for x (A is m n with m &gt; n)8. Linear least-squares denition examples and applicationsLeast-squares formulation m nminimizeAx b = (i=1 j=1
UCLA - EE - 103
EE103 (Fall 2008-09)9. The solution of a least-squares problem geometric interpretation left inverse of a zero nullspace matrix the solution of a least-squares problem the normal equations91Geometric interpretation of a LS problemminimiz
UCLA - EE - 103
EE103 (Fall 2008-09)Geometric interpretation of a LS problem9. The solution of a least-squares problemminimize A is m n with columns a1, . . . , an geometric interpretation left inverse of a zero nullspace matrix the solution of a least-squa
UCLA - EE - 103
EE103 (Fall 2008-09)10. The QR factorization solving the normal equations the QR factorization orthogonal matrices modied Gram-Schmidt algorithm Cholesky factorization versus QR factorization101Least-squares methodsminimize (A is m n w
UCLA - EE - 103
EE103 (Fall 2008-09)Least-squares methods10. The QR factorizationminimize solving the normal equations the QR factorization orthogonal matrices modied Gram-Schmidt algorithm Cholesky factorization versus QR factorization (A is m n with a z
UCLA - EE - 103
EE103 (Fall 2008-09)11. Least-norm problems denition and examples right inverse of a full range matrix the least-norm solution computing the least-norm solution111DenitionUnderdetermined linear equations Ax = b (A is m n with m &lt; n) x
UCLA - EE - 103
EE103 (Fall 2008-09)12. Nonlinear equations with one variable denition and examples bisection method Newtons method secant method121Denition and examplesx is a zero (or root) of a function f if f (x) = 0 Examples f (x) = ex has no zeros
UCLA - EE - 103
EE103 (Fall 2008-09)Denition and examplesx is a zero (or root) of a function f if f (x) = 0 Examples12. Nonlinear equations with one variable denition and examples bisection method Newtons method secant method f (x) = ex has no zeros f (
UCLA - EE - 103
EE103 (Fall 2008-09)13. Newtons method for sets of nonlinear equations sets of nonlinear equations the derivative matrix and linearization Newtons method examples131Sets of nonlinear equationsn nonlinear equations in n variables f1(x1, .
UCLA - EE - 103
EE103 (Fall 2008-09)Sets of nonlinear equationsn nonlinear equations in n variables f1(x1, . . . , xn) = 0 f2(x1, . . . , xn) = 0 . . fn(x1, . . . , xn) = 0 in vector notation: f (x) = 0 where x Rn and f : Rn Rn are dened as f1(x1, . . . , xn)
UCLA - EE - 103
EE103 (Fall 2008-09)14. Unconstrained minimization terminology gradient and Hessian Newtons method141Unconstrained minimization problemminimize g(x1, x2, . . . , xn) g : Rn R (a function that maps n-vectors to scalars) x = (x1, x2, . .
UCLA - EE - 103
EE103 (Fall 2008-09)Unconstrained minimization problem14. Unconstrained minimizationminimize g(x1, x2, . . . , xn) g : Rn R (a function that maps n-vectors to scalars) terminology gradient and Hessian x = (x1, x2, . . . , xn) are the optimiz
UCLA - EE - 103
EE103 (Fall 2008-09)15. Nonlinear least-squares denition Newtons method Gauss-Newton method151Nonlinear least-squaresmminimizei=1ri(x)2 = r(x)2 ri is a nonlinear function of the n-vector of variables x r(x) = (r1(x), r2(x), . .
UCLA - EE - 103
EE103 (Fall 2008-09)15. Nonlinear least-squares denition Newtons method Gauss-Newton method151Nonlinear least-squaresmminimizei=1ri(x)2 = r(x)2 ri is a nonlinear function of the n-vector of variables x r(x) = (r1(x), r2(x), . .
UCLA - EE - 103
EE103 (Fall 2008-09)16. IEEE oating point numbers oating point numbers with base 10 oating point numbers with base 2 IEEE oating point standard machine precision rounding error161Floating point numbers with base 10x = (.d1d2 . . . dn)1
UCLA - EE - 103
EE103 (Fall 2008-09)Floating point numbers with base 1016. IEEE oating point numbersx = (.d1d2 . . . dn)10 10e oating point numbers with base 10 oating point numbers with base 2 IEEE oating point standard Interpretation: x = (d1101 + d2102
UCLA - EE - 103
EE103 (Fall 2008-09)17. Problem conditioning and stability of algorithms the conditioning of a problem the numerical stability of an algorithm cancellation171Sources of error in numerical computationExample: evaluate a function f : R R at
UCLA - EE - 103
EE103 (Fall 2008-09)Sources of error in numerical computationExample: evaluate a function f : R R at a given x (e.g., f (x) = sin x) sources of error in the result: x is not exactly known17. Problem conditioning and stability of algorithms t
UCLA - EE - 103
EE103 (Fall 2008-09)18. Ordinary dierential equations initial value problem examples forward and backward Euler method181Initial value problemFirst-order ordinary dierential equation (ODE) dx(t) = f (x(t), t), dt t usually represents time
UCLA - EE - 103
EE103 (Fall 2008-09)Initial value problemFirst-order ordinary dierential equation (ODE) dx(t) = f (x(t), t), dt x(0) = x018. Ordinary dierential equations initial value problem examples forward and backward Euler method t usually represent
UCLA - IPAM - 5
Institute for Pure and Applied Mathematics University of California, Los Angeles presentsMultiscale Geometry and Analysis in High Dimensions Workshop V: Math Analysis and Multiscale Geometric AnalysisNovember 15-19, 2004Members of the Organizing
UCLA - AAS - 116
A Truly American Experience By Jacqueline PonI would not be where I am today without the courage and hard work of my maternal and paternal grandparents. I was raised in an upper- middle class neighborhood in San Francisco and never felt like I was
UCLA - AAS - 116
My Struggles with Self and Society By Charito ViloriaMy name is Charito Viloria, and I am a 20-year-old first generation Pilipino-American, whose mother is a Registered Nurse and father is retired Navy. Born and raised in San Diego, California, Ive
UCLA - AAS - 116
Discoveries Terrible and Magnificent By Ali WongI was born in San Francisco April 19, 1982. While I lived in a neighborhood and went to school composed of predominantly wealthy white communities, I spent all of my summers and Friday nights at Donal
UCLA - AAS - 116
Try and Unite By Hanna KimMy name is Hanna Kim, and I had been a transfer student at Los Angeles City College. I wrote a grievance letter to LACC administrators because of an incident that occurred in my Asian American Studies class Monday night, 2
UCLA - AAS - 116
Learning from the Residents of Boston Chinatown By Katie LiHaaah? Tai dai sang ah! yelled an elderly Chinese woman wearing a set of earphones with the volume obviously turned up too loud. I rushed over to her, adjusted her walkman- looking machine,
UCLA - AAS - 116
My Life Is Connected to the Lives of My Ancestors By Karyn OkadaAs a fourth generation Japanese American, my life has intersected history in numerous ways. In this, I am speaking not only of my personal history, but also the histories of my ancesto
UCLA - AAS - 116
Walking the Same Streets as Carlos Bulosan By Marc LorestoThis essay will connect my life to history to the history of Filipino immigration to the United States and the racism experienced by them as well as other Asian minorities. I was born in Lo
UCLA - AAS - 116
Making a Difference in the World By Alejandro LopezThe journey began when my parents, my oldest brother and my two sisters left the state of Guanajuato in the country of Mexico in 1975. Like many others who have migrated, my father (who was a const