1 Mathematical Preliminaries 1.1 Probability Theory Elements 1.1.1 Introduction Probability theory [326,357,365]is a part of theoretical and applied mathematics, which is engaged in establishing the rules governing random events-random games or experimental testing.The definitions,theorems and lemmas given below are necessary to understand the basic equations and computer implementation aspects used in the later numerical analyses presented in the book.They can also be used to calculate many of the closed-form equations applied frequently in applied sciences and engineering practice [19,37,150,201,202,253]. Definition The variations with n elements for k elements are k elements series where each number 1,2,...k corresponds to the single element from the initial set.The variations can differ in the elements or their order.The total number of all variations with n elements for k is described by the relation (n-k):=nn-D..(n-k+1) n! (1.1) k-times Example Let us consider the three-element set A(X,Y,Z).Two-element variations of this set are represented as V2=6:XY,YZ,XZ,YX,ZY,ZX. Definition Permutations with n elements are n-element series where each number 1,2,...,n corresponds to the single element from the initial n-element set.The difference between permutations is in the element order.The total number of all permutations with n different elements is given by the formula: Pn=V=1.2…n=nl (1.2) If among n elements X,Y,Z....there are identical elements,where X repeats a times,Y appears b times,while Z repeats c times etc.,then
1 Mathematical Preliminaries 1.1 Probability Theory Elements 1.1.1 Introduction Probability theory [326,357,365] is a part of theoretical and applied mathematics, which is engaged in establishing the rules governing random events – random games or experimental testing. The definitions, theorems and lemmas given below are necessary to understand the basic equations and computer implementation aspects used in the later numerical analyses presented in the book. They can also be used to calculate many of the closed-form equations applied frequently in applied sciences and engineering practice [19,37,150,201,202,253]. Definition The variations with n elements for k elements are k elements series where each number 1,2,...,k corresponds to the single element from the initial set. The variations can differ in the elements or their order. The total number of all variations with n elements for k is described by the relation ( ) 14 2 44 4 3 44 k times k n n n n k n k n V − = − − + − = ( 1)...( 1) ! ! (1.1) Example Let us consider the three-element set A{X,Y,Z}. Two-element variations of this set are represented as 6 2 V3 = : XY, YZ, XZ, YX, ZY, ZX. Definition Permutations with n elements are n-element series where each number 1,2,...,n corresponds to the single element from the initial n-element set. The difference between permutations is in the element order. The total number of all permutations with n different elements is given by the formula: P V 1 2 ... n n! n n = n = ⋅ ⋅ ⋅ = (1.2) If among n elements X, Y, Z,... there are identical elements, where X repeats a times, Y appears b times, while Z repeats c times etc., then
2 Computational Mechanics of Composite Materials (1.3) alblc! Example Let us consider the three element set A[X,Y,Z).The following permutations of the set A are available:P=6:XYZ,XZY,YZX,YXZ,ZXY,ZYX. Definition The combinations with n elements for k elements are k-elements sets,which can be created by choosing any k elements from the given n-element set,where the order does not play any role.The combinations can differ in the elements only.The total number of all combinations with n for k elements is described by the formula k(n-k)月 (1.4) In specific cases it is found that c0c- (1.5) where G (1.6) Example Let us consider a set AfX,Y,Z)as before.Two-element variations of this set are the following:XY,XZ and YZ. The fundamental concepts of probability theory are random experiments and random events resulting from them.A single event,which can result from some random experiment is called elementary event,an and for the single die throw is equivalent to any sum of the dots on a die taken from the set {1,...,6).Further,it is concluded that all elementary events corresponding to the random experiment form the elementary events space defined usually as which various subsets like A and/or B belong to (favouring the specified event or not,for instance). Definition A formal notation A denotes that the elementary event co belongs to the event A and is understood in the following way-if c results from some experiment,then the event A happened too,which c belongs to.The notation means that the elementary event c favours the event A
2 Computational Mechanics of Composite Materials ! ! ! ! a b c n Pn = (1.3) Example Let us consider the three element set A{X,Y,Z}. The following permutations of the set A are available: 6 P3 = : XYZ, XZY, YZX, YXZ, ZXY, ZYX. Definition The combinations with n elements for k elements are k-elements sets, which can be created by choosing any k elements from the given n-element set, where the order does not play any role. The combinations can differ in the elements only. The total number of all combinations with n for k elements is described by the formula !( )! ! k n k n k n Ck n − =⎟ ⎟ ⎠ ⎞ ⎜ ⎜ ⎝ ⎛ = (1.4) In specific cases it is found that n n Cn =⎟ ⎟ ⎠ ⎞ ⎜ ⎜ ⎝ ⎛ = 1 1 , 1 =⎟ ⎟ ⎠ ⎞ ⎜ ⎜ ⎝ ⎛ = n n Cn n (1.5) where ⎟ ⎟ ⎠ ⎞ ⎜ ⎜ ⎝ ⎛ − =⎟ ⎟ ⎠ ⎞ ⎜ ⎜ ⎝ ⎛ n k n k n , 1 0 =⎟ ⎟ ⎠ ⎞ ⎜ ⎜ ⎝ ⎛ =⎟ ⎟ ⎠ ⎞ ⎜ ⎜ ⎝ ⎛ n n n (1.6) Example Let us consider a set A{X,Y,Z} as before. Two-element variations of this set are the following: XY, XZ and YZ. The fundamental concepts of probability theory are random experiments and random events resulting from them. A single event, which can result from some random experiment is called elementary event, an and for the single die throw is equivalent to any sum of the dots on a die taken from the set {1,…,6}. Further, it is concluded that all elementary events corresponding to the random experiment form the elementary events space defined usually as Ω, which various subsets like A and/or B belong to (favouring the specified event or not, for instance). Definition A formal notation ω ∈ A denotes that the elementary event ω belongs to the event A and is understood in the following way – if ω results from some experiment, then the event A happened too, which ω belongs to. The notation means that the elementary event ω favours the event A
Mathematical Preliminaries 3 Definition The formal notation Ac B,which means that event A is included in the event B is understood such that event A results in the event B since the following implication holds true:if the elementary event co favours event A,then event o favours event B,too. Definition An alternative of the events A.A......A is the following sum: A 0A 0...0A =UA (1.7) which is a random event consisting of all random elementary events belonging to at least one of the events A,A2,....A. Definition A conjunction of the events A,A2,....A is a product A∩A2∩.nAn=∩A (1.8) which proceeds if and only if any of the events A,A.,...,A proceed Definition Probability is a function P which is defined on the subsets of the elementary events and having real values in closed interval [0,1]such that (1)P(2)=1,P(0)=0: (2)for any finite and/or infinite series of the excluding events A,A2,...A,... A,A,=☑，there holds for itj AFΣPA) (1.9) Starting from the above definitions one can demonstrate the following lemmas: Lemma The probability of the alternative of the events is equal to the sum of the probabilities of these events. Lemma If event B results from event A then
Mathematical Preliminaries 3 Definition The formal notation A ⊂ B , which means that event A is included in the event B is understood such that event A results in the event B since the following implication holds true: if the elementary event ω favours event A, then event ω favours event B, too. Definition An alternative of the events A A An , ,..., 1 2 is the following sum: U n i A A An Ai 1 1 2 ... = ∪ ∪ ∪ = (1.7) which is a random event consisting of all random elementary events belonging to at least one of the events A A An , ,..., 1 2 . Definition A conjunction of the events A A An , ,..., 1 2 is a product I n i A A An Ai 1 1 2 ... = ∩ ∩ ∩ = (1.8) which proceeds if and only if any of the events A A An , ,..., 1 2 proceed. Definition Probability is a function P which is defined on the subsets of the elementary events and having real values in closed interval [0,1] such that (1) P(Ω)=1, P(∅)=0; (2) for any finite and/or infinite series of the excluding events ,... , ,..., A1 A2 An Ai ∩ Aj = ∅ , there holds for i≠j ⎟ = ∑ ( ) ⎠ ⎞ ⎜ ⎝ ⎛ i i i P UAi P A (1.9) Starting from the above definitions one can demonstrate the following lemmas: Lemma The probability of the alternative of the events is equal to the sum of the probabilities of these events. Lemma If event B results from event A then
4 Computational Mechanics of Composite Materials P(A)<P(B) (1.10) The definition of probability does not reflect however a natural very practical need of its value determination and that is why the simplified Laplace definition is frequently used for various random events. Definition If n trials forms the random space of elementary events where each experiment has the same probability equal to 1/n,then the probability of the m-element event A is equal to P(A)= (1.11) Next,we will explain the definition,meaning and basic properties of the probability spaces.The probability space(,F,P)is uniquely defined by the space of elementary random events the events field F and probabilistic measure P. The field of events F is the relevant family of subsets of the space of elementary random events This field F is a non-empty,complementary and countable additive set having o-algebra structure. Definition The probabilistic measure P is a function P:F→[0，] (1.12) which is a nonnegative,countable additive and normalized function defined on the fields of random events.The pair (F)is a countable space,while the events are countable subsets of The value P(A)assigned by the probabilistic measure P to event A is called a probability of this event. Definition Two events A and B are independent if they fulfil the following condition: P(AOB)=P(A)P(B) (1.13) while the events A.AA are pair independent,if this condition holds true for any pair from this set. Definition Let us consider the probability space (.F.P)and measurable spaceB. where B is a class of the Borelian sets.Then,the representation
4 Computational Mechanics of Composite Materials P() () A ≤ P B (1.10) The definition of probability does not reflect however a natural very practical need of its value determination and that is why the simplified Laplace definition is frequently used for various random events. Definition If n trials forms the random space of elementary events where each experiment has the same probability equal to 1/n, then the probability of the m-element event A is equal to ( ) n m P A = (1.11) Next, we will explain the definition, meaning and basic properties of the probability spaces. The probability space (Ω,F,P) is uniquely defined by the space of elementary random events Ω, the events field F and probabilistic measure P. The field of events F is the relevant family of subsets of the space of elementary random events Ω. This field F is a non-empty, complementary and countable additive set having σ-algebra structure. Definition The probabilistic measure P is a function P : F →[0,1] (1.12) which is a nonnegative, countable additive and normalized function defined on the fields of random events. The pair (Ω,F) is a countable space, while the events are countable subsets of Ω. The value P(A) assigned by the probabilistic measure P to event A is called a probability of this event. Definition Two events A and B are independent if they fulfil the following condition: P( ) A∩ B = P(A)⋅ P(B) (1.13) while the events { } A A An , ,..., 1 2 are pair independent, if this condition holds true for any pair from this set. Definition Let us consider the probability space (Ω,F,P) and measurable space { }n n ℜ , B , where Bn is a class of the Borelian sets. Then, the representation
Mathematical Preliminaries 5 X:2→R” (1.14) is an n-dimensional random variable or n-dimensional random vector. Definition The probability distribution of the random variable X is a function Px:B[0,1] such that Px(b)=P(X∈B) (1.15) be B The probability distribution of the random variable is a probabilistic measure. Definition Let us consider the following probability space (,B,Px).The function Fx:gr→[0，1]defined as F(x)=Px《-∞，xl (1.16) is called the cumulative distribution function of the variable X. Definition The function f:,has the following properties: (1)there holds almost everywhere (in each point of the cumulative distribution function differentiability): dF(x)=f(x) (1.17) dx (2) f(x)20 (1.18) (3) Jrcod=1 (1.19) (4)for any Borelian set beB the integral ff(x)dx=P(Xeb)is a probability density function(PDF)of the variable X. Definition Let us consider the random variable X:defined on the probabilistic space (F,P).The expected value of the random variable X is defined as EX]=∫X(o)dP(o) (1.20)
Mathematical Preliminaries 5 n X :Ω → ℜ (1.14) is an n-dimensional random variable or n-dimensional random vector. Definition The probability distribution of the random variable X is a function ] P : B →[0,1 X such that P (b) P(X B) X b B ∀ = ∈ ∈ (1.15) The probability distribution of the random variable is a probabilistic measure. Definition Let us consider the following probability space ( ) B PX ℜ, , . The function :ℜ →[0,1] FX defined as F x P [ ] ( ) x X ( ) = − ∞, (1.16) is called the cumulative distribution function of the variable X. Definition The function ℜ → ℜ+ f : has the following properties: (1) there holds almost everywhere (in each point of the cumulative distribution function differentiability): ( ) ( ) f x dx dF x = (1.17) (2) f (x) ≥ 0 (1.18) (3) ∫ +∞ −∞ f (x)dx = 1 (1.19) (4) for any Borelian set b ∈ B the integral ( ) ∫ = ∈ b f ( is a probability x)dx P X b density function (PDF) of the variable X. Definition Let us consider the random variable X :Ω → ℜ defined on the probabilistic space ( ) Ω, F, P . The expected value of the random variable X is defined as ∫ +∞ −∞ E[X ] = X (ω)dP(ω) (1.20)