Handling Uncertainty in Complex Systems

Size: px
Start display at page:

Download "Handling Uncertainty in Complex Systems"

Transcription

1 University Gabriele d Annunzio Chieti-Pescara - Italy Handling Uncertainty in Complex Systems Dr. Serena Doria Department of Engineering and Geology, University G. d Annunzio The aim of the course is to introduce some new results proposed in literature to represent and handling uncertainty in complex systems.

2 Program -Complex systems and complex decisions in the real world. Imprecise probability: a tool to represent partial knowledge. -Iterated functions systems, attractors, fractal set: mathematical models to represent complex systems. -A measure of the complexity of a set: the Hausdorff dimension; Hausdorff dimensional outer measures. - A new model of upper and lower coherent conditional previsions based on Hausdorff outer measures. - Coherent measures of risk defined by the Choquet integral with respect to Hausdorff outer measures: applications.

3 References 1. Billingsley, P. Probability and measure. Wiley, (1986) 2. Blackwell, D., Dubins L. On existence and non existence of proper, regular, conditional distributions. The annals of Probability, Vol. 3, No 5, Wiley, (1975) 3. Choquet, G. Theory of capacities. Ann. Inst. Fourier, 5, , (1953) 4. de Finetti, B. Probability, Induction and Statistics, Wiley, New York, (1972) 5. de Finetti, B. Theory of Probability, Wiley, London, (1974) 6. Denneberg, D. Non-additive measure and integral. Kluwer Academic Publishers, (1994) 7. Doria, S. Probabilistic independence with respect to upper and lower conditional probabilities assigned by Hausdor_ outer and inner measures. International Journal of Approximate Reasoning, 46, , (2007) 8. Doria, S. Convergences of random variables with respect to coherent upper probabilities de_ned by Hausdor_ outer measures, Advances in Soft Computing, 48, Springer, (2008) 9. Doria, S. Coherent upper conditional previsions and their integral representation with respect to Hausdor_ outer measures Combining Soft Computing and Stats Methods, C.Borgelt et al. (Eds.) , (2010) 10. Doria, S. Coherent Upper and Lower Conditional Previsions De_ned by Hausdor_ Outer and Inner Measures in Modeling, Design, and Simulation Systems with Uncertainties, Mathematical Engineering, Springer, Volume 3, , (2011) 11. Doria, S. Characterization of a coherent upper conditional prevision as the Choquet integral with respect to its associated Hausdor_ outer measure, Annals of Operations Research, 195, 33-48, (2012) 12. Doria, S. Symmetric coherent upper conditional prevision by the Choquet integral with respect to Hausdorff outer measure, Annals of Operations Research, 229, , (2014) 13. Doria, S. Coherent conditional measures of risk de_ned by the Choquet integral with respect to Hausdorff outer measure and stochastic independence in risk management,

4 International Journal of approximate Reasoning, 65, 1-10, (2015) 14. Doria, S. On the disintegration property of a coherent upper conditional prevision by the Choquet integral with respect to its associated Hausdorff outer measure, Annals of Operations Research,Volume 256, Iussue 2, , (2017) 15. Di Cencio, A., Doria, S. Probabilistic Analysis of Suture Lines Developed in Ammonites: The Jurassic Examples of Hildocerataceae and Hammatocerataceae, Mathematical Geosciences, Volume 49, Issue 6, , (2017) 16. Dubins, L.E. Finitely additive conditional probabilities, conglomerability and disintegrations. The Annals of Probability, Vol. 3, 89-99, (1975) 17. Falconer, K.J. The geometry of fractals sets. Cambridge University Press, (1986) 18. Grabisch, M. Set Functions, Games and Capacities in Decision Making. Springer, (2016) 19. Regazzini, E. Finitely additive conditional probabilities, Rend. Sem. Mat. Fis., Milano, 55,69-89, (1985) 20. Regazzini, E. De Finetti's coherence and statistical inference, The Annals of Statistics, Vol. 15, No. 2, , (1987) 21. Rogers, C. A. Hausdorff measures. Cambridge University Press, (1970) 22. Srivastava, S. M. A Course on Borel Sets, Spring, (1998) 23. Troffaes M., de Cooman G. Lower Previsions, Wiley, (2014) 24. Walley, P. Coherent lower (and upper) probabilities, Statistics Research Report, University of Warwick, (1981) 25. Walley, P. Statistical Reasoning with Imprecise Probabilities. Chapman and Hall, London, (1991)

5 Deterministic phenomena in which, starting from known initial conditions, we can determine the values of the quantities under examination and therefore the outcome of the phenomenon (e.g. a falling object) Random phenomena or well-defined phenomena whose outcome is not known until the phenomenon occurs (e.g. of a coin) Complex phenomena characterized by a non-linear response to perceived stimuli (e.g. sand castle, landslides, earthquakes, floods, chorus)

6 A complex decision is a decision where the best alternative cannot be obtained by a preference ordering represented by a linear functional A random variable X is a bounded function from Ω to the real numbers R. This function is called gamble in Walley (1991) or random quantity in de Finetti (1972, 1974).

7 A functional " defined on the class L(B) of all random variables defined on a non-empty set B is linear if for every #, % L(B) and for every ', ( R "*'# + (%, ='"*#, +("*%,

8 A preference ordering on the class L(B) of all random variables defined on B is represented by a linear functional " (e.g. the weighted sum) if and only if and # % "*#, >"*%, # % "*#, ="*%, Nevertheless not all preference orderings can be represented by a linear functional

9 Example 1 Let Ω be a non-empty set, B = 23 4, and let 6 be a probability measure defined on the field generated by B. Let consider the class 7 =28 4,8 94,8 : 5 of bounded B- measurable random variables defined on B by Random variables : 0 0.7

10 The preference ordering and : cannot be represented by the linear functional 9 ;*8, =<6*3 =,? = =>4 since there exists no probability measure 6 such that the following system has solution: _

11 ! * , +0.36*3 9, > 0.76*3 4, +06*3 9, 9 " 0.76* , +06*3 9, = 06*3 4, +0.76*3 9, 9 6*3 4, +6*3 9, = 1 Remark If only the random variables 8 4 and 8 9 are considered we have that the preference can be represented by a linear functional, since 0.36*3 4, +0.36*3 9, > 0.76*3 4, +06*3 9, " 6*3 4, +6*3 9, = 1

12 and the system has solutions: all pair (6*3 4,;6*3 9,* with 6*3 4, < :, and 6 *3 9, =1 6*3 4,. The previous example put in evidence the necessity to introduce non-linear functionals to represent preference orderings and to investigate equivalent random variables.

13 For B in B let X B be the restriction to B of a random variable X defined on Ω and let sup X B be the supreme value assumed by X on B. For B in B and X B in K(B) a coherent upper conditional prevision.*8 3, is a real functional on K(B) such that the following conditions hold for every X B and Y B in K(B) and positive constant λ:

14 1..*8 3, sup *48 3, =4.*8 3, positive homogeneity 3..*8+5 3,.*8 3, +.*5 3, subadditivity 4..*3 3, =1

15 If.*8 3, is a coherent upper conditional prevision on a linear space K(B) then its conjugate coherent lower conditional prevision is defined by.*8 3, =.* 8 3, and.*8 3,.*8 3, If for every X B belonging to K(B) we have.*8 3, =.*8 3, =.*8 3, then.*8 3, is called a coherent linear conditional prevision and it is a linear, positive functional on K(B).

16 For each X in K(B) let.*8 6) be the function defined on Ω by.*8 6,*7, =.*8 3, if 7 3..*8 6, is called a coherent upper conditional prevision and it is separately coherent if all the.*8 3, are separately coherent.

17

18 A necessary and sufficient condition for an upper prevision. to be coherent is to be the upper envelope of linear previsions, i.e. there exists a class M of linear previsions, defined on a same domain, such that.*8, = sup2.*8,:. 95

19 Example 1 (continued) DOCTORAL COURSE IN EARTH SYSTEMS AND BUILT ENVIRONMENTS We consider the following class of probability measures

20 Let 6 : be the coherent upper conditional probability defined by 6 *;, = <=?2. 4 *;,,. 9 *;,5 and let 6 : be the coherent lower conditional probability defined by 6 *;, = <>?2. 4 *;,,. 9 *;,5

21 The coherent upper and lower conditional previsions can be represented as Choquet integral If the atoms 3 = are enumerated so that? = =8*3 =, are in in descending order, i.e.? 4? 9? B and? BC4 =0 the Choquet integral with respect to µ is given by B D E 8F6 = <*? =? =C4,6*G =, =>4

22 where G = = =. In Example 1 we have.*8 4, =0.3 and.*8 9, =.*8 :, =0 so that the preference ordering and :. can be represented by the coherent lower prevision..

23 The preference ordering cannot be represented by the coherent upper prevision. since.*8 4, =0.3 and.*8 9, =.*8 :, =0.7

