Lecture 3 Relationships Between Sets and Types
|
|
- Gwenda Barker
- 6 years ago
- Views:
Transcription
1 Lecture 3 Relatonshps Between Sets and Types Marktoberdorf Summer School, 2003
2 From ITT (M-L 82) to CTT (Nuprl 2000) 1. subset types { x : A B } 1983 Math 2. quotent types A // E 1983 Math 3. drect computaton ~ 1986 Provng 4. general recurson y 1986 Programmng 5. recursve types µ xt Data types 6. ntersecton A B 1987 Logc 7. partal objects A 1992 Prog languages 8. unon A B 1995 Symmetry 6 9. top Top 1996 Symmetry subtypng 1996 Classes 2
3 CS Math CS abstracton computablty formalsm modularty classes theores Math abstracton constructvty formalsm modularty categores theores 3
4 Types Revew of Set Theoretc Semantcs Structured Sets A = { α} (HOL, PVS, MML 0 ) ω + ω α rank ω ( α ) Cumulatve Herarchy of Sets 4
5 Goal of Howe s Approach Pure Type Theory a, a,, a 1 2 f ( a) f λxb. p < ab, > ( ) λ xb. < ab, > c a U enlarge Type Theory wth Set Terms a, a,, a 1 2 A γ A 1 2 ( ) ( ) ϕ α f a α, α,, α ( ) ( ) λxb. a b < ab, > < α, β > c a c α ( ) ( ) f λxb. f ϕ c α c α 5
6 Issues wth ML-82, Alf, and Nuprl Type Theores 1. The computaton system s untyped; terms are polymorphc. λx. x? A A for any A ncludng vod λx. 1? Z Z λx. 1? N N < 01, >? N < 01, >? N N Z 6
7 Issues wth ML-82, Alf, and Nuprl Type Theores 2. Sequent hypotheses are dependent, and sequents assert functonalty. ( ) ( ) ( ) A ( a) x : A, x : A x G x, x ext g x, x Notce, A s assumed to be a type, and s assumed 1 2 to be a type for all a? A1, and the sequent asserts that G a a a Aa A a and ( 1, 2) s a type for all 1?, 2? 2( 1) (, ) (, ). Moreover, ga1 a2 G a1 a2 g equalty on A, A. 1 2 It would seem that would not make sense. s a functon respectng ( x ) x ( ) ( x ) x : A, : A G x, x ext g x,
8 Issues wth ML-82, Alf, and Nuprl Type Theores 3. There s natural subtypng. { : Z 0 } Z { n: N prme ( n) } N A A// E dscussed below 8
9 Issues wth ML-82, Alf, and Nuprl Type Theores 4. Subtypng n general A B ff a = a' na a = a Here are the propertes: A A' B B ' A A' A' B ' A + B A' + B ' A' B A B ' ' n B 9
10 Issues wth ML-82, Alf, and Nuprl Type Theores 5. Record subtypng s derved. Polymorphc functons and the subtypng relaton allow an elegant and natural defnton of records and dependent records. 10
11 One approach to records s to take labels, L, as ndexes nto components. Records usng labels Gven take Defne { x : A; y : B; z : C} { } L = x, y, z, L Atom Sg : L U by f j = x then A else f j = y then B else C ( ) Defne the record type as x : L Sg x. 11
12 Records as functons We now take { x : A; y : B; z : C} == x : L Sg ( x ). for { } r? x : A; y : B; z : C, let r. == ( ) r s o rx.? A, ry.? B, rz.? C 12
13 Records extenson usng labels Consder { x : A; y : B; z : C; w : D} Is ths a subrecord of To examne ths, let L' =,, { x : A; y : B; z : C } { x y zw, }..? Notce L L '. Defne Notce because ( ) = f = then else ( ) Sg' w D Sg ( ) ( ) x : L' Sg ' x x : L Sg x ( ) = ( ) L L' and Sg' x Sg x for x? L.. 13
14 Record extenson depends on functon polymorphsm ( ) ( ) x : L' Sg' x x : L Sg x ( ) ( ) because any functon r ' n x : L' Sg' x s a functon n x : L Sg x. Gven nputs from L, x and y, r '( x )? Sg' ( x ) ( ) = ( ) ( )? ( ) = ( ) an d Sg ' x Sg x, r ' y Sg ' y Sg y. 14
15 Record subtypng depends on polymorphc functons Let R R 3 4 = { x 1: A1; x 2: A2; x 3: A3} { x : A ; ; x : A }. = Note R R. 4 3 ( x ) If r, then s defned for? R 4 r {,, } x? x x 1 4, { 1,, 3} hence t s defned for x? x x. 15
16 RECORDS Records and varant types { x : A} == { x} A { x : Ay ; : B; z: C} == { x : A} { y : B} { z : C} VARIANT TYPES { xof A} == { x} A ( xof A yof B zof C ) == ( xof A) ( yof B) ( zof C ) 16
17 Equaltes Dffer 6. ML-82, Alf, Nuprl base equalty on sets s structural A B = A' B ' A B = A' B A + B = A' + B ' ff A = A' and B = B ' ff A = A' and B = B ff A = A' and B = B ' ' ' Set equalty s extensonal; γ = γ ' ff x γ ff x γ'. However, we can defne extensonal type equalty A B ff A B & B A. Note, functon equalty s extensonal n type theory: f = gn A B ff f ( x ) = g ( x ) for all x? A. 17
18 Issues wth ML-82, Alf, and Nuprl Type Theores 7. Nuprl uses quotent types. We can defne new equaltes on a type, say Z, to create a new type. Let E denote the equvalence relaton k Let Z == Z// E. k k x = y mod k on Z For example, n Z 2 all elements equal one of 01, ; n Z 6 all elements equal one of ,,,,,. 18
19 Issues wth ML-82, Alf, and Nuprl Type Theores 8. Types are objects n ML-82, Alf, and Nuprl. U1 s a unverse whose objects are (codes) for types. A? U for x? A, B? x : A B? U x : A B? U U F : U U µx. F monotone U N, B, vod? U for all U+ 1? U 19
20 Issues wth Nuprl Type Theores 9. Some Nuprl theorems contradct classcal set theory and classcal logc. (a) Nuprl can solve ths recurson equaton on types: T ( T B) = ( X B) usng µ X. B. (b) Nuprl s doman theory (bar types) ncludes ths result: B ( ( ) ) h: N B.? x : N. h x = tff x 20
21 Nuprl has Unon and Intersecton 10. The types A B, B, A B, B, x : A B x x? A x? A all volate Howe s constructon as outlned. x ({ 0} { 0} ) { 1} { 1} ( ) ncludes 0 0 and 1 1 but no α β can approxmate both. 21
22 Extendng Set Theoretc Semantcs to ML-82, Alf, Nuprl Can we account for these deas n set theory? Can we embed ML-82, Alf, and Nuprl nto the cumulatve herarchy? U j τ 2 τ are naccessble cardnals U 2 U 1 τ 1 22
23 Copng Wth Issues Polymorphsm Functonalty Subtypng Equalty Quotent types Unverses Non-classcal results Unons, ntersectons use ϕ= ϕ' use set equalty and unqueness follows from polymorphsm use extensonal equlaty ntroduce lmted non-determnsm use naccessble cardnals (reflecton) restrct to core Nuprl consult Evan Moran 23
24 Extendng Approxmaton on Functons Defnton For α, β n V, defne the followng preorder, α β, by nducton on the rank of α: 1. γ γ. ( ) ( ) 2. c,, c ',, ' f ' j n. α1 αn α1 αn αj αj 1 3. φ φ' f for all < α, β >? φ, there exst < α', β' >? φ ' such that α ' α and β β ' (note the contravarance n the frst argument). 4. ξ ξ' f for all α'? ξ' there s α? ξ wth α α '. Incorporate nto by concludng α β. 24
25 Capturng Record Polymorphsm n Howe s Model Consder { x : N; y : N; z : N} { x : N; y : N} ( ) = 0, ( ) = 1, ( ) = 2 wth r x r y r z. Let ψ = ϕ ψ 1 2 = ϕ { < x, 0 ><, y, 1> } { < x, 0 ><, y, 1 ><, z, 2 > } Note ψ1 ψ2, snce for each < α, β > n ψ1 there s some α' α, β = β'. Note, ψ2 λxr. ( x ) { x : N; y: N; z: N} ψ1 = ψ2 ψ1 λxr. ( x ) ( )? { N N N} as well. snce, we have. Thus, λxr. x x : ; y: ; z:, and 25
26 Example If ϕ Z B then ϕ? Z B. 2 6 Ths follows from Approx. Theorem (Thm 2.2). If α β and β ϕ,then α ϕ, fndng ϕ? Z B, ϕ? where ϕ = ϕ and ϕ = ϕ Imagne ϕ tests evenness. Z B 26
27 Approxmaton Theorem (Thm 2.2, p.24) If α = β and β e then α e 27
28 Subtypng Fals Wthout Approxmaton Z B Z B 2 6 but ϕ = { < 0, t >, < 1, f > }? Z small to be n Z 6 B; compare to B s too ϕ 2 = { < 0, t ><, 1, f ><, 2, t ><, 3, f ><, 4, t ><, 5, f > } ϕ ϕ and ϕ ϕ
29 Comparng Types and Sets We have seen embeddngs of types nto structured sets. Ths s one relatonshp between types and sets, but not the only nterestng one. Peter Aczel showed n 1976 how to treat sets as types by mappng a verson of constructve set theory, CZF, nto Martn-Löf type theory. Over the years he extended CZF wth nductve defntons and choce prncples so that ZFC = CZF + Choce. Ths holds also for CZF wth unverses (n accessble cardnals), CZF. Jason Hckey formalzed Aczel s constructon n MetaPRL. 29
30 Formally Embeddng Sets nto Types CZF Aczel M-L Types CZF Theory Hckey Nuprl Theory MetaPRL 30
31 Interestng Observaton If we combne Howe s result and Aczel s, we get ths stuaton: CZF Nuprl +1 1 CZF + ZFC + 1 ZFC = CZF + LEM How are CZF and ZFC related? Theorem (Moran): CZF ZFC 31
32 1 Aczel s Embeddng 1 Aczel ntroduces the type Set wth Martn-Löf style rules. If A? U and f ( x)? Set for all x? A, { ( ) } then f x x A Set. For example, f α,, α are sets for? N, and f 1 n { f N } () = α, then () s a set. { f() N } When n = 0, then s the empty set. n n n 32
33 Aczel s Embeddng 2 When looked at as types, sets have the form of wellfounded trees. They look lke Brouwer ordnals
34 Relatng Models of Sets and Types 1 The followng Nuprl recursve type captures Aczel s model of sets as types: ( U ) µ X. I : I x ( U1 ) Let u µ X. I : I x be the untagged Howe set model of ths type. Call t ACZ. 1 34
35 Relatng Models of Sets and Types 2 We can also translate Aczel s type theory defntons of membershp and extensonal equalty. αεα' = u αε A α' φ α = ' A α = u α = A α' φ 35
36 Relatng Models of Sets and Types 3 Let M be the sets below the 1 st naccessble cardnal, the sets n Howe s Z τ. 1 In classcal frst-order logc, L, ACZ and M are models of ZFC. How are they related? 36
37 Theorem : Moran s Theorem ACZ M, that s, there s a surjectve map : ACZ M such that for all αα, ' n ACZ ι (a) αε α' α ε α' A ι ι ( ) ( ) (b) α = α' α = α' A ι ι ( ) ( ) 37
38 Aczel s CZF Axoms Equalty x = yff? z. z? x z? y ( ) Set Inducton Scheme? y.? x? y. P x P y? xp. x ( ( ) ( )) ( ) Parng? z x z y z ( ) Unon? z. y? x. u? y. u? z ( ) Restrcted Separaton ( ( )) ( ) ( ( ))? z. y? z. y? x P y y? x. P y y? z 38
39 Aczel s CZF Axoms (cont.) Strong Collecton? x? a.? y. R x, y? b. R' ab, R' ab, ( ) ( ) where ( ) ( ) ( )? x? a.? y? b. R x, y?? y? b.? x? a. R x, y s Subset Collecton? c?u? x? a? y? b R x y? d? c R ad Infnty?z. Nat z ( ) ( ) (..,. ', ) ( ) 39
40 Summary We know that Classcal Nuprl s consstent and can share theorems wth PVS, HOL, Mzar, provded t avods domans (bar types) and certan recursve types Classcal Nuprl can retan A// E,,,, Top Wth, set theory t becomes a peer theory wth classcal HOL, PVS can consstently add A// E,,,, Top 40
Introductory Cardinality Theory Alan Kaylor Cline
Introductory Cardnalty Theory lan Kaylor Clne lthough by name the theory of set cardnalty may seem to be an offshoot of combnatorcs, the central nterest s actually nfnte sets. Combnatorcs deals wth fnte
More informationHomotopy Type Theory Lecture Notes
15-819 Homotopy Type Theory Lecture Notes Evan Cavallo and Stefan Muller November 18 and 20, 2013 1 Reconsder Nat n smple types s a warmup to dscussng nductve types, we frst revew several equvalent presentatons
More informationWeek 2. This week, we covered operations on sets and cardinality.
Week 2 Ths week, we covered operatons on sets and cardnalty. Defnton 0.1 (Correspondence). A correspondence between two sets A and B s a set S contaned n A B = {(a, b) a A, b B}. A correspondence from
More informationA PROOF OF THE STANDARD REDUCTION THEOREM IN THE LAMBDA CALCULUS
A PROOF OF THE STANDARD REDUCTION THEOREM IN THE LAMBDA CALCULUS WILLIAM RICHTER ABSTRACT. Fellesen s Standard Reducton Theorem for the λ v Calculus yelds an algorthm that models the Scheme nterpreter.
More information12 MATH 101A: ALGEBRA I, PART C: MULTILINEAR ALGEBRA. 4. Tensor product
12 MATH 101A: ALGEBRA I, PART C: MULTILINEAR ALGEBRA Here s an outlne of what I dd: (1) categorcal defnton (2) constructon (3) lst of basc propertes (4) dstrbutve property (5) rght exactness (6) localzaton
More informationa b a In case b 0, a being divisible by b is the same as to say that
Secton 6.2 Dvsblty among the ntegers An nteger a ε s dvsble by b ε f there s an nteger c ε such that a = bc. Note that s dvsble by any nteger b, snce = b. On the other hand, a s dvsble by only f a = :
More informationwhere a is any ideal of R. Lemma Let R be a ring. Then X = Spec R is a topological space. Moreover the open sets
11. Schemes To defne schemes, just as wth algebrac varetes, the dea s to frst defne what an affne scheme s, and then realse an arbtrary scheme, as somethng whch s locally an affne scheme. The defnton of
More informationCupping Classes of Σ 0 2. Enumeration Degrees. Mariya I. Soskova Department of Pure Mathematics University of Leeds
Cuppng Classes of Σ 0 2 Enumeraton Degrees Marya I. Soskova Department of Pure Mathematcs Unversty of Leeds marya@maths.leeds.ac.uk 07.02.08 The local structure of the enumeraton degrees Σ 2 e-degrees
More informationAnti-van der Waerden numbers of 3-term arithmetic progressions.
Ant-van der Waerden numbers of 3-term arthmetc progressons. Zhanar Berkkyzy, Alex Schulte, and Mchael Young Aprl 24, 2016 Abstract The ant-van der Waerden number, denoted by aw([n], k), s the smallest
More informationwhere a is any ideal of R. Lemma 5.4. Let R be a ring. Then X = Spec R is a topological space Moreover the open sets
5. Schemes To defne schemes, just as wth algebrac varetes, the dea s to frst defne what an affne scheme s, and then realse an arbtrary scheme, as somethng whch s locally an affne scheme. The defnton of
More information22.1 Representability of Functions in a Formal Theory
Appled Logc Lecture 22: Arthmetc Representablty CS 4860 Sprng 2009 Thursday, Aprl 9, 2009 In the prevous lectures we have ntroduced axomatzatons of varous fragments of mathematcs, ncludng nteger arthmetc.
More informationMathematical Preparations
1 Introducton Mathematcal Preparatons The theory of relatvty was developed to explan experments whch studed the propagaton of electromagnetc radaton n movng coordnate systems. Wthn expermental error the
More informationOn a direct solver for linear least squares problems
ISSN 2066-6594 Ann. Acad. Rom. Sc. Ser. Math. Appl. Vol. 8, No. 2/2016 On a drect solver for lnear least squares problems Constantn Popa Abstract The Null Space (NS) algorthm s a drect solver for lnear
More informationBasic Regular Expressions. Introduction. Introduction to Computability. Theory. Motivation. Lecture4: Regular Expressions
Introducton to Computablty Theory Lecture: egular Expressons Prof Amos Israel Motvaton If one wants to descrbe a regular language, La, she can use the a DFA, Dor an NFA N, such L ( D = La that that Ths
More informationCollege of Computer & Information Science Fall 2009 Northeastern University 20 October 2009
College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:
More information20. Mon, Oct. 13 What we have done so far corresponds roughly to Chapters 2 & 3 of Lee. Now we turn to Chapter 4. The first idea is connectedness.
20. Mon, Oct. 13 What we have done so far corresponds roughly to Chapters 2 & 3 of Lee. Now we turn to Chapter 4. The frst dea s connectedness. Essentally, we want to say that a space cannot be decomposed
More informationSubset Topological Spaces and Kakutani s Theorem
MOD Natural Neutrosophc Subset Topologcal Spaces and Kakutan s Theorem W. B. Vasantha Kandasamy lanthenral K Florentn Smarandache 1 Copyrght 1 by EuropaNova ASBL and the Authors Ths book can be ordered
More informationTransfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system
Transfer Functons Convenent representaton of a lnear, dynamc model. A transfer functon (TF) relates one nput and one output: x t X s y t system Y s The followng termnology s used: x y nput output forcng
More informationOn the set of natural numbers
On the set of natural numbers by Jalton C. Ferrera Copyrght 2001 Jalton da Costa Ferrera Introducton The natural numbers have been understood as fnte numbers, ths wor tres to show that the natural numbers
More informationModule 2. Random Processes. Version 2 ECE IIT, Kharagpur
Module Random Processes Lesson 6 Functons of Random Varables After readng ths lesson, ou wll learn about cdf of functon of a random varable. Formula for determnng the pdf of a random varable. Let, X be
More informationLecture 4: Universal Hash Functions/Streaming Cont d
CSE 5: Desgn and Analyss of Algorthms I Sprng 06 Lecture 4: Unversal Hash Functons/Streamng Cont d Lecturer: Shayan Oves Gharan Aprl 6th Scrbe: Jacob Schreber Dsclamer: These notes have not been subjected
More informationCompletions of ordered magmas
ANNALES SOCIETATIS ATHEATICÆ POLONÆ Seres VI : Fundamenta Informatcæ III1 (1980), 105 118 Completons of ordered magmas BRUNO COURCELLE Unversty of Bordeaux-I JEAN-CLAUDE RAOULT IRIA, Parsq XI Receved arch
More informationFor now, let us focus on a specific model of neurons. These are simplified from reality but can achieve remarkable results.
Neural Networks : Dervaton compled by Alvn Wan from Professor Jtendra Malk s lecture Ths type of computaton s called deep learnng and s the most popular method for many problems, such as computer vson
More informationarxiv: v1 [math.co] 1 Mar 2014
Unon-ntersectng set systems Gyula O.H. Katona and Dánel T. Nagy March 4, 014 arxv:1403.0088v1 [math.co] 1 Mar 014 Abstract Three ntersecton theorems are proved. Frst, we determne the sze of the largest
More informationREAL ANALYSIS I HOMEWORK 1
REAL ANALYSIS I HOMEWORK CİHAN BAHRAN The questons are from Tao s text. Exercse 0.0.. If (x α ) α A s a collecton of numbers x α [0, + ] such that x α
More informationFuzzy Boundaries of Sample Selection Model
Proceedngs of the 9th WSES Internatonal Conference on ppled Mathematcs, Istanbul, Turkey, May 7-9, 006 (pp309-34) Fuzzy Boundares of Sample Selecton Model L. MUHMD SFIIH, NTON BDULBSH KMIL, M. T. BU OSMN
More informationA CLASS OF RECURSIVE SETS. Florentin Smarandache University of New Mexico 200 College Road Gallup, NM 87301, USA
A CLASS OF RECURSIVE SETS Florentn Smarandache Unversty of New Mexco 200 College Road Gallup, NM 87301, USA E-mal: smarand@unmedu In ths artcle one bulds a class of recursve sets, one establshes propertes
More informationStates and exceptions are dual effects
States and exceptons are dual effects Jean-Gullaume Dumas, Domnque Duval, Laurent Fousse, Jean-Claude Reynaud LJK, Unversty of Grenoble August 29, 2010 Workshop on Categorcal Logc n Brno (ths s a long
More information1 Definition of Rademacher Complexity
COS 511: Theoretcal Machne Learnng Lecturer: Rob Schapre Lecture #9 Scrbe: Josh Chen March 5, 2013 We ve spent the past few classes provng bounds on the generalzaton error of PAClearnng algorths for the
More informationFORCING COPIES OF ω 1 WITH PFA(S)
FORCING COPIES OF ω 1 WITH PFA(S) ALAN DOW Abstract. We work n the PFA(S)[S] model. We show that a non-compact sequentally compact space of small character wll contan a copy of ω 1. Droppng the character
More informationHidden Markov Models
Hdden Markov Models Namrata Vaswan, Iowa State Unversty Aprl 24, 204 Hdden Markov Model Defntons and Examples Defntons:. A hdden Markov model (HMM) refers to a set of hdden states X 0, X,..., X t,...,
More informationON SEPARATING SETS OF WORDS IV
ON SEPARATING SETS OF WORDS IV V. FLAŠKA, T. KEPKA AND J. KORTELAINEN Abstract. Further propertes of transtve closures of specal replacement relatons n free monods are studed. 1. Introducton Ths artcle
More informationMAT 578 Functional Analysis
MAT 578 Functonal Analyss John Qugg Fall 2008 Locally convex spaces revsed September 6, 2008 Ths secton establshes the fundamental propertes of locally convex spaces. Acknowledgment: although I wrote these
More informationKernel Methods and SVMs Extension
Kernel Methods and SVMs Extenson The purpose of ths document s to revew materal covered n Machne Learnng 1 Supervsed Learnng regardng support vector machnes (SVMs). Ths document also provdes a general
More informationLearning Theory: Lecture Notes
Learnng Theory: Lecture Notes Lecturer: Kamalka Chaudhur Scrbe: Qush Wang October 27, 2012 1 The Agnostc PAC Model Recall that one of the constrants of the PAC model s that the data dstrbuton has to be
More informationU.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017
U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 4s Luca Trevsan September 5, 07 Summary of Lecture 4 In whch we ntroduce semdefnte programmng and apply t to Max Cut. Semdefnte Programmng Recall that
More informationInner Product. Euclidean Space. Orthonormal Basis. Orthogonal
Inner Product Defnton 1 () A Eucldean space s a fnte-dmensonal vector space over the reals R, wth an nner product,. Defnton 2 (Inner Product) An nner product, on a real vector space X s a symmetrc, blnear,
More informationLecture 20: Lift and Project, SDP Duality. Today we will study the Lift and Project method. Then we will prove the SDP duality theorem.
prnceton u. sp 02 cos 598B: algorthms and complexty Lecture 20: Lft and Project, SDP Dualty Lecturer: Sanjeev Arora Scrbe:Yury Makarychev Today we wll study the Lft and Project method. Then we wll prove
More informationA particle in a state of uniform motion remain in that state of motion unless acted upon by external force.
The fundamental prncples of classcal mechancs were lad down by Galleo and Newton n the 16th and 17th centures. In 1686, Newton wrote the Prncpa where he gave us three laws of moton, one law of gravty,
More informationNumerical Solution of Ordinary Differential Equations
Numercal Methods (CENG 00) CHAPTER-VI Numercal Soluton of Ordnar Dfferental Equatons 6 Introducton Dfferental equatons are equatons composed of an unknown functon and ts dervatves The followng are examples
More informationSome basic inequalities. Definition. Let V be a vector space over the complex numbers. An inner product is given by a function, V V C
Some basc nequaltes Defnton. Let V be a vector space over the complex numbers. An nner product s gven by a functon, V V C (x, y) x, y satsfyng the followng propertes (for all x V, y V and c C) (1) x +
More informationEdge Isoperimetric Inequalities
November 7, 2005 Ross M. Rchardson Edge Isopermetrc Inequaltes 1 Four Questons Recall that n the last lecture we looked at the problem of sopermetrc nequaltes n the hypercube, Q n. Our noton of boundary
More informationTHERE ARE INFINITELY MANY FIBONACCI COMPOSITES WITH PRIME SUBSCRIPTS
Research and Communcatons n Mathematcs and Mathematcal Scences Vol 10, Issue 2, 2018, Pages 123-140 ISSN 2319-6939 Publshed Onlne on November 19, 2018 2018 Jyot Academc Press http://jyotacademcpressorg
More informationRemarks on the Properties of a Quasi-Fibonacci-like Polynomial Sequence
Remarks on the Propertes of a Quas-Fbonacc-lke Polynomal Sequence Brce Merwne LIU Brooklyn Ilan Wenschelbaum Wesleyan Unversty Abstract Consder the Quas-Fbonacc-lke Polynomal Sequence gven by F 0 = 1,
More informationON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EQUATION
Advanced Mathematcal Models & Applcatons Vol.3, No.3, 2018, pp.215-222 ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EUATION
More informationMore metrics on cartesian products
More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of
More informationLecture 10 Support Vector Machines II
Lecture 10 Support Vector Machnes II 22 February 2016 Taylor B. Arnold Yale Statstcs STAT 365/665 1/28 Notes: Problem 3 s posted and due ths upcomng Frday There was an early bug n the fake-test data; fxed
More informationOn the Operation A in Analysis Situs. by Kazimierz Kuratowski
v1.3 10/17 On the Operaton A n Analyss Stus by Kazmerz Kuratowsk Author s note. Ths paper s the frst part slghtly modfed of my thess presented May 12, 1920 at the Unversty of Warsaw for the degree of Doctor
More informationGeneralized Linear Methods
Generalzed Lnear Methods 1 Introducton In the Ensemble Methods the general dea s that usng a combnaton of several weak learner one could make a better learner. More formally, assume that we have a set
More informationEncodings of Extensible Objects and Types
Encodngs of Extensble Objects and Types Vvana Bono Dpartmento d Informatca Unverstà d Torno bono@d.unto.t http://www.d.unto.t/ bono Mchele Bugles Slva Crafa Dpartmento d Informatca Unverstà Ca Foscar d
More informationMODELING TRAFFIC LIGHTS IN INTERSECTION USING PETRI NETS
The 3 rd Internatonal Conference on Mathematcs and Statstcs (ICoMS-3) Insttut Pertanan Bogor, Indonesa, 5-6 August 28 MODELING TRAFFIC LIGHTS IN INTERSECTION USING PETRI NETS 1 Deky Adzkya and 2 Subono
More informationProblem Set 9 Solutions
Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem
More informationEcon107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4)
I. Classcal Assumptons Econ7 Appled Econometrcs Topc 3: Classcal Model (Studenmund, Chapter 4) We have defned OLS and studed some algebrac propertes of OLS. In ths topc we wll study statstcal propertes
More informationarxiv: v1 [math.dg] 15 Jun 2007
arxv:0706.2313v1 [math.dg] 15 Jun 2007 Cohomology of dffeologcal spaces and folatons E. Macías-Vrgós; E. Sanmartín-Carbón Abstract Let (M, F) be a folated manfold. We study the relatonshp between the basc
More informationComplete Axiomatization for Divergent-Sensitive Bisimulations in Basic Process Algebra with Prefix Iteration 1
Electronc Notes n Theoretcal Computer Scence 212 (2008) 55 70 www.elsever.com/locate/entcs Complete Axomatzaton for Dvergent-Senstve Bsmulatons n Basc Process Algebra wth Prefx Iteraton 1 Taolue Chen 2
More informationExercise Solutions to Real Analysis
xercse Solutons to Real Analyss Note: References refer to H. L. Royden, Real Analyss xersze 1. Gven any set A any ɛ > 0, there s an open set O such that A O m O m A + ɛ. Soluton 1. If m A =, then there
More informationOn the Complexity of Partial Order Trace Model Checking
On the Complexty of Partal Order Trace Model Checkng Therry Massart Cédrc Meuter Laurent Van Begn Unversté Lbre de Bruxelles (U.L.B.), Boulevard du Tromphe, CP-212, 1050 Bruxelles, Belgum {tmassart,cmeuter,lvbegn}@ulb.ac.be
More informationTHE CLASS NUMBER THEOREM
THE CLASS NUMBER THEOREM TIMUR AKMAN-DUFFY Abstract. In basc number theory we encounter the class group (also known as the deal class group). Ths group measures the extent that a rng fals to be a prncpal
More informationSolving Nonlinear Differential Equations by a Neural Network Method
Solvng Nonlnear Dfferental Equatons by a Neural Network Method Luce P. Aarts and Peter Van der Veer Delft Unversty of Technology, Faculty of Cvlengneerng and Geoscences, Secton of Cvlengneerng Informatcs,
More informationAppendix for Causal Interaction in Factorial Experiments: Application to Conjoint Analysis
A Appendx for Causal Interacton n Factoral Experments: Applcaton to Conjont Analyss Mathematcal Appendx: Proofs of Theorems A. Lemmas Below, we descrbe all the lemmas, whch are used to prove the man theorems
More informationGenericity of Critical Types
Genercty of Crtcal Types Y-Chun Chen Alfredo D Tllo Eduardo Fangold Syang Xong September 2008 Abstract Ely and Pesk 2008 offers an nsghtful characterzaton of crtcal types: a type s crtcal f and only f
More informationSoft Neutrosophic Bi-LA-semigroup and Soft Neutrosophic N-LA-seigroup
Neutrosophc Sets and Systems, Vol. 5, 04 45 Soft Neutrosophc B-LA-semgroup and Soft Mumtaz Al, Florentn Smarandache, Muhammad Shabr 3,3 Department of Mathematcs, Quad--Azam Unversty, Islamabad, 44000,Pakstan.
More informationLinear, affine, and convex sets and hulls In the sequel, unless otherwise specified, X will denote a real vector space.
Lnear, affne, and convex sets and hulls In the sequel, unless otherwse specfed, X wll denote a real vector space. Lnes and segments. Gven two ponts x, y X, we defne xy = {x + t(y x) : t R} = {(1 t)x +
More informationLecture Randomized Load Balancing strategies and their analysis. Probability concepts include, counting, the union bound, and Chernoff bounds.
U.C. Berkeley CS273: Parallel and Dstrbuted Theory Lecture 1 Professor Satsh Rao August 26, 2010 Lecturer: Satsh Rao Last revsed September 2, 2010 Lecture 1 1 Course Outlne We wll cover a samplng of the
More informationDifferential Polynomials
JASS 07 - Polynomals: Ther Power and How to Use Them Dfferental Polynomals Stephan Rtscher March 18, 2007 Abstract Ths artcle gves an bref ntroducton nto dfferental polynomals, deals and manfolds and ther
More informationThe Second Anti-Mathima on Game Theory
The Second Ant-Mathma on Game Theory Ath. Kehagas December 1 2006 1 Introducton In ths note we wll examne the noton of game equlbrum for three types of games 1. 2-player 2-acton zero-sum games 2. 2-player
More informationFeature Selection: Part 1
CSE 546: Machne Learnng Lecture 5 Feature Selecton: Part 1 Instructor: Sham Kakade 1 Regresson n the hgh dmensonal settng How do we learn when the number of features d s greater than the sample sze n?
More informationk(k 1)(k 2)(p 2) 6(p d.
BLOCK-TRANSITIVE 3-DESIGNS WITH AFFINE AUTOMORPHISM GROUP Greg Gamble Let X = (Z p d where p s an odd prme and d N, and let B X, B = k. Then t was shown by Praeger that the set B = {B g g AGL d (p} s the
More informationPerfect Competition and the Nash Bargaining Solution
Perfect Competton and the Nash Barganng Soluton Renhard John Department of Economcs Unversty of Bonn Adenauerallee 24-42 53113 Bonn, Germany emal: rohn@un-bonn.de May 2005 Abstract For a lnear exchange
More informationMATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS
MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS These are nformal notes whch cover some of the materal whch s not n the course book. The man purpose s to gve a number of nontrval examples
More informationBallot Paths Avoiding Depth Zero Patterns
Ballot Paths Avodng Depth Zero Patterns Henrch Nederhausen and Shaun Sullvan Florda Atlantc Unversty, Boca Raton, Florda nederha@fauedu, ssull21@fauedu 1 Introducton In a paper by Sapounaks, Tasoulas,
More informationOn Similarity Measures of Fuzzy Soft Sets
Int J Advance Soft Comput Appl, Vol 3, No, July ISSN 74-853; Copyrght ICSRS Publcaton, www-csrsorg On Smlarty Measures of uzzy Soft Sets PINAKI MAJUMDAR* and SKSAMANTA Department of Mathematcs MUC Women
More informationLECTURE V. 1. More on the Chinese Remainder Theorem We begin by recalling this theorem, proven in the preceeding lecture.
LECTURE V EDWIN SPARK 1. More on the Chnese Remander Theorem We begn by recallng ths theorem, proven n the preceedng lecture. Theorem 1.1 (Chnese Remander Theorem). Let R be a rng wth deals I 1, I 2,...,
More informationPhysics 5153 Classical Mechanics. D Alembert s Principle and The Lagrangian-1
P. Guterrez Physcs 5153 Classcal Mechancs D Alembert s Prncple and The Lagrangan 1 Introducton The prncple of vrtual work provdes a method of solvng problems of statc equlbrum wthout havng to consder the
More informationMin Cut, Fast Cut, Polynomial Identities
Randomzed Algorthms, Summer 016 Mn Cut, Fast Cut, Polynomal Identtes Instructor: Thomas Kesselhem and Kurt Mehlhorn 1 Mn Cuts n Graphs Lecture (5 pages) Throughout ths secton, G = (V, E) s a mult-graph.
More informationLecture 14: Bandits with Budget Constraints
IEOR 8100-001: Learnng and Optmzaton for Sequental Decson Makng 03/07/16 Lecture 14: andts wth udget Constrants Instructor: Shpra Agrawal Scrbed by: Zhpeng Lu 1 Problem defnton In the regular Mult-armed
More informationn ). This is tight for all admissible values of t, k and n. k t + + n t
MAXIMIZING THE NUMBER OF NONNEGATIVE SUBSETS NOGA ALON, HAROUT AYDINIAN, AND HAO HUANG Abstract. Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what
More informationA proof of the dimension conjecture and of Jacobi's bound. François Ollivier (CNRS) LIX UMR CNRS École polytechnique
A proof of the dmenson conjecture and of Jacob's bound Franços Ollver (CNRS) LIX UMR CNRS École polytechnque Jacob s bound Proposton. Let P 1,..., P n , a,j = ord xj P and = max σ S n Σ
More informationAwareness and forgetting of facts and agents
Awareness and forgettng of facts and agents Hans van Dtmarsch Unversty of Sevlla, Span & Unversty of Otago, New Zealand Emal: hans@cs.otago.ac.nz Tm French Unversty of Western Australa, Perth, Australa
More informationarxiv: v1 [math.co] 12 Sep 2014
arxv:1409.3707v1 [math.co] 12 Sep 2014 On the bnomal sums of Horadam sequence Nazmye Ylmaz and Necat Taskara Department of Mathematcs, Scence Faculty, Selcuk Unversty, 42075, Campus, Konya, Turkey March
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:
More information2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification
E395 - Pattern Recognton Solutons to Introducton to Pattern Recognton, Chapter : Bayesan pattern classfcaton Preface Ths document s a soluton manual for selected exercses from Introducton to Pattern Recognton
More informationREVERSE MATHEMATICS AND PROPERTIES OF FINITE CHARACTER
REVERSE MATHEMATICS AND PROPERTIES OF FINITE CHARACTER DAMIR D. DZHAFAROV AND CARL MUMMERT Abstract. We study the reverse mathematcs of the prncple statng that, for every property of fnte character, every
More informationDeriving the X-Z Identity from Auxiliary Space Method
Dervng the X-Z Identty from Auxlary Space Method Long Chen Department of Mathematcs, Unversty of Calforna at Irvne, Irvne, CA 92697 chenlong@math.uc.edu 1 Iteratve Methods In ths paper we dscuss teratve
More informationChapter Twelve. Integration. We now turn our attention to the idea of an integral in dimensions higher than one. Consider a real-valued function f : D
Chapter Twelve Integraton 12.1 Introducton We now turn our attenton to the dea of an ntegral n dmensons hgher than one. Consder a real-valued functon f : R, where the doman s a nce closed subset of Eucldean
More informationMath Review. CptS 223 Advanced Data Structures. Larry Holder School of Electrical Engineering and Computer Science Washington State University
Math Revew CptS 223 dvanced Data Structures Larry Holder School of Electrcal Engneerng and Computer Scence Washngton State Unversty 1 Why do we need math n a data structures course? nalyzng data structures
More informationErrors for Linear Systems
Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch
More informationMaximizing the number of nonnegative subsets
Maxmzng the number of nonnegatve subsets Noga Alon Hao Huang December 1, 213 Abstract Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what s the maxmum
More informationLectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix
Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could
More informationFINITELY-GENERATED MODULES OVER A PRINCIPAL IDEAL DOMAIN
FINITELY-GENERTED MODULES OVER PRINCIPL IDEL DOMIN EMMNUEL KOWLSKI Throughout ths note, s a prncpal deal doman. We recall the classfcaton theorem: Theorem 1. Let M be a fntely-generated -module. (1) There
More informationThe Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction
ECONOMICS 5* -- NOTE (Summary) ECON 5* -- NOTE The Multple Classcal Lnear Regresson Model (CLRM): Specfcaton and Assumptons. Introducton CLRM stands for the Classcal Lnear Regresson Model. The CLRM s also
More informationTHE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens
THE CHINESE REMAINDER THEOREM KEITH CONRAD We should thank the Chnese for ther wonderful remander theorem. Glenn Stevens 1. Introducton The Chnese remander theorem says we can unquely solve any par of
More informationReview of metric spaces. 1. Metric spaces, continuous maps, completeness
(March 14, 2014) Revew of metrc spaces Paul Garrett garrett@math.umn.edu http://www.math.umn.edu/ garrett/ [Ths document s http://www.math.umn.edu/ garrett/m/mfms/notes 2013-14/12a metrc spaces.pdf] We
More informationON THE EQUIVALENCE OF ORDINAL BAYESIAN INCENTIVE COMPATIBILITY AND DOMINANT STRATEGY INCENTIVE COMPATIBILITY FOR RANDOM RULES
ON THE EQUIVALENCE OF ORDINAL BAYESIAN INCENTIVE COMPATIBILITY AND DOMINANT STRATEGY INCENTIVE COMPATIBILITY FOR RANDOM RULES Madhuparna Karmokar 1 and Souvk Roy 1 1 Economc Research Unt, Indan Statstcal
More informationAffine and Riemannian Connections
Affne and Remannan Connectons Semnar Remannan Geometry Summer Term 2015 Prof Dr Anna Wenhard and Dr Gye-Seon Lee Jakob Ullmann Notaton: X(M) space of smooth vector felds on M D(M) space of smooth functons
More informationthe ordinal-least-upper-bound of any set of cardinals is a cardinal; for any set I, and cardinals λ is a cardinal.
11 Regular cardnals In what follows, κ, λ, µ, ν, ρ always denote cardnals. A cardnal κ s sad to be regular f κ s nfnte, and the unon of fewer than κ sets, each of whose cardnalty s less than κ, s of cardnalty
More informationBOUNDEDNESS OF THE RIESZ TRANSFORM WITH MATRIX A 2 WEIGHTS
BOUNDEDNESS OF THE IESZ TANSFOM WITH MATIX A WEIGHTS Introducton Let L = L ( n, be the functon space wth norm (ˆ f L = f(x C dx d < For a d d matrx valued functon W : wth W (x postve sem-defnte for all
More informationOutline and Reading. Dynamic Programming. Dynamic Programming revealed. Computing Fibonacci. The General Dynamic Programming Technique
Outlne and Readng Dynamc Programmng The General Technque ( 5.3.2) -1 Knapsac Problem ( 5.3.3) Matrx Chan-Product ( 5.3.1) Dynamc Programmng verson 1.4 1 Dynamc Programmng verson 1.4 2 Dynamc Programmng
More informationOn the smoothness and the totally strong properties for nearness frames
Int. Sc. Technol. J. Namba Vol 1, Issue 1, 2013 On the smoothness and the totally strong propertes for nearness frames Martn. M. Mugoch Department of Mathematcs, Unversty of Namba 340 Mandume Ndemufayo
More informationMARTIN S AXIOM AND SEPARATED MAD FAMILIES
MARTIN S AXIOM AND SEPARATED MAD FAMILIES ALAN DOW AND SAHARON SHELAH Abstract. Two famles A, B of subsets of ω are sad to be separated f there s a subset of ω whch mod fnte contans every member of A and
More information