24 A strict ordering, induced by a coherent lower conditional prevision.* 3, can be defined on the class of random variables belonging to L(B) ( Walley (Section 3.8.1)): Definition 1 We say that the alternative 8 = is preferable to 8 K given B with respect to.* 3,, i.e. 8 = 8 K given B if and only if.(8 = 8 K M3* > 0.

25 Some information can be lost when a strict preference order is defined by to.* 3, since. does not contain any information about which random variable, with.*8 3, =0 are really desirable.

26 In Walley (section 3.9.4) the following definitions are given. Definition 2 Let K be a finite class of random variables. A random variable 8 = in K is inadmissible in K given B if there is 8 K in K such that 8 K 8 = with j i. Otherwise 8 = is admissibile in K. Definition 2 An admissible random variable 8 = in K is maximal in K given B under the coherent lower prevision.* 3, when 8 = is admissible in K and

27 .(8 = 8 K M3* 0 8 K in K. If.* 3, is a linear prevision, the maximal random variable belonging to L(B) with respect to.* 3, is the admissible random variable 8 = which satisfies.*8 = 3,.(8 K M3* for all 8 K in K. Any alternative which maximizes.*8 K 3, over 8 K in K is called a Bayes alternative under.* 3,.

28 A Bayes random variable under a coherent lower conditional prevision is a random variable which is maximal under a linear prevision on the class of all random variables defined on B. Definition 3 An admissible random variable 8 = is defined to be a Bayes random variable under a coherent lower prevision. when, for each 8 K in K there is a linear prevision. 9*., such that.*8 = 3,.(8 K M3* 8 K in K.

29 If 8 = is maximal under some. 9*., then.*8 = 3,.(8 K M3* 8 K in K so.(8 = 8 K M3*.(8 = 8 K M3* =.*8 =,.*8 K, 0 and 8 = is maximal under.. So a Bayes random variable under a coherent lower prevision. is maximal under. but the converse is not true. 8 >O = 3=PQO R=?FS< T=R>=UVQ W?FQR. 8 >O <=?><=V W?FQR.

30 Example 1 (continued) DOCTORAL COURSE IN EARTH SYSTEMS AND BUILT ENVIRONMENTS Random variables : 0 0.7

31 We consider the following class of probability measures We obtain.(8 = 8 K *=DZ(8 = 8 K *F6 <0 for all >, [ 21,2,35 with > [ so all random variables 8 = for all > 21,2,35 are admissible

32 and.(8 = 8 K *=DZ(8 = 8 K *F6 0 for all >, [ 21,2,35 so all random variables 8 = for all > 21,2,35 are maximal. No random variable 8 = for all > 21,2,35 is a Bayes random variable.

33 University Gabriele d Annunzio Chieti-Pescara - Italy Handling Uncertainty in Complex Systems Dr. Serena Doria Department of Engineering and Geology, University G. d Annunzio The aim of the course is to introduce some new results proposed in literature to represent and handling uncertainty in complex systems.

34 A new model of coherent upper and lower conditional previsions based on Hausdorff outer measures.

35 A random variable X is a bounded function from Ω to the real numbers R. This function is called gamble in Walley (1991) or random quantity in de Finetti (1972, 1974).

36 For B in B let X B be the restriction to B of a random variable X defined on Ω and let sup X B be the supreme value assumed by X on B. For B in B and X B in K(B) a coherent upper conditional prevision "($ &) is a real functional on K(B) such that the following conditions hold for every X B and Y B in K(B) and positive constant λ:

37 1. "($ &) sup$ & 2. "(-$ &) =-"($ &) positive homogeneity 3. "($+0 &) "($ &) + "(0 &) subadditivity 4. "(& &) =1

38 If "($ &) is a coherent upper conditional prevision on a linear space K(B) then its conjugate coherent lower conditional prevision is defined by "($ &) = "( $ &) and "($ &) "($ &) If for every X B belonging to K(B) we have "($ &) ="($ &) ="($ &)

39 then "($ &) is called a coherent linear conditional prevision and it is a linear, positive functional on K(B). For each X in K(B) let "($ 3) be the function defined on Ω by "($ 3)(4) = "($ &) if 4 &. "($ 3) is called a coherent upper conditional prevision and it is separately coherent if all the "($ &) are separately coherent.

40

41 A necessary and sufficient condition for an upper prevision " to be coherent is to be the upper envelope of linear previsions, i.e. there exists a class M of linear previsions, defined on a same domain, such that "($) = sup6"($):" 89

42 A random variable X on Ω is B-measurable or measurable with respect to the partition B if it is constant on the atoms of the partition B (Walley 1991, p.291). Necessary condition for coherence If for every & 3 P(X B) are coherent linear conditional previsions and X is B-measurable then (Walley 1991, p. 292) "($ 3) =$

43 Motivations Why the necessity to propose a new model of coherent upper conditional prevision "($ 3)?

44 Because separately coherent upper conditional prevision "($ 3) cannot always be defined as extension of conditional expectation :($ ;) of measurable random variables. In fact conditional expectation :($ ;) defined by the Radon-Nikodym derivative, according to the axiomatic definition, may fail to be separately coherent.

45 It occurs because one of the defining properties of the Radon- Nikodym derivative, that is to be measurable with respect to the sigma-field of the conditioning events, contradicts a necessary condition for the coherence ("($ 3) =$).

46 Linear coherent conditional prevision "($ 3) can be compared with conditional expectation :($ ;) if the partition B generates the sigma-field G (Koch, 1997, p. 262) :($ ;)(4) ="($ &) if 4 & with & 3

47 Definition of conditional expectation (Billingsley, 1986) Let F and G be two sigma-fields of subsets of Ω with G F and let X be an integrable, F-measurable random variable. Let P be a probability measure on F ; define a measure = on G by =(>) =? $ ".! This function is unique up to a set of P-measure zero and it is a version of the conditional expectation value.

48 This measure is finite and absolutely continuous with respect to P (i.e. "(") =0 =(") =0 " & ). Thus there exists a function, the Radon-Nikodym derivative, denoted by :($ ;), G-measurable, integrable and satisfying the functional equation? :($ ;) " =? $ "!! with G in ;. This function is unique up to a set of P-measure zero and it is a version of the conditional expectation value.

49 If linear conditional prevision "($ 3) is defined by the Radon- Nikodym derivative the necessary condition for coherence "($ 3) =$ is not always satisfied.

50 Theorem 1 Let Ω =[0,1], let F be the Borel sigma-field of [0,1] and let P be the Lebesgue measure on F. Let G be a sub sigma-field properly contained in F and containing all singletons of [0,1]. Let B be the partition of all singletons of [0,1] and let X be the indicator function of an event A belonging to F-G. If we define the linear conditional prevision "($ 649) equal to the Radon-Nikodym derivative with probability 1, that is "($ 649) =:($ ;) except on a set N of [0,1] of P-measure zero, then the conditional prevision "($ 649) is not coherent. (Theorem 1 S. Doria, Annals of Operation Research, Vol. 195, pp , 2012)

51 If the equality "($ 649) =:($ ;) holds with probability 1, the linear conditional prevision "($ 649) is different from X, the indicator function of A. In fact having fixed A in F-G the indicator function of A is not G-measurable. It occurs because for every Borel set C $ +, (-) = 64 Ω $(4) -9 =

52 2 if 0, 1-0" if 1 - and 0 - = " : if 0 - and 1-1 0Ω if 0, 1 - / and since A G then X is not G-measurable.

53 Example 1 (Billingsley, 1986; Seidenfeld et al. 2001) Let Ω = [0,1] F = Borel sigma-field of Ω, P = the Lebesgue measure on F G = the sub sigma-field of sets that are either countable or cocountable B = the partition of all singletons of [0,1].

54 If the linear conditional prevision is equal, with probability 1, to conditional expectation defined by the Radon-Nikodym derivative, we have that "($ 3) =:($ ;) ="($) since the events in G have probability either 0 or 1.

55 So when X is the indicator function of an event A = [a,b] with 0 < a < b < 1 then "($ 3) ="(") and it does not satisfy the necessary condition for coherence, that is "($ 649) =$.

56 Evident from Theorem 1 and Example 1 is the necessity to introduce a new mathematical tool to define coherent conditional previsions.

57 The model For every & 3 denote by s the Hausdorff dimension of the conditioning event B and by h < the Hausdorff s-dimensional outer measure. h < is called the Hausdorff outer measure associated with the coherent upper conditional prevision "($ &).

58

59 Theorem 2. Let L(B) be the class of all bounded random variables on B and let m be a 0-1-valued finitely additive, but not countably additive, probability on (&) such that a different m is chosen for each B. Then for each & 3 the functional "($ &) defined on L(B) by "($ &) =,? $ >? h< if 0 <h < (&) <+ "($ &) =C($&) if h < (&) =0,+ is a coherent upper conditional prevision. (Theorem 2, S. Doria, Annals of Operation Research, Vol. 195, pp.38-44, 2012)

60 The unconditional coherent upper prevision "($ Ω) is obtained as a particular case when the conditioning event is Ω. Coherent upper conditional probabilities "(" &) are obtained when only 0-1 valued random variables are considered. Theorem 3 Let m be a 0-1-valued finitely additive, but not countably additive, probability on (&) such that a different m is chosen for each B. Then for each & 3 the function "($ &) defined on (&) by

61 and by "(" &) = h< ("&) h < (&) DE 0 < h < (&) <+ "(" &) =C("&) DE h < (&) =0,+ is a coherent upper conditional probability.

62 Main Results Let B be a set with positive and finite Hausdorff outer measure in its Hausdorff dimension. Denote by (") ="(" &) = h< ("&) h < (&) the coherent upper conditional probability defined on (&). From Theorem 2 we have that the coherent upper conditional prevision "( &) is a functional on I(&) with

63 values in R and the coherent upper conditional probability integral represents "($ &) since "($ &) =J$ = 1 h < (&) J$

64 If the conditioning event has positive and finite Hausdorff outer measure in its Hausdorff dimension and K(B) is a linear lattice of bounded random variables containing all constants Necessary and sufficient conditions for a coherent upper conditional prevision to be uniquely represented as the Choquet integral with respest to the upper conditional probability defined by its associated Hausdorff outer measure are to be : Monotone Comonotonically additive Submodular Continuous from below

65 University Gabriele d Annunzio Chieti-Pescara - Italy Handling Uncertainty in Complex Systems Dr. Serena Doria Department of Engineering and Geology, University G. d Annunzio The aim of the course is to introduce some new results proposed in literature to represent and handling uncertainty in complex systems.

66 A new model of coherent upper and lower conditional previsions based on Hausdorff outer measures.

67 Let B be a partition of Ω. For B in B let X B be the restriction to B of a random variable X defined on Ω and let sup X B be the supreme value assumed by X on B. For B in B and X B in K(B) a coherent upper conditional prevision!(# %) is a real functional on K(B) such that the following conditions hold for every X B and Y B in K(B) and positive constant λ:

68 1.!(# %) sup# % 2.!(,# %) =,!(# %) positive homogeneity 3.!(#+/ %)!(# %) +!(/ %) subadditivity 4.!(% %) =1

69 If!(# %) is a coherent upper conditional prevision on a linear space K(B) then its conjugate coherent lower conditional prevision is defined by!(# %) =!( # %) and!(# %)!(# %) If for every X B belonging to K(B) we have!(# %) =!(# %) =!(# %) then!(# %) is called a coherent linear conditional prevision and it is a linear, positive functional on K(B).

70 For each X in K(B) let!(# 2) be the function defined on Ω by!(# 2)(3) =!(# %) if 3 %.!(# 2) is called a coherent upper conditional prevision and it is separately coherent if all the!(# %) are separately coherent.

71 The model For every % 2 denote by s the Hausdorff dimension of the conditioning event B and by h 6 the Hausdorff s-dimensional outer measure. h 6 is called the Hausdorff outer measure associated with the coherent upper conditional prevision!(# %).

72

73 Theorem 2. Let L(B) be the class of all bounded random variables on B and let m be a 0-1-valued finitely additive, but not countably additive, probability on (%) such that a different m is chosen for each B. Then for each % 2 the functional!(# %) defined on L(B) by!(# %) = 8 < 9 : (;) ; #=h6 if 0 <h 6 (%) <+!(# %) =!(#%) if h 6 (%) =0,+ is a coherent upper conditional prevision. (Theorem 2, S. Doria, Annals of Operation Research, Vol. 195, pp.38-44, 2012)

74 The unconditional coherent upper prevision!(# Ω) is obtained as a particular case when the conditioning event is Ω. Coherent upper conditional probabilities!($ %) are obtained when only 0-1 valued random variables are considered. Theorem 3 Let m be a 0-1-valued finitely additive, but not countably additive, probability on (%) such that a different m is chosen for each B. Then for each % 2 the function!(# %) defined on (%) by

75 and by!($ %) = h6 ($%) h 6 (%) %& 0 < h 6 (%) <+!($ %) =!($%) %& h 6 (%) =0,+ is a coherent upper conditional probability.

76 Main Results Let B be a set with positive and finite Hausdorff outer measure in its Hausdorff dimension. Denote by ' ; ($) =!($ %) = h6 ($%) h 6 (%) the coherent upper conditional probability defined on (%). From Theorem 2 we have that the coherent upper conditional prevision!( %) is a functional on *(%) with

77 values in R and the coherent upper conditional probability ' ; integral represents!(# %) since!(# %) =,#=' ; = 1 h 6 (%),#=h6 ;

78 If the conditioning event has positive and finite Hausdorff outer measure in its Hausdorff dimension and K(B) is a linear lattice of bounded random variables containing all constants Necessary and sufficient conditions for a coherent upper conditional prevision to be uniquely represented as the Choquet integral with respest to the upper conditional probability defined by its associated Hausdorff outer measure are to be : Monotone Comonotonically additive Submodular Continuous from below

79 Hausdorff outer measures Given a non-empty set Ω, let (Ω) be the class of all subsets of Ω. An outer measure is a function ' : (Ω) [0,+ ] such that ' ( ) =0, ' ($) ' ($ 2 ) if $ $ (monotonicity) ' :8 $ 7 ; 7:8 ' ($ 7 ) (subadditivity)

80 Given an additive set function ' defined on a class S properly contained in the power-set (Ω) its outer measure ' and inner measure ' are defined on (Ω) by ' ($) =inf@'(%):% $;% CD, $ (Ω) ' ($) =sup@'(%):% $;% CD, $ (Ω)

81 Examples of outer measures are the Hausdorff outer measures (named for Felix Hausdorff )

82 (Rogers C., 1970, Falconer K., 1986) Let (Ω,d) be a metric space. Metric spaces Let Ω be a non-empty set and =: Ω Ω R a function such that 1M) H, I Ω =(H, I) =0 H=I 2M) H, I, K Ω =(H, I) +=(H, K) =(I,K) = is called a metric on Ω and the pair (Ω, =) is a metric space. If in 2M) I =K, from 1M) we have

83 =(H, I) 0 If in 2M) H =K we have =(H, I) =(I, H). Since it holds for every H, I Ω we have =(I, H) =(H, I) That is =(H, I) ==(I,H). A topology, called the metric topology, can be introduced in any metric space by defining the open sets of the space as the sets G with the property:

84 If x is a point of G, then for some r > 0 all points y with =(H, I) < M also belong to G.

85 Let (Ω,d) be a metric space. The diameter of a non - empty subset U of Ω is defined as N =sup@=(h, I) H,I ND For δ > 0 the 7 D 89 7:8 is called a δ-cover of a subset E of Ω if 89 P 7:8 N 7 and 0 < N 7 Q

86

87 Let s be a non-negative number. We define the function 9 h R 6 (P) = infs N 7 6 7:8 where the inferior is over all countable 7 D 89 7:8.

88 The Hausdorff s-dimensional outer measure of E, denoted by h 6, is defined as h 6 (P) =lim R W h R 6 (P) This limit exists, but may be infinite, since h R 6 increases as δ decreases because less δ-covers are available.

89 Remark 1 : The limit of a monotone decreasing function when the variable δ goes to the inferior of its possible values exists and is equal to the supreme value of the possible values of the function. Remark 2: The function h R 6 is a decreasing function on δ, For every Q and Q 8 : Q < Q 8 h 6 R (P) h 6 R[ (P) In fact if Q < Q 8 the class of δ-covers is less than the class of Q 8 -covers because all the γ-covers with Q < \<Q 8 are Q 8 -covers but not δ-covers.

90 So for every subset E of Ω the function h R 6 is a decreasing function on δ since when δ decreases the inferior increases because it is calculated on a smaller class of δ-covers. The Hausdorff dimension of a set A, dim ] (A), is defined as the unique value, such that h 6 ($) =+ if 0 _<dim ] ($) h 6 ($) =0 if dim ] ($) <_<+

91 If 0 < h 6 ($) < + then dim ] ($) = _, but the converse is not true (If A is a countable set dim ] ($) =0 and h W ($) =+ ). The Hausdorff dimension is the critical value of s at which the jump from + to 0 occurs (Falconer 1990).

92 Example Let (Ω, =) be the Euclidean metric space with Ω =[0,1]`. Let P Ω be a square of side l.

93 N 7 = ab c d e` 9 h R 6 (P) = infs N 7 6 +b c d e` 7:8 = c 2 < δ d 9 h 6 R (P) = infs N 7 6 = h` i j 6 h 2k 7:8 h 6 (P) =lim R W h R 6 (P) = lim d 9 h` b c d 2e 6

94 _=0 h W (P) =lim d 9 h` b c d 2e W =+ _=1 h 8 (P) =lim d 9 h` b c d 2e 8 =+ _=2 h`(p) =lim d 9 h` b c d 2e` =2j` _=3 h m (P) =lim d 9 h` b c d 2e m =0

95 So, 0< h`(p) <+ dim ] (P) =2

96 A subset A of Ω is called measurable with respect to the outer measure h 6 if it decomposes every subset of Ω additively, that is for all sets P Ω. h 6 (P) =h 6 ($ P) + h 6 (P $) The class of all measurable sets is a sigma-field.

97 Hausdorff s-dimensional outer measures are metric outer measures, h 6 (P p) =h 6 (P) +h 6 (p) whenever =(P, p) =inf@=(h, I):H P,I pd >0

98 All Borel subsets of Ω are measurable with respect to any metric outer measure (Falconer 1986, Theorem 1.5) So every Borel subset of Ω is measurable with respect to every Hausdorff outer measure h 6 since Hausdorff outer measures are metric. The restriction of the Hausdorff outer measure h 6 to the sigma-field of h 6 -measurable sets, containing the sigma-field of the Borel sets, is called Hausdorff s-dimensional measure.

99 The Hausdorff 0-dimensional measure is the counting measure; the Hausdorff 1-dimensional measure is the Lebeasgue measure The Hausdorff s-dimensional measures are modular on the Borel sigma-field, that is h 6 ($ %) +h 6 ($ %) =h 6 ($) +h 6 (%)

100 for every pair of Borel sets A and B. So (Denneberg, 1994 Proposition 2.4) Hausdorff outer measures are submodular (or 2-alternating) h 6 ($ %) +h 6 ($ %) h 6 ($) +h 6 (%)

101 Denote by O the class of all open sets of Ω and by C the class of all compact sets of Ω, the restriction of each Hausdorff s- dimensional outer measure to the class H of all h 6 - measurable sets with finite Hausdorff s-dimensional outer measure is strongly regular, that is it is regular outer regular (a) h 6 ($) =inf@h 6 (N) $ N, N rd for all A H inner regular (b) h 6 ($) =sup@h 6 (s) s $, s td for all A H

102 With the additional property (c) 6 (N $) $ N, N rd =0 for all A H. Any Hausdorff s-dimensional outer measure is continuous from below (Falconer 1986, Lemma 1.3), that is for any increasing sequence u$ v w of sets lim v 9 h6 x$ v y=h 6 ilim v 9 $ v k

103 Any Hausdorff s-dimensional outer measure is translation invariant (Falconer 1986, p.18) where H +P=@H +I:I PD h 6 (H+P) =h 6 (P)

104 University Gabriele d Annunzio Chieti-Pescara - Italy Handling Uncertainty in Complex Systems Dr. Serena Doria Department of Engineering and Geology, University G. d Annunzio

105 Cohere Coherent conditional measures of risk Coherent conditional measures of risk defined be the Choquet integral with respect to Hausdorff outer measures and dependent risks

106 Motivations A new definition of coherent conditional measure of risk based on Hausdorff outer measures A new definition of stochastic independence for random variables

107 A new model of coherent upper conditional previsions based on Hausdorff outer measures has been introduced because conditional expectation defined in the axiomatic way, by the Radon-Nikodym derivative, may fail to be coherent. (Doria, 2012 Theorem 1)

108 A new model of coherent upper conditional prevision based on Hausdorff outer measures (Doria, 2012 Theorem 2) Let m be a 0-1 valued finitely additive, but not countably additive, probability on (#) such that a different m is chosen for each #. Then for each # & the functionals '(( #) defined on *(#) by '(( #) =. 1 h 1 (#) 2(3h < h 1 (#) <+ -, # :((#) 45 h 1 (#) =0,+ are separately coherent upper conditional previsions.

109 The unconditional prevision is obtained when the conditioning event is Ω. '(( &)(=) is the random variable equal to '(( #) if = #.

110 Coherent upper conditional probabilities are obtained when only indicator functions of events are considered. (Doria, 2012 Theorem 3) Let m be a 0-1 valued finitely additive, but not countably additive, probability on (#) such that a different m is chosen for each #. Then for each # & the function '( #) defined on (#) by '( #) = is a coherent upper conditional probability.. h1 ( #) h 1 (#) 45 0 < h 1 (#) <+ -,:( #) 45 h 1 (#) =0,+

111 A coherent conditional measure of risk!( #) is a functional on the class "(#) of all random variables (or risks) defined on B, such that the following axioms are satisfied for every (, # "(#): (i) (ii) Monotonicity ( #!(( #)!(( #) Subadditivity!((+# #)!(( #) +!(# #) (iii) Traslation invariance!((+h #)!(( #) +h (iv) Positive homogeneity!('( #) ='!(( #)

112 Let # & be a set with positive and finite Hausdorff outer measure in its Hausdorff dimension, i.e. 0 <h 1 (#) <+, the functional!( #) defined on L(B) by!(( #) = '(( #) = 1 h 1 (#) 2 (3h1 ( is a coherent conditional measure of risk, which is comonotonically additive and continuous from below.

113 MOTIVATIONS In a continuous probabilistic space, where the probability is usually assumed equal to the Lebesgue measure, the standard definition of independence given by the factorization property '( #) ='( )'(#) is always satisfied for finite, countable and fractal sets (i.e. sets with non integer Hausdorff dimension) since both members of the equality are zero.

114 Hausdorff dimension of a set Dim H=1 Dim H=2 Ω

115 Sierpinsky Triangle Dim H= log3/log2

116 If coherent upper and lower conditional probabilities are defined by outer and inner Hausdorff measures, an event B is always irrelevant, according to the definition proposed by Walley, to an event A if dim - A<dim - B<dim - Ω. In fact the equalities '( #) ='( # 0 ) ='( Ω) '( #) ='( # 0 ) ='( Ω) vanish to 0=0. So the notion of s-irrelevance for events has been introduced (Doria 2007).

117 B is s-irrelevant to A if the following conditions hold dim - A=dim - B=dim - AB '( #) ='( # 0 ) ='( Ω) '( #) ='( # 0 ) ='( Ω) If B is s-irrelevant to A and A is s-irrelevant to B thus A and B are s-independent

118 S-irrelevance and s-independence for random variables The class of the weak upper level sets of the random variable X 1=23= Ω:((=) 67 6 R 7 x X A 1 Ω=[0,1]

119 The atoms of the class 1 of the weak upper level sets of the random variable X are the minimal sets with respect to inclusion in 1 1(() = 3 7 X A B 1(() =23 7 3#7>

120 The atom is the union of the points where the random variable assumes the maximum value. If a random variable X is such that the class of the upper level sets contains the n- Cantor where? A =[0,1],? B =C0, B D E CF D,1E,? F =C0, B G E CF G, B D E CF D, H G E CI G,1E. R? =?JKLMN OPL 1(() = 3?7 34: T?= UVWF UVWD

121 This kind of structure of the upper level sets and of the atom describes stability in the random variable because we know that after a certain interval (of time) the random variable assumes again the maximum value.

122 600 6, , , , , ,00 0 0,00 gen-38 set-38 mag-39 gen-40 set-40 mag-41 gen-42 set-42 mag-43 gen-44 mag-45 set-44 gen-46 mag-47 set-46 gen-48 set-48 mag-49 gen-50 set-50 mag-51 gen-52 set-52 mag-53 gen-54 set-54 mag-55 gen-56 mag-57 set-56 gen-58 mag-59 set-58 gen-60 set-60 mag-61 gen-62 set-62 mag-63 gen-64 set-64 mag-65 gen-66 set-66 mag-67 gen-68 mag-69 set-68 gen-70 mag-71 set-70 gen-72 set-72 mag-73 gen-74 set-74 mag-75 gen-76 set-76 mag-77 gen-78 set-78 mag-79 gen-80 mag-81 set-80 gen-82 mag-83 set-82 gen-84 set-84 mag-85 gen-86 set-86 mag-87 gen-88 set-88 mag-89 gen-90 set-90 mag-91 gen-92 mag-93 set-92 gen-94 mag-95 set-94 gen-96 set-96 mag-97 gen-98 set-98 mag-99 gen-00 set-00 mag-01 Piogge (mm) S Eufemia Portata totale (m3/sec) Jan-38 May-01 The blue graph is related to the rainfalls in S. Eufemia ( a mountain village near Pescara, Abruzzo, Italy)) The pink graph is related to the water flow rate of the source Sorgente Verde (Abruzzo, Italy). Sorgente Verde has been a water source not dry during this period (and also now). (The author is grateful to Prof. Rusi -Dept. InGeo- for the data and the graph)

123 S-irrelevance and s-independent for random variables Let X and Y two random variables and let S(X) and S(Y) respectively the classes of their atoms. S(Y) is s-irrelevant to S(X) if for every E S(X) and F S(Y) Y is s-irrelevant to X S(Y) is s-irrelevant to S(X) X and Y are s-independent S(X) is s-irrelevant to S(Y) and S(Y) is s-irrelevant to S(X)

124 S-dependent random variables X Y A B 1(() = 3 7 1(#) = 3#7 Ω=[0,1] 34: T =34: T #=0 34: T #

125 Since # = X and Y are s-dependent

126 S-independent random variables X Y 1/4 1/2 3/4 1 A B Ω=[0,1]

127 34: T =34: T #=34: T # =1 '( #) ='( # [ ) ='( ) '(# ) ='(# 0 ) ='(#) X and Y are s-independent

128 Coherent conditional measures of risk based on Hausdorff outer measures can be represented as Choquet integral are comonotonically additive are countinuous from below S-independence for random variables or risks s-independence of the indicator functions of two sets does not imply s-independence of the indicator functions of their complements s-independence for random variables does not imply the factorization of the joint distribution into the product of the marginal distributions

129 According to the axiomatic definition two random variables X and Y are independent if and only if the sigma-fields generated by them, are independent. Since the sigma-field generated by a random variable X is the smallest sigma-field with respect to which X is measurable, it contains the inverse image of all borelian sets of R. So if the random variables X and Y are independent then the joint distribution is equal to the product of the marginal distributions.

130 S-independence of random variables X and Y does not imply that the joint distribution is equal to the product of the marginal and. It occurs because s-independence between random variables implies that the factorization property holds only for the atoms (i.e. minimal sets with respect to the inclusion) of the classes generated by the weak upper level sets of X and Y and not for all sets of the sigmafields generated by X and Y.

131 Handling Uncertainty in Complex Systems Dr. Serena Doria Department of Engineering and Geology, University G. d Annunzio The aim of the course is to introduce some new results proposed in literature to represent and handling uncertainty in complex systems.

132 Iterated function systems Let (R n, d) be the Euclidean metric space. A function f : R n R n is called a contraction if d( f (x), f (y)) rd(x, y) for all x, y R n, where 0 < r < 1 is a constant. The infimum value for which this inequality holds for all x, y is called the ratio of the contraction. A contraction that trasforms every subset of R n to a geometrically similar set is called a similitude. A similitude is a composition of a dilation, a rotation and translation. A set E is called invariant for a finite set of contractions {f 1, f 2,..., f m } if ( #=%& ' (#) ')*

133 If the contractions are similitudes and for some s we have h s (E) > 0 and h s ( f i (E) f j (E)) = 0 for - / then E is self similar. For any finite set of contractions there exists a unique nonempty compact invariant set K (Falconer, 1986, Theorem 8.3), called attractor. Given a finite set of contractions {f 1, f 2,..., f m } we say that the open set condition (OSC) holds if there exists a bounded open set O such that ( O ')* & ' (O) and & ' (O) & 5 (O) = for - /. If { f 1, f 2,..., f m } are similitudes with similarity ratios r i for i = 1...m the similarity dimension, which has the advantage of being easily calculable, is the unique positive number s for which

134 < 7(8 9 ) : =; 9); If the OSC holds then the compact invariant set K is selfsimilar and the Hausdorff dimension and the similarity dimension of K are equal.

135 The model of Sierpinski triangle Let s try to clarify what above said by introducing a classic example of an attractor of a family of similarities known as Sierpinski triangle. Let = =>?, ;! >?, ;! (the square in the figure) e let E be the triangle of vertices O(0,0), A(1,0), B# ; $,;%. All points & = represent the possible states in which the system is to be situated after the first meeting. E

136 Let consider the following family of similarities '( 9 ) * 9); : -= ;. $ ( ; :, /= ; ; $ 0 ( $ :, -= ; $. / = ; ; $ 0+; $ -= ; $.+; $ 2 $ :,. /= ; ; $ 0+; $ Iteratively applying the three transformations to the initial triangle E you get the attractor of the system of similarities, known as the Sierpinsky triangle shown in the following figure:

137 The Hausdorff dimension of the Sierpinski triangle coincides with the size of the similarity dimension s and is calculated by solving the equation (1): *3 ; $ 4 : =; that is : = 567$ 567* <$. The Sierpinski triangle is a fractal, because its Hausdorff dimension has a fractional number, and is self-similar because its geometric structure is repeated identically at different scales. This property is also expressed by saying

138 that a single part reproduces the whole. In addition, the Sierpinski triangle presents symmetries. Fractal Antennas Since fractals show up in the real world of nature (snail shells, leaves on a tree, pine cones), why not see if they perform well as antennas? It turns out that if you make antennas with fractal shapes, they will radiate, and often have multiband properties. Exmaples of these antennas are below:

139

140 s-independence for curves filling the space The notions of s-irrelevance and s-independence for events A and B that are represented by curves filling the space are analyzed. In particular Peano curve, Hilbert curve and Peano-Sierpinski curve are proven to be s-independent. Curves filling the space Sagan (1994) can be defined as the limit of a Cauchy sequence of continuous functions f n, each mapping the unit interval into the unit square. The convergence is uniform so that the limit is a continuous function, i.e. a curve. Six iterations of the Hilbert curve construction, whose limiting space-filling curve was devised by mathematician David Hilbert.

141 Definition Let (Ω, d) be a metric space and let A and B be two curves filling the space _. Then A and B are s-independent if the following conditions hold 1s) dimh(ab) = dimh(b)= dimh(a) 2s) P(A B) = P(A) and P(A B) = P(A); 3s) P(B A) = P(B) and P(B A) = P(B); Moreover B is s-irrelevant to A if conditions 1s) and 2s) are satisfied. Theorem Let Ω = [0, 1] n and let :; and : be the upper and lower conditional probabilities defined as in Theorem 4. If A and B are two curves filling the space then A and B are s- independent.

Serena Doria. Department of Sciences, University G.d Annunzio, Via dei Vestini, 31, Chieti, Italy. Received 7 July 2008; Revised 25 December 2008

Serena Doria. Department of Sciences, University G.d Annunzio, Via dei Vestini, 31, Chieti, Italy. Received 7 July 2008; Revised 25 December 2008 Journal of Uncertain Systems Vol.4, No.1, pp.73-80, 2010 Online at: www.jus.org.uk Different Types of Convergence for Random Variables with Respect to Separately Coherent Upper Conditional Probabilities

More information

Regular finite Markov chains with interval probabilities

Regular finite Markov chains with interval probabilities 5th International Symposium on Imprecise Probability: Theories and Applications, Prague, Czech Republic, 2007 Regular finite Markov chains with interval probabilities Damjan Škulj Faculty of Social Sciences

More information

Chapter 4. Measure Theory. 1. Measure Spaces

Chapter 4. Measure Theory. 1. Measure Spaces Chapter 4. Measure Theory 1. Measure Spaces Let X be a nonempty set. A collection S of subsets of X is said to be an algebra on X if S has the following properties: 1. X S; 2. if A S, then A c S; 3. if

More information

II - REAL ANALYSIS. This property gives us a way to extend the notion of content to finite unions of rectangles: we define

II - REAL ANALYSIS. This property gives us a way to extend the notion of content to finite unions of rectangles: we define 1 Measures 1.1 Jordan content in R N II - REAL ANALYSIS Let I be an interval in R. Then its 1-content is defined as c 1 (I) := b a if I is bounded with endpoints a, b. If I is unbounded, we define c 1

More information

18.175: Lecture 2 Extension theorems, random variables, distributions

18.175: Lecture 2 Extension theorems, random variables, distributions 18.175: Lecture 2 Extension theorems, random variables, distributions Scott Sheffield MIT Outline Extension theorems Characterizing measures on R d Random variables Outline Extension theorems Characterizing

More information

Introduction to Hausdorff Measure and Dimension

Introduction to Hausdorff Measure and Dimension Introduction to Hausdorff Measure and Dimension Dynamics Learning Seminar, Liverpool) Poj Lertchoosakul 28 September 2012 1 Definition of Hausdorff Measure and Dimension Let X, d) be a metric space, let

More information

Research Article On Decomposable Measures Induced by Metrics

Research Article On Decomposable Measures Induced by Metrics Applied Mathematics Volume 2012, Article ID 701206, 8 pages doi:10.1155/2012/701206 Research Article On Decomposable Measures Induced by Metrics Dong Qiu 1 and Weiquan Zhang 2 1 College of Mathematics

More information

The Lebesgue Integral

The Lebesgue Integral The Lebesgue Integral Brent Nelson In these notes we give an introduction to the Lebesgue integral, assuming only a knowledge of metric spaces and the iemann integral. For more details see [1, Chapters

More information

MAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9

MAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9 MAT 570 REAL ANALYSIS LECTURE NOTES PROFESSOR: JOHN QUIGG SEMESTER: FALL 204 Contents. Sets 2 2. Functions 5 3. Countability 7 4. Axiom of choice 8 5. Equivalence relations 9 6. Real numbers 9 7. Extended

More information

INTRODUCTION TO FRACTAL GEOMETRY

INTRODUCTION TO FRACTAL GEOMETRY Every mathematical theory, however abstract, is inspired by some idea coming in our mind from the observation of nature, and has some application to our world, even if very unexpected ones and lying centuries

More information

The Hausdorff Measure of the Attractor of an Iterated Function System with Parameter

The Hausdorff Measure of the Attractor of an Iterated Function System with Parameter ISSN 1479-3889 (print), 1479-3897 (online) International Journal of Nonlinear Science Vol. 3 (2007) No. 2, pp. 150-154 The Hausdorff Measure of the Attractor of an Iterated Function System with Parameter

More information

Lebesgue Measure on R n

Lebesgue Measure on R n CHAPTER 2 Lebesgue Measure on R n Our goal is to construct a notion of the volume, or Lebesgue measure, of rather general subsets of R n that reduces to the usual volume of elementary geometrical sets

More information

ON THE EQUIVALENCE OF CONGLOMERABILITY AND DISINTEGRABILITY FOR UNBOUNDED RANDOM VARIABLES

ON THE EQUIVALENCE OF CONGLOMERABILITY AND DISINTEGRABILITY FOR UNBOUNDED RANDOM VARIABLES Submitted to the Annals of Probability ON THE EQUIVALENCE OF CONGLOMERABILITY AND DISINTEGRABILITY FOR UNBOUNDED RANDOM VARIABLES By Mark J. Schervish, Teddy Seidenfeld, and Joseph B. Kadane, Carnegie

More information

Construction of a general measure structure

Construction of a general measure structure Chapter 4 Construction of a general measure structure We turn to the development of general measure theory. The ingredients are a set describing the universe of points, a class of measurable subsets along

More information

Max-min (σ-)additive representation of monotone measures

Max-min (σ-)additive representation of monotone measures Noname manuscript No. (will be inserted by the editor) Max-min (σ-)additive representation of monotone measures Martin Brüning and Dieter Denneberg FB 3 Universität Bremen, D-28334 Bremen, Germany e-mail:

More information

MATHS 730 FC Lecture Notes March 5, Introduction

MATHS 730 FC Lecture Notes March 5, Introduction 1 INTRODUCTION MATHS 730 FC Lecture Notes March 5, 2014 1 Introduction Definition. If A, B are sets and there exists a bijection A B, they have the same cardinality, which we write as A, #A. If there exists

More information

Chapter 1. Measure Spaces. 1.1 Algebras and σ algebras of sets Notation and preliminaries

Chapter 1. Measure Spaces. 1.1 Algebras and σ algebras of sets Notation and preliminaries Chapter 1 Measure Spaces 1.1 Algebras and σ algebras of sets 1.1.1 Notation and preliminaries We shall denote by X a nonempty set, by P(X) the set of all parts (i.e., subsets) of X, and by the empty set.

More information

1.1. MEASURES AND INTEGRALS

1.1. MEASURES AND INTEGRALS CHAPTER 1: MEASURE THEORY In this chapter we define the notion of measure µ on a space, construct integrals on this space, and establish their basic properties under limits. The measure µ(e) will be defined

More information

Two theories of conditional probability and non-conglomerability

Two theories of conditional probability and non-conglomerability 8th International Symposium on Imprecise Probability: Theories and Applications, Compiègne, France, 2013 Two theories of conditional probability and non-conglomerability Teddy Seidenfeld Mark J. Schervish

More information

Hausdorff Measure. Jimmy Briggs and Tim Tyree. December 3, 2016

Hausdorff Measure. Jimmy Briggs and Tim Tyree. December 3, 2016 Hausdorff Measure Jimmy Briggs and Tim Tyree December 3, 2016 1 1 Introduction In this report, we explore the the measurement of arbitrary subsets of the metric space (X, ρ), a topological space X along

More information

STAT 7032 Probability Spring Wlodek Bryc

STAT 7032 Probability Spring Wlodek Bryc STAT 7032 Probability Spring 2018 Wlodek Bryc Created: Friday, Jan 2, 2014 Revised for Spring 2018 Printed: January 9, 2018 File: Grad-Prob-2018.TEX Department of Mathematical Sciences, University of Cincinnati,

More information

Analysis of Probabilistic Systems

Analysis of Probabilistic Systems Analysis of Probabilistic Systems Bootcamp Lecture 2: Measure and Integration Prakash Panangaden 1 1 School of Computer Science McGill University Fall 2016, Simons Institute Panangaden (McGill) Analysis

More information

Lebesgue Measure on R n

Lebesgue Measure on R n 8 CHAPTER 2 Lebesgue Measure on R n Our goal is to construct a notion of the volume, or Lebesgue measure, of rather general subsets of R n that reduces to the usual volume of elementary geometrical sets

More information

On Kusuoka Representation of Law Invariant Risk Measures

On Kusuoka Representation of Law Invariant Risk Measures MATHEMATICS OF OPERATIONS RESEARCH Vol. 38, No. 1, February 213, pp. 142 152 ISSN 364-765X (print) ISSN 1526-5471 (online) http://dx.doi.org/1.1287/moor.112.563 213 INFORMS On Kusuoka Representation of

More information

Topological properties of Z p and Q p and Euclidean models

Topological properties of Z p and Q p and Euclidean models Topological properties of Z p and Q p and Euclidean models Samuel Trautwein, Esther Röder, Giorgio Barozzi November 3, 20 Topology of Q p vs Topology of R Both R and Q p are normed fields and complete

More information

Part V. 17 Introduction: What are measures and why measurable sets. Lebesgue Integration Theory

Part V. 17 Introduction: What are measures and why measurable sets. Lebesgue Integration Theory Part V 7 Introduction: What are measures and why measurable sets Lebesgue Integration Theory Definition 7. (Preliminary). A measure on a set is a function :2 [ ] such that. () = 2. If { } = is a finite

More information

Sklar s theorem in an imprecise setting

Sklar s theorem in an imprecise setting Sklar s theorem in an imprecise setting Ignacio Montes a,, Enrique Miranda a, Renato Pelessoni b, Paolo Vicig b a University of Oviedo (Spain), Dept. of Statistics and O.R. b University of Trieste (Italy),

More information

Measures. Chapter Some prerequisites. 1.2 Introduction

Measures. Chapter Some prerequisites. 1.2 Introduction Lecture notes Course Analysis for PhD students Uppsala University, Spring 2018 Rostyslav Kozhan Chapter 1 Measures 1.1 Some prerequisites I will follow closely the textbook Real analysis: Modern Techniques

More information

Measure and Integration: Concepts, Examples and Exercises. INDER K. RANA Indian Institute of Technology Bombay India

Measure and Integration: Concepts, Examples and Exercises. INDER K. RANA Indian Institute of Technology Bombay India Measure and Integration: Concepts, Examples and Exercises INDER K. RANA Indian Institute of Technology Bombay India Department of Mathematics, Indian Institute of Technology, Bombay, Powai, Mumbai 400076,

More information

HAUSDORFF DIMENSION AND ITS APPLICATIONS

HAUSDORFF DIMENSION AND ITS APPLICATIONS HAUSDORFF DIMENSION AND ITS APPLICATIONS JAY SHAH Abstract. The theory of Hausdorff dimension provides a general notion of the size of a set in a metric space. We define Hausdorff measure and dimension,

More information

Module 1. Probability

Module 1. Probability Module 1 Probability 1. Introduction In our daily life we come across many processes whose nature cannot be predicted in advance. Such processes are referred to as random processes. The only way to derive

More information

On maxitive integration

On maxitive integration On maxitive integration Marco E. G. V. Cattaneo Department of Mathematics, University of Hull m.cattaneo@hull.ac.uk Abstract A functional is said to be maxitive if it commutes with the (pointwise supremum

More information

Indeed, if we want m to be compatible with taking limits, it should be countably additive, meaning that ( )

Indeed, if we want m to be compatible with taking limits, it should be countably additive, meaning that ( ) Lebesgue Measure The idea of the Lebesgue integral is to first define a measure on subsets of R. That is, we wish to assign a number m(s to each subset S of R, representing the total length that S takes

More information

(2) E M = E C = X\E M

(2) E M = E C = X\E M 10 RICHARD B. MELROSE 2. Measures and σ-algebras An outer measure such as µ is a rather crude object since, even if the A i are disjoint, there is generally strict inequality in (1.14). It turns out to

More information

Chapter 2 Metric Spaces

Chapter 2 Metric Spaces Chapter 2 Metric Spaces The purpose of this chapter is to present a summary of some basic properties of metric and topological spaces that play an important role in the main body of the book. 2.1 Metrics

More information

Measures and Measure Spaces

Measures and Measure Spaces Chapter 2 Measures and Measure Spaces In summarizing the flaws of the Riemann integral we can focus on two main points: 1) Many nice functions are not Riemann integrable. 2) The Riemann integral does not

More information

Durham Research Online

Durham Research Online Durham Research Online Deposited in DRO: 16 January 2015 Version of attached le: Accepted Version Peer-review status of attached le: Peer-reviewed Citation for published item: De Cooman, Gert and Troaes,

More information

Measures. 1 Introduction. These preliminary lecture notes are partly based on textbooks by Athreya and Lahiri, Capinski and Kopp, and Folland.

Measures. 1 Introduction. These preliminary lecture notes are partly based on textbooks by Athreya and Lahiri, Capinski and Kopp, and Folland. Measures These preliminary lecture notes are partly based on textbooks by Athreya and Lahiri, Capinski and Kopp, and Folland. 1 Introduction Our motivation for studying measure theory is to lay a foundation

More information

Practical implementation of possibilistic probability mass functions

Practical implementation of possibilistic probability mass functions Practical implementation of possibilistic probability mass functions Leen Gilbert Gert de Cooman Etienne E. Kerre October 12, 2000 Abstract Probability assessments of events are often linguistic in nature.

More information

RS Chapter 1 Random Variables 6/5/2017. Chapter 1. Probability Theory: Introduction

RS Chapter 1 Random Variables 6/5/2017. Chapter 1. Probability Theory: Introduction Chapter 1 Probability Theory: Introduction Basic Probability General In a probability space (Ω, Σ, P), the set Ω is the set of all possible outcomes of a probability experiment. Mathematically, Ω is just

More information

Practical implementation of possibilistic probability mass functions

Practical implementation of possibilistic probability mass functions Soft Computing manuscript No. (will be inserted by the editor) Practical implementation of possibilistic probability mass functions Leen Gilbert, Gert de Cooman 1, Etienne E. Kerre 2 1 Universiteit Gent,

More information

Math212a1411 Lebesgue measure.

Math212a1411 Lebesgue measure. Math212a1411 Lebesgue measure. October 14, 2014 Reminder No class this Thursday Today s lecture will be devoted to Lebesgue measure, a creation of Henri Lebesgue, in his thesis, one of the most famous

More information

Random sets. Distributions, capacities and their applications. Ilya Molchanov. University of Bern, Switzerland

Random sets. Distributions, capacities and their applications. Ilya Molchanov. University of Bern, Switzerland Random sets Distributions, capacities and their applications Ilya Molchanov University of Bern, Switzerland Molchanov Random sets - Lecture 1. Winter School Sandbjerg, Jan 2007 1 E = R d ) Definitions

More information

On the equivalence of conglomerability and disintegrability for unbounded random variables

On the equivalence of conglomerability and disintegrability for unbounded random variables Stat Methods Appl (2014) 23:501 518 DOI 10.1007/s10260-014-0282-7 On the equivalence of conglomerability and disintegrability for unbounded random variables Mark J. Schervish Teddy Seidenfeld Joseph B.

More information

Measure Theory. John K. Hunter. Department of Mathematics, University of California at Davis

Measure Theory. John K. Hunter. Department of Mathematics, University of California at Davis Measure Theory John K. Hunter Department of Mathematics, University of California at Davis Abstract. These are some brief notes on measure theory, concentrating on Lebesgue measure on R n. Some missing

More information

Lebesgue measure on R is just one of many important measures in mathematics. In these notes we introduce the general framework for measures.

Lebesgue measure on R is just one of many important measures in mathematics. In these notes we introduce the general framework for measures. Measures In General Lebesgue measure on R is just one of many important measures in mathematics. In these notes we introduce the general framework for measures. Definition: σ-algebra Let X be a set. A

More information

Extension of coherent lower previsions to unbounded random variables

Extension of coherent lower previsions to unbounded random variables Matthias C. M. Troffaes and Gert de Cooman. Extension of coherent lower previsions to unbounded random variables. In Proceedings of the Ninth International Conference IPMU 2002 (Information Processing

More information

Self-similar Fractals: Projections, Sections and Percolation

Self-similar Fractals: Projections, Sections and Percolation Self-similar Fractals: Projections, Sections and Percolation University of St Andrews, Scotland, UK Summary Self-similar sets Hausdorff dimension Projections Fractal percolation Sections or slices Projections

More information

Bayesian Inference under Ambiguity: Conditional Prior Belief Functions

Bayesian Inference under Ambiguity: Conditional Prior Belief Functions PMLR: Proceedings of Machine Learning Research, vol. 6, 7-84, 07 ISIPTA 7 Bayesian Inference under Ambiguity: Conditional Prior Belief Functions Giulianella Coletti Dip. Matematica e Informatica, Università

More information

ITERATED FUNCTION SYSTEMS WITH CONTINUOUS PLACE DEPENDENT PROBABILITIES

ITERATED FUNCTION SYSTEMS WITH CONTINUOUS PLACE DEPENDENT PROBABILITIES UNIVERSITATIS IAGELLONICAE ACTA MATHEMATICA, FASCICULUS XL 2002 ITERATED FUNCTION SYSTEMS WITH CONTINUOUS PLACE DEPENDENT PROBABILITIES by Joanna Jaroszewska Abstract. We study the asymptotic behaviour

More information

Measure Theory on Topological Spaces. Course: Prof. Tony Dorlas 2010 Typset: Cathal Ormond

Measure Theory on Topological Spaces. Course: Prof. Tony Dorlas 2010 Typset: Cathal Ormond Measure Theory on Topological Spaces Course: Prof. Tony Dorlas 2010 Typset: Cathal Ormond May 22, 2011 Contents 1 Introduction 2 1.1 The Riemann Integral........................................ 2 1.2 Measurable..............................................

More information

A survey of the theory of coherent lower previsions

A survey of the theory of coherent lower previsions A survey of the theory of coherent lower previsions Enrique Miranda Abstract This paper presents a summary of Peter Walley s theory of coherent lower previsions. We introduce three representations of coherent

More information

FUNDAMENTALS OF REAL ANALYSIS by. II.1. Prelude. Recall that the Riemann integral of a real-valued function f on an interval [a, b] is defined as

FUNDAMENTALS OF REAL ANALYSIS by. II.1. Prelude. Recall that the Riemann integral of a real-valued function f on an interval [a, b] is defined as FUNDAMENTALS OF REAL ANALYSIS by Doğan Çömez II. MEASURES AND MEASURE SPACES II.1. Prelude Recall that the Riemann integral of a real-valued function f on an interval [a, b] is defined as b n f(xdx :=

More information

The Essential Equivalence of Pairwise and Mutual Conditional Independence

The Essential Equivalence of Pairwise and Mutual Conditional Independence The Essential Equivalence of Pairwise and Mutual Conditional Independence Peter J. Hammond and Yeneng Sun Probability Theory and Related Fields, forthcoming Abstract For a large collection of random variables,

More information

From imprecise probability assessments to conditional probabilities with quasi additive classes of conditioning events

From imprecise probability assessments to conditional probabilities with quasi additive classes of conditioning events From imprecise probability assessments to conditional probabilities with quasi additive classes of conditioning events Giuseppe Sanfilippo Dipartimento di Scienze Statistiche e Matematiche S. Vianelli,

More information

USING THE RANDOM ITERATION ALGORITHM TO CREATE FRACTALS

USING THE RANDOM ITERATION ALGORITHM TO CREATE FRACTALS USING THE RANDOM ITERATION ALGORITHM TO CREATE FRACTALS UNIVERSITY OF MARYLAND DIRECTED READING PROGRAM FALL 205 BY ADAM ANDERSON THE SIERPINSKI GASKET 2 Stage 0: A 0 = 2 22 A 0 = Stage : A = 2 = 4 A

More information

MATS113 ADVANCED MEASURE THEORY SPRING 2016

MATS113 ADVANCED MEASURE THEORY SPRING 2016 MATS113 ADVANCED MEASURE THEORY SPRING 2016 Foreword These are the lecture notes for the course Advanced Measure Theory given at the University of Jyväskylä in the Spring of 2016. The lecture notes can

More information

Reminder Notes for the Course on Measures on Topological Spaces

Reminder Notes for the Course on Measures on Topological Spaces Reminder Notes for the Course on Measures on Topological Spaces T. C. Dorlas Dublin Institute for Advanced Studies School of Theoretical Physics 10 Burlington Road, Dublin 4, Ireland. Email: dorlas@stp.dias.ie

More information

Lecture 1: Overview of percolation and foundational results from probability theory 30th July, 2nd August and 6th August 2007

Lecture 1: Overview of percolation and foundational results from probability theory 30th July, 2nd August and 6th August 2007 CSL866: Percolation and Random Graphs IIT Delhi Arzad Kherani Scribe: Amitabha Bagchi Lecture 1: Overview of percolation and foundational results from probability theory 30th July, 2nd August and 6th August

More information

Review of measure theory

Review of measure theory 209: Honors nalysis in R n Review of measure theory 1 Outer measure, measure, measurable sets Definition 1 Let X be a set. nonempty family R of subsets of X is a ring if, B R B R and, B R B R hold. bove,

More information

arxiv: v1 [math.pr] 9 Jan 2016

arxiv: v1 [math.pr] 9 Jan 2016 SKLAR S THEOREM IN AN IMPRECISE SETTING IGNACIO MONTES, ENRIQUE MIRANDA, RENATO PELESSONI, AND PAOLO VICIG arxiv:1601.02121v1 [math.pr] 9 Jan 2016 Abstract. Sklar s theorem is an important tool that connects

More information

The Metamathematics of Randomness

The Metamathematics of Randomness The Metamathematics of Randomness Jan Reimann January 26, 2007 (Original) Motivation Effective extraction of randomness In my PhD-thesis I studied the computational power of reals effectively random for

More information

Chapter 2: Introduction to Fractals. Topics

Chapter 2: Introduction to Fractals. Topics ME597B/Math597G/Phy597C Spring 2015 Chapter 2: Introduction to Fractals Topics Fundamentals of Fractals Hausdorff Dimension Box Dimension Various Measures on Fractals Advanced Concepts of Fractals 1 C

More information

Lebesgue Measure. Dung Le 1

Lebesgue Measure. Dung Le 1 Lebesgue Measure Dung Le 1 1 Introduction How do we measure the size of a set in IR? Let s start with the simplest ones: intervals. Obviously, the natural candidate for a measure of an interval is its

More information

Theorem 2.1 (Caratheodory). A (countably additive) probability measure on a field has an extension. n=1

Theorem 2.1 (Caratheodory). A (countably additive) probability measure on a field has an extension. n=1 Chapter 2 Probability measures 1. Existence Theorem 2.1 (Caratheodory). A (countably additive) probability measure on a field has an extension to the generated σ-field Proof of Theorem 2.1. Let F 0 be

More information

Spring 2014 Advanced Probability Overview. Lecture Notes Set 1: Course Overview, σ-fields, and Measures

Spring 2014 Advanced Probability Overview. Lecture Notes Set 1: Course Overview, σ-fields, and Measures 36-752 Spring 2014 Advanced Probability Overview Lecture Notes Set 1: Course Overview, σ-fields, and Measures Instructor: Jing Lei Associated reading: Sec 1.1-1.4 of Ash and Doléans-Dade; Sec 1.1 and A.1

More information

MATH41011/MATH61011: FOURIER SERIES AND LEBESGUE INTEGRATION. Extra Reading Material for Level 4 and Level 6

MATH41011/MATH61011: FOURIER SERIES AND LEBESGUE INTEGRATION. Extra Reading Material for Level 4 and Level 6 MATH41011/MATH61011: FOURIER SERIES AND LEBESGUE INTEGRATION Extra Reading Material for Level 4 and Level 6 Part A: Construction of Lebesgue Measure The first part the extra material consists of the construction

More information

Variations of non-additive measures

Variations of non-additive measures Variations of non-additive measures Endre Pap Department of Mathematics and Informatics, University of Novi Sad Trg D. Obradovica 4, 21 000 Novi Sad, Serbia and Montenegro e-mail: pape@eunet.yu Abstract:

More information

Final. due May 8, 2012

Final. due May 8, 2012 Final due May 8, 2012 Write your solutions clearly in complete sentences. All notation used must be properly introduced. Your arguments besides being correct should be also complete. Pay close attention

More information

Chapter 1: Probability Theory Lecture 1: Measure space and measurable function

Chapter 1: Probability Theory Lecture 1: Measure space and measurable function Chapter 1: Probability Theory Lecture 1: Measure space and measurable function Random experiment: uncertainty in outcomes Ω: sample space: a set containing all possible outcomes Definition 1.1 A collection

More information

(1) Consider the space S consisting of all continuous real-valued functions on the closed interval [0, 1]. For f, g S, define

(1) Consider the space S consisting of all continuous real-valued functions on the closed interval [0, 1]. For f, g S, define Homework, Real Analysis I, Fall, 2010. (1) Consider the space S consisting of all continuous real-valued functions on the closed interval [0, 1]. For f, g S, define ρ(f, g) = 1 0 f(x) g(x) dx. Show that

More information

DRAFT MAA6616 COURSE NOTES FALL 2015

DRAFT MAA6616 COURSE NOTES FALL 2015 Contents 1. σ-algebras 2 1.1. The Borel σ-algebra over R 5 1.2. Product σ-algebras 7 2. Measures 8 3. Outer measures and the Caratheodory Extension Theorem 11 4. Construction of Lebesgue measure 15 5.

More information

Hanoi attractors and the Sierpiński Gasket

Hanoi attractors and the Sierpiński Gasket Int. J.Mathematical Modelling and Numerical Optimisation, Vol. x, No. x, xxxx 1 Hanoi attractors and the Sierpiński Gasket Patricia Alonso-Ruiz Departement Mathematik, Emmy Noether Campus, Walter Flex

More information

Locally convex spaces, the hyperplane separation theorem, and the Krein-Milman theorem

Locally convex spaces, the hyperplane separation theorem, and the Krein-Milman theorem 56 Chapter 7 Locally convex spaces, the hyperplane separation theorem, and the Krein-Milman theorem Recall that C(X) is not a normed linear space when X is not compact. On the other hand we could use semi

More information

The Caratheodory Construction of Measures

The Caratheodory Construction of Measures Chapter 5 The Caratheodory Construction of Measures Recall how our construction of Lebesgue measure in Chapter 2 proceeded from an initial notion of the size of a very restricted class of subsets of R,

More information

Maths 212: Homework Solutions

Maths 212: Homework Solutions Maths 212: Homework Solutions 1. The definition of A ensures that x π for all x A, so π is an upper bound of A. To show it is the least upper bound, suppose x < π and consider two cases. If x < 1, then

More information

Measurable Choice Functions

Measurable Choice Functions (January 19, 2013) Measurable Choice Functions Paul Garrett garrett@math.umn.edu http://www.math.umn.edu/ garrett/ [This document is http://www.math.umn.edu/ garrett/m/fun/choice functions.pdf] This note

More information

n [ F (b j ) F (a j ) ], n j=1(a j, b j ] E (4.1)

n [ F (b j ) F (a j ) ], n j=1(a j, b j ] E (4.1) 1.4. CONSTRUCTION OF LEBESGUE-STIELTJES MEASURES In this section we shall put to use the Carathéodory-Hahn theory, in order to construct measures with certain desirable properties first on the real line

More information

A gentle introduction to imprecise probability models

A gentle introduction to imprecise probability models A gentle introduction to imprecise probability models and their behavioural interpretation Gert de Cooman gert.decooman@ugent.be SYSTeMS research group, Ghent University A gentle introduction to imprecise

More information

Predictive inference under exchangeability

Predictive inference under exchangeability Predictive inference under exchangeability and the Imprecise Dirichlet Multinomial Model Gert de Cooman, Jasper De Bock, Márcio Diniz Ghent University, SYSTeMS gert.decooman@ugent.be http://users.ugent.be/

More information

Measure Theoretic Probability. P.J.C. Spreij

Measure Theoretic Probability. P.J.C. Spreij Measure Theoretic Probability P.J.C. Spreij this version: September 16, 2009 Contents 1 σ-algebras and measures 1 1.1 σ-algebras............................... 1 1.2 Measures...............................

More information

CHAPTER I THE RIESZ REPRESENTATION THEOREM

CHAPTER I THE RIESZ REPRESENTATION THEOREM CHAPTER I THE RIESZ REPRESENTATION THEOREM We begin our study by identifying certain special kinds of linear functionals on certain special vector spaces of functions. We describe these linear functionals

More information

Lebesgue Integration on R n

Lebesgue Integration on R n Lebesgue Integration on R n The treatment here is based loosely on that of Jones, Lebesgue Integration on Euclidean Space We give an overview from the perspective of a user of the theory Riemann integration

More information

Analysis Finite and Infinite Sets The Real Numbers The Cantor Set

Analysis Finite and Infinite Sets The Real Numbers The Cantor Set Analysis Finite and Infinite Sets Definition. An initial segment is {n N n n 0 }. Definition. A finite set can be put into one-to-one correspondence with an initial segment. The empty set is also considered

More information

Introduction. Chapter 1. Contents. EECS 600 Function Space Methods in System Theory Lecture Notes J. Fessler 1.1

Introduction. Chapter 1. Contents. EECS 600 Function Space Methods in System Theory Lecture Notes J. Fessler 1.1 Chapter 1 Introduction Contents Motivation........................................................ 1.2 Applications (of optimization).............................................. 1.2 Main principles.....................................................

More information

HILBERT SPACES AND THE RADON-NIKODYM THEOREM. where the bar in the first equation denotes complex conjugation. In either case, for any x V define

HILBERT SPACES AND THE RADON-NIKODYM THEOREM. where the bar in the first equation denotes complex conjugation. In either case, for any x V define HILBERT SPACES AND THE RADON-NIKODYM THEOREM STEVEN P. LALLEY 1. DEFINITIONS Definition 1. A real inner product space is a real vector space V together with a symmetric, bilinear, positive-definite mapping,

More information

Cones of measures. Tatiana Toro. University of Washington. Quantitative and Computational Aspects of Metric Geometry

Cones of measures. Tatiana Toro. University of Washington. Quantitative and Computational Aspects of Metric Geometry Cones of measures Tatiana Toro University of Washington Quantitative and Computational Aspects of Metric Geometry Based on joint work with C. Kenig and D. Preiss Tatiana Toro (University of Washington)

More information

REVIEW OF ESSENTIAL MATH 346 TOPICS

REVIEW OF ESSENTIAL MATH 346 TOPICS REVIEW OF ESSENTIAL MATH 346 TOPICS 1. AXIOMATIC STRUCTURE OF R Doğan Çömez The real number system is a complete ordered field, i.e., it is a set R which is endowed with addition and multiplication operations

More information

Introduction to Dynamical Systems

Introduction to Dynamical Systems Introduction to Dynamical Systems France-Kosovo Undergraduate Research School of Mathematics March 2017 This introduction to dynamical systems was a course given at the march 2017 edition of the France

More information

g 2 (x) (1/3)M 1 = (1/3)(2/3)M.

g 2 (x) (1/3)M 1 = (1/3)(2/3)M. COMPACTNESS If C R n is closed and bounded, then by B-W it is sequentially compact: any sequence of points in C has a subsequence converging to a point in C Conversely, any sequentially compact C R n is

More information

Chapter II. Metric Spaces and the Topology of C

Chapter II. Metric Spaces and the Topology of C II.1. Definitions and Examples of Metric Spaces 1 Chapter II. Metric Spaces and the Topology of C Note. In this chapter we study, in a general setting, a space (really, just a set) in which we can measure

More information

02. Measure and integral. 1. Borel-measurable functions and pointwise limits

02. Measure and integral. 1. Borel-measurable functions and pointwise limits (October 3, 2017) 02. Measure and integral Paul Garrett garrett@math.umn.edu http://www.math.umn.edu/ garrett/ [This document is http://www.math.umn.edu/ garrett/m/real/notes 2017-18/02 measure and integral.pdf]

More information

Section 2: Classes of Sets

Section 2: Classes of Sets Section 2: Classes of Sets Notation: If A, B are subsets of X, then A \ B denotes the set difference, A \ B = {x A : x B}. A B denotes the symmetric difference. A B = (A \ B) (B \ A) = (A B) \ (A B). Remarks

More information

FUNDAMENTALS OF REAL ANALYSIS

FUNDAMENTALS OF REAL ANALYSIS ÜO i FUNDAMENTALS OF REAL ANALYSIS James Foran University of Missouri Kansas City, Missouri Marcel Dekker, Inc. New York * Basel - Hong Kong Preface iii 1.1 Basic Definitions and Background Material 1

More information

The main results about probability measures are the following two facts:

The main results about probability measures are the following two facts: Chapter 2 Probability measures The main results about probability measures are the following two facts: Theorem 2.1 (extension). If P is a (continuous) probability measure on a field F 0 then it has a

More information

Topology. Xiaolong Han. Department of Mathematics, California State University, Northridge, CA 91330, USA address:

Topology. Xiaolong Han. Department of Mathematics, California State University, Northridge, CA 91330, USA  address: Topology Xiaolong Han Department of Mathematics, California State University, Northridge, CA 91330, USA E-mail address: Xiaolong.Han@csun.edu Remark. You are entitled to a reward of 1 point toward a homework

More information

Measure Theory & Integration

Measure Theory & Integration Measure Theory & Integration Lecture Notes, Math 320/520 Fall, 2004 D.H. Sattinger Department of Mathematics Yale University Contents 1 Preliminaries 1 2 Measures 3 2.1 Area and Measure........................

More information

The small ball property in Banach spaces (quantitative results)

The small ball property in Banach spaces (quantitative results) The small ball property in Banach spaces (quantitative results) Ehrhard Behrends Abstract A metric space (M, d) is said to have the small ball property (sbp) if for every ε 0 > 0 there exists a sequence

More information

Imprecise Probability

Imprecise Probability Imprecise Probability Alexander Karlsson University of Skövde School of Humanities and Informatics alexander.karlsson@his.se 6th October 2006 0 D W 0 L 0 Introduction The term imprecise probability refers

More information

Math212a1413 The Lebesgue integral.

Math212a1413 The Lebesgue integral. Math212a1413 The Lebesgue integral. October 28, 2014 Simple functions. In what follows, (X, F, m) is a space with a σ-field of sets, and m a measure on F. The purpose of today s lecture is to develop the

More information