MP and MT-implications on a finite scale
|
|
- Kristian Bryan
- 5 years ago
- Views:
Transcription
1 MP ad MT-implicatios o a fiite scale M Mas Dpt de Matemàtiques i If Uiversitat de les Illes Balears Palma de Mallorca Spai dmimmg0@uibes M Moserrat Dpt de Matemàtiques i If Uiversitat de les Illes Balears Palma de Mallorca Spai dmimma0@uibes J Torres Dpt de Matemàtiques i If Uiversitat de les Illes Balears Palma de Mallorca Spai dmijts0@uibes Abstract This paper is devoted to the study of discrete implicatios that satisfy modus poes (MP), modus tolles (MT) or both (MPT) The mai goal is to characterize all R, S, QL ad D-implicatios o a fiite chai L satisfyig these properties for a give smooth t-orm T 1 The o-smooth case is also discussed for a special family of t-orms Keywords: Discrete implicatios, modus poes, modus tolles, smooth t-orms, fiite scale 1 Itroductio It is well kow that fuzzy implicatio fuctios (see the survey [12]) are used i approximate reasoig, ot oly to represet fuzzy coditioal statemets of the form If p the q (with p, q fuzzy statemets), but also to perform ifereces i ay fuzzy rule based system I this iferece process, the two mai classical rules are modus poes (MP) ad modus tolles (MT) that allow to perform, respectively, forward ad backward ifereces I terms of fuzzy logic, these implicatios are operators I : [0, 1] 2 [0, 1] extedig the classical material implicatio, that is, satisfyig I(0, 0) = I(0, 1) = I(1, 1) = 1 ad I(1, 0) = 0 Sice cojuctios, disjuctios ad egatios are usually performed by t-orms (T ), t-coorms (S) ad strog egatios (N), i fuzzy set theory as much as i fuzzy logic ad approximate reasoig, the majority of the kow implicatio fuctios are directly derived from these operators 1 The four most usual ways to defie these implicatio fuctios are: 1 Although some authors have derived also implicatios from other aggregatio fuctios, specially uiorms (see [1], [11],[14]) i) R-implicatios defied by I(x, y) = sup{z [0, 1] T (x, z) y} (1) for all x, y [0, 1] ii) S-implicatios defied by I(x, y) = S(N(x), y), x, y [0, 1] (2) iii) QL-implicatios defied by I(x, y) = S(N(x), T (x, y)), x, y [0, 1] (3) iv) D-implicatios, that are the cotrapositio with respect to N of QL-implicatios ad are give by I(x, y) = S(T (N(x), N(y)), y), x, y [0, 1] (4) Moreover, i this cotext, give ay t-orm T 1 ad ay strog egatio N 1, modus poes ad modus tolles for a implicatio I ca be writte as ad T 1 (x, I(x, y)) y, x, y [0, 1] (5) T 1 (N 1 (y), I(x, y)) N 1 (x), x, y [0, 1] (6) respectively These two equatios have bee recetly solved i [15] for the first three metioed classes of implicatios O the other had, the study of operators defied o fiite scales is a area of icreasig iterest (see [2], [4], [5], [8], [9], [10], ad [13]) Maily, because it allows to deal with fiite families of liguistic labels avoidig umerical iterpretatios (ecessaries i the fuzzy logic approach) I this cotext, the book chapter [13] brigs a survey o (smooth) discrete t- orms ad t-coorms o a fiite chai L, ad the four classes of implicatios, R, S, QL ad D-implicatios derived from discrete t-orms, are studied i [9] ad
2 [10] From these discrete implicatios, ew possibilities for approximate reasoig with fiite families of liguistic labels appear with their cosequet applicatios i computig with words However, i this lie, the study of MP ad MT rules for discrete implicatios, equivalet to the oe give i [15] for fuzzy implicatios, is essetial This is precisely the mai goal of this paper After some prelimiaries give i sectio 2, we devote sectio 3 to characterize those R, S, QL ad D-implicatios o a fiite chai L, derived from smooth t-orms, that satisfy equatio (5), equatio (6) or both Fially, sectio 4 is devoted to the o-smooth case for a special family of t-orms 2 Prelimiaries We recall here the smooth t-orms ad the smooth t- coorms o a fiite chai L ad their characterizatio, that will be used alog the paper It is well kow that for our purposes (see [13]) all fiite chais with the same umber of elemets are equivalet ad the, from ow o, we will deal with the simplest fiite chai of + 1 elemets: L = {0, 1, 2, 1, } where 1 Such a L ca be uderstood as a set of liguistic terms or labels The followig two defiitios are adapted from [5] (see also [13]) Defiitio 1 A fuctio f : L L is said to be smooth if it satisfies oe of the followig coditios: f is odecreasig ad f(x) f(x 1) 1 for all x L with x 1 f is oicreasig ad f(x 1) f(x) 1 for all x L with x 1 Defiitio 2 A biary operator F o L is said to be smooth if it is smooth i each variable The importace of the smoothess coditio lies i the fact that it is geerally used as a discrete couterpart of cotiuity o [0,1] Although t-orms, t-coorms ad strog egatios are usually biary operators o [0,1], they ca be defied as i [2] o ay bouded partially ordered set ad, i particular, o L I this last case, they are usually kow as discrete t-orms ad discrete t-coorms I this way, recall that smoothess for discrete t-orms (ad also for t-coorms) is equivalet to the divisibility coditio, that is, x y if ad oly if there exists z L such that T (y, z) = x, (see [13]) Propositio 1 There is oe ad oly oe strog egatio o L that is give by N(x) = x for all x L (7) From ow o, N will always deote the egatio o L give by (7) Smooth t-orms have bee characterized as ordial sums of Archimedea oes as follows Propositio 2 (See [13]) There is oe ad oly oe Archimedea smooth t-orm o L, deoted by T L, give by T L (x, y) = max{0, x + y } for all x, y L (8) which is kow as the Lukasiewicz t-orm Moreover, give ay subset J of L cotaiig 0,, there is oe ad oly oe smooth t-orm o L that has J as the set of idempotet elemets, that will be deoted by T J I fact, if J is the set J = {0 = i 0 < i 1 < < i m 1 < i m = } the T J is give by: max{i k, x + y i k+1 } if x, y [i k, i k+1 ] T J (x, y) = for some i k J mi{x, y} otherwise (9) Smooth t-coorms have a classificatio theorem like the above oe for t-orms which ca be easily deduced by N-duality The expressio of the oly Archimedea smooth t-coorm o L is give by S L (x, y) = mi{, x + y} for all x, y L (10) which is also kow as the Lukasiewicz t-coorm I geeral, we have Propositio 3 (See [13]) Give ay subset J of L cotaiig 0,, there is oe ad oly oe smooth t- coorm o L, S J, that has J as the set of idempotet elemets I fact, if J is the set J = {0 = i 0 < i 1 < < i m 1 < i m = } the S J is give by: mi{i k+1, x + y i k } if x, y [i k, i k+1 ] S J (x, y) = for some i k J max{x, y} otherwise (11) Note that with these otatios, the Lukasiewicz t- orm ad t-coorm ca be writte, respectively as T L = T {0,} ad S L = S {0,} The followig result follows from the previous propositios
3 Propositio 4 (See [13]) There are exactly 2 1 differet smooth t-orms (t-coorms) o L Defiitio 3 A biary operator I : L L L is said to be a (discrete) implicatio if it satisfies: (I1) I is oicreasig i the first variable ad odecreasig i the secod oe (I2) I(0, 0) = I(, ) = ad I(, 0) = 0 Note that, from the defiitio, it follows that I(0, x) = ad I(x, ) = for all x L The four ways to defie fuzzy implicatios apply here to defie discrete implicatios However, sice the oly strog egatio o L is the oe give by (7) ad we deal with a fiite scale, i our case they ca be rewritte as follows: I(x, y) = max{z L T (x, z) y}, x, y L (12) I(x, y) = S( x, y), x, y L (13) I(x, y) = S( x, T (x, y)), x, y L (14) I(x, y) = S(T ( x, y), y), x, y L (15) All these classes of discrete implicatios have bee already studied: R ad S-implicatios i [9], ad QL ad D-implicatios i [10] Thus we refer to these cited papers for details o these kids of discrete implicatios that we will use i the paper Although the o-smooth case is cosidered i these refereces, i the preset work we will deal oly with R, S, QL ad D-operators derived from smooth t-orms ad smooth t-coorms 3 Mai results I this sectio we deal with (implicatio) operators o the fiite chai L that satisfy the modus poes, the modus tolles or both, with respect to a smooth t-orm T 1 Agai, sice we have oly oe strog egatio o L, i our case equatio (6) ca be rewritte depedig oly o the t-orm T 1 ad thus, we ca adopt the followig defiitios: Defiitio 4 Let T 1 be a t-orm o L A fuctio I : L 2 L will be called: - a MP-operator for T 1 wheever it satisfies T 1 (x, I(x, y)) y for all x, y L (16) - a MT-operator for T 1 wheever it satisfies T 1 ( y, I(x, y)) x for all x, y L (17) - a MPT-operator for T 1 wheever it is both, a MP ad a MT-operator Moreover, we will say that I is a MP-implicatio (or MT, or MPT-implicatio) if it is a implicatio ad also a MP-operator (or MT or MPT-operator, respectively) Note that whereas all R ad S-operators (give by equatios (12) ad (13), respectively) are always implicatios, this is ot the case for QL ad D-operators (give by equatios (14) ad (15), respectively), see for istace [10] Thus, we will divide our study of properties MP, MT ad MPT i three subsectios, the first oe devoted to R-implicatios, the secod oe devoted to S-implicatios ad, fially, the third oe devoted to QL ad D-operators i geeral, icludig of course QL ad D-implicatios Before this, let us begi with two easy but importat propositios i the discussio of the metioed properties The first oe deals with MP-operators Propositio 5 Let T 1 be a t-orm o L ad I : L 2 L a MP-operator for T 1 The, T 1 (x, I(x, 0)) = 0 for all x L The secod oe deals with MT-operators Propositio 6 Let T 1 be a t-orm o L ad I : L 2 L a MT-operator for T 1 The, T 1 ( y, I(, y)) = 0 for all y L 31 R-implicatios Give ay t-orm T we will deote by I T its residual implicatio, that is, the operator give by equatio (12): I T (x, y) = max{z L T (x, z) y} We deal i this subsectio with implicatios I T : L 2 L, where T is a smooth t-orm Let us recall here the structure of these implicatios For a easier uderstadig we give their graphical structure i Figure 1 istead of their formulas, that ca be foud i [9] Thus, R ad S-implicatios ca be viewed i Figures 1 ad 2, respectively We begi with the property of MP-implicatios Give ay t-orm T, let us deote also by Idemp T the set of all idempotet elemets of the t-orm T, that is: Idemp T = {x L T (x, x) = x} The we have the followig propositio
4 i m 1 i m 2 i 2 i 1 I i2 I im 1 I i1 0 i 1 i 2 i m 2 i m 1 y I im Figure 1 The structure of the R-implicatio derived from T J where J = {0 = i 0 < i 1 < < i m 1 < i m = } ad I ik+1 (x, y) = i k+1 + y x for k = 0,, m 1 Propositio 7 Let T, T 1 be smooth t-orms o L ad I T : L 2 L the R-implicatio associated to T The followig statemets are equivalet: i) I T is a MP-implicatio for T 1 ii) I T (x, y) I T1 (x, y) for all x, y L iii) Idemp T1 Idemp T Thus, it is clear that we ca deduce the followig particular cases Corollary 1 Let T, T 1 be smooth t-orms o L ad I T : L 2 L the R-implicatio associated to T The, i) If T = mi, I mi is a MP-implicatio for ay smooth t-orm T 1 ii) If T = T L, I TL is a MP-implicatio for T 1 if ad oly if T 1 = T L iii) If T 1 = T L, I T is a MP-implicatio for ay smooth t-orm T iv) If T 1 = mi, I T is a MP-implicatio for mi if ad oly if T = mi With respect to MT-implicatios we obtai solutios oly whe T 1 is the Lukasiewicz t-orm ad the I T works for ay smooth t-orm T This ca be proved through the followig two propositios Propositio 8 Let T, T 1 be t-orms o L with T smooth ad let I T : L 2 L be the R-implicatio associated to T If I T is a MT-implicatio for T 1 the ecessarily T 1 (x, x) = 0 for all x L Remark 1 It is proved i Lemma 1 of [9] that, for smooth t-orms, the previous coditio is equivalet to be T 1 the Lukasiewicz t-orm That is, for smooth t-orms, T 1 (x, x) = 0 for all x L T 1 = T L Propositio 9 Let T, T 1 be smooth t-orms o L ad I T : L 2 L the R-implicatio associated to T The I T is a MT-implicatio for T 1 if ad oly if T 1 = T L Now, joitly the obtaied results for MP ad for MTimplicatios we obtai the followig corollary Corollary 2 Let T, T 1 be smooth t-orms o L ad I T : L 2 L the R-implicatio associated to T The,I T is a MPT-implicatio for T 1 if ad oly if T 1 = T L 32 S-implicatios Let us ow deal with S-implicatios Give ay t- coorm S we will deote by I S the correspodig S- implicatio give by equatio (13) That is: I S (x, y) = S( x, y) for all x, y L The structure of S-implicatios ca be viewed i Figure 2 (their expressio ca be foud i [9]) i 1 i 2 i m 2 i m 1 I i1 I i2 I max 0 i 1 i 2 i m 2 i m 1 I max I im 1 I im Figure 2 The structure of the S-implicatio derived from the dual t-coorm of T J, where J = {0 = i 0 < i 1 < < i m 1 < i m = }, I max (x, y) = max{ x, y} ad I ik+1 (x, y) = mi{ i k, i k+1 + y x} for k = 0,, m 1 For S-implicatios, the study of the modus poes is solved by the followig two propositios Propositio 10 Let T 1 be a t-orm, S a smooth t- coorm o L ad I S : L 2 L the correspodig S-
5 implicatio If I S is a MP-implicatio for T 1 the ecessarily T 1 (x, x) = 0 for all x L Propositio 11 Let T 1 be a smooth t-orm ad S a smooth t-coorm o L ad I S : L 2 L the correspodig S-implicatio The I S is a MP-implicatio for T 1 if ad oly if T 1 = T L I this case, the study of modus tolles gives exactly the same solutios Specifically, Propositio 12 Let T 1 be a t-orm ad S a smooth t-coorm o L ad I S : L 2 L the correspodig S-implicatio If I S is a MT-implicatio for T 1 the ecessarily T 1 (x, x) = 0 for all x L Propositio 13 Let T 1 be a smooth t-orm ad S a smooth t-coorm o L ad I S : L 2 L the correspodig S-implicatio The I S is a MT-implicatio for T 1 if ad oly if T 1 = T L Ad cosequetly we have: Corollary 3 Let T 1 be a smooth t-orm ad S a smooth t-coorm o L ad I S : L 2 L the correspodig S-implicatio The I S is a MPTimplicatio for T 1 if ad oly if T 1 = T L 33 QL ad D-operators I this subsectio we deal with QL ad D-operators give by equatios (14) ad (15), respectively As we have commeted, ot all of them are implicatios i the sese of Defiitio 3 I fact, it is proved i [10] that this occurs i the smooth case (for both QL ad D) if ad oly if S = S L However we will study the properties MP, MT ad MPT i geeral for all QL ad D-operators, regardless of they are or they are ot implicatios Agai we ca begi with this first propositio Propositio 14 Let T 1 be a t-orm, I QL a QLoperator ad I D a D-operator The: i) If I QL (I D ) is a MP-operator for T 1 the ecessarily T 1 (x, x) = 0 for all x L ii) If I QL (I D ) is a MT-operator for T 1 the ecessarily T 1 (x, x) = 0 for all x L Whe we deal with QL ad D-implicatios, sice the the t-coorm S i equatios (14) ad (15) must be S = S L, they are derived simply from a smooth t- orm as: I QL (x, y) = S L ( x, T (x, y)) = x + T (x, y) (18) for all x, y L, ad I D (x, y) = S L (T ( x, y), y) = y + T ( x, y) (19) for all x, y L, respectively Moreover, it is proved i [10] that the set of QL-implicatios ad the set of D-implicatios coicide whe we derive them from smooth t-orms ad t-coorms, ad cosequetly we ca study both kid of implicatios at the same time Let us recall the structure of QL ad D-implicatios i Figure 3 (agai their formulas ca be foud i [10]) i m 1 i m 2 i 2 i 1 I i0 I i1 I im 2 x + y I im 1 0 i 1 i 2 i m 2 i m 1 Figure 3 The structure of the QL-implicatio derived from T J where J = {0 = i 0 < i 1 < < i m 1 < i m = } For j = 0,, m 1, each I ij is give by I ij (x, y) = max{ x + i j, + y i j+1 } for all x, y [i j, i j+1 ] The same structure correspods to the D-implicatio derived from T N(J) I the study of QL ad D-implicatios that are MP, MT ad MPT for T 1 we obtai always the same result Ay of these coditios is satisfied if ad oly if T 1 = T L For QL-operators ad D-operators i geeral, the result is the same, but ow we eed to study both kids of operators separately I ay case, we have: Propositio 15 Let T 1 be a smooth t-orm, I QL a QL-operator ad I D a D-operator The, the followig statemets are equivalet: i) I QL (I D ) is a MP-operator for T 1 ii) I QL (I D ) is a MT-operator for T 1 iii) I QL (I D ) is a MPT-operator for T 1 iv) T 1 = T L A table summarizig all results i this sectio ca be viewed i Table 1
6 I T MP for T 1 MT for T 1 MPT for T 1 Idemp T1 Idemp T T 1 = T L T 1 = T L I S T 1 = T L T 1 = T L T 1 = T L I QL T 1 = T L T 1 = T L T 1 = T L I D T 1 = T L T 1 = T L T 1 = T L Moreover, i this case both T k ad T k+1 coicide with the ilpotet miimum Thus, from ow o, we will cosider oly the cases whe k < k without ay loose of geerality We will cosider also 3 sice for the cases = 1, 2 it is always T k = T L The idexed family of t-orms T k ca be viewed i Figure 4 Table 1 Characterizatio of R, S, QL ad D- operators that are MP, MT ad MPT-operators for a smooth t-orm T 1 4 The o-smooth case I our previous study we have see that, give ay t- orm T 1 ad ay biary operator I : L 2 L, to be I a MP, MT, or MPT-operator, the coditio k k mi x + y k 0 T 1 (x, x) = 0 for all x L (20) is ecessary i almost all cases From Remark 1 we kow that i the smooth case this is equivalet to be T 1 the Lukasiewicz t-orm However, i the o-smooth case we have may others t-orms o L satisfyig such coditio Namely, for ay k L such that k k we have the followig idexed family of t-orms T k give by 0 if x + y T k x + y k if x + y > ad (x, y) = (21) k x, y k mi{x, y} otherwise Each t-orm of this family satisfies equatio (20), see for istace [9] I fact, these t-orms T k are the discrete couterpart of the family of t-orms itroduced by J C Fodor i [3] (see also [6]) whe he studies cotrapositive symmetry (geuie property of S-implicatios) for R-implicatios For each t-orm of this family the correspodig R ad S-implicatios coicide (see also [7], Jeei family of t-orms i pages 97 98) This fact is also true for our family T k i the discrete case (see [9]) Note that T k is o-smooth except for the case k = ad i this extreme case T agrees with the Lukasiewicz t-orm T L Note also that the ilpotet miimum (see agai [9]) is obtaied i the other extreme case give by k = /2 where /2 meas the floor of /2, that is, the greatest iteger which is smaller tha or equal to /2 Remark 2 Note that, i the particular case whe k = k, must be a eve umber ad k = /2 0 k k Figure 4 The structure of the t-orm T k Thus, sice each T k satisfies the ecessary coditio (20), we ca study which R, S, QL ad D-implicatios derived from smooth t-orms are MP, MT or MPTimplicatios for each T k I this lie we have the followig results with respect to the modus poes We begi with R-implicatios Propositio 16 Let T be a smooth t-orm ad I T its correspodig R-implicatio The, I T is a MPimplicatio for T k if ad oly if Idemp T cotais the set [k, ] = {x L k x} The case of S-implicatios is solved i the followig propositio Propositio 17 Let S be a smooth t-coorm ad I S its correspodig S-implicatio The, I S is a MPimplicatio for T k if ad oly if Idemp S cotais the set [0, k] The case of QL ad D-implicatios is also easy Sice they are derived from S L ad a smooth t-orm T, they are give by equatios (18) ad (19) respectively We will oly deal with T k whe k < k < sice the case k = correspods to the Lukasiewicz t-orm that has bee studied i the previous sectio Propositio 18 Suppose k < k < Let T be a smooth t-orm ad I QL ad I D the correspodig QL
7 ad D-implicatios derived from T The, the followig statemets are equivalet: i) I QL is a MP-implicatio for T k ii) I D is a MP-implicatio for T k iii) T is the Lukasiewicz t-orm T L iv) I QL = I D = I is the Kleee-Diees implicatio give by I(x, y) = max( x, y) I table 2 we ca view summarized all results i this sectio cocerig MP-implicatios for the t-orm T k R-implicatio from T S-implicatios from S MP-implicatio for T k [k, ] Idemp T [0, k] Idemp S tolles, to the oes obtaied for the modus poes, just by cotrapositio The oly exceptio of this is for R-implicatios I this case the results ca ot be derived from cotrapositio ad we eed to study MT idepedetly of MP However, we also obtai a idetical result to the oe obtaied for modus poes Propositio 19 Let T be a smooth t-orm ad I T its correspodig R-implicatio The, I T is a MTimplicatio for T k if ad oly if Idemp T cotais the set [k, ] I all remaiig cases all results ca be derived from cotrapositio First of all, ote that S-implicatios always satisfy cotrapositio with respect to the uique egatio N(x) = x O the other had, D-operators are the cotrapositio (with respect to N(x) = x) of QL-operators ad vice versa Usig these facts ad the duality betwee MP ad MT we ca easily prove the results cocerig MT QL-implicatios from T D-implicatios from T T = T L T = T L Propositio 20 Let S be a smooth t-coorm ad I S its correspodig S-implicatio The, the followig statemets are equivalet: Table 2 Characterizatio of MP-implicatios for the t-orm T k with k < k < O the other had, the geeral case of QL ad D- operators is ot so easy That is, whe these operators are derived from a smooth t-coorm S differet from S L I this case, we ca give oly some partial results, as follows: - Whe S = max, for ay smooth t-orm T, the QLoperator give by I QL (x, y) = max( x, T (x, y)) ad the D-operator give by I D (x, y) = max(t ( x, y), y) are MP-operators for T k ( k k ) - Whe S(x, x) = x for all x k, both the QL ad the D-operator derived from S ad ay smooth t- orm T are MP-operators for T k Fially, we wat to deal with the MT-property for T k From the duality betwee MP ad MT, we will be able to derive idetical results for the case of modus i) I S is a MP-implicatio for T k ii) I S is a MT-implicatio for T k iii) I S is a MPT-implicatio for T k iv) Idemp S cotais the set [0, k] Propositio 21 Suppose k < k < Let T be a smooth t-orm ad I QL ad I D the correspodig QL ad D-implicatios derived from T The, the followig statemets are equivalet: i) I QL (ad I D ) is a MP-implicatio for T k ii) I QL (ad I D ) is a MT-implicatio for T k iii) I QL (ad I D ) is a MPT-implicatio for T k iv) T is the Lukasiewicz t-orm T L v) I QL = I D = I is the Kleee-Diees implicatio The results for MT are summarized ow i table 3
8 R-implicatio from T S-implicatios from S QL-implicatios from T D-implicatios from T MT-implicatio for T k [k, ] Idemp T [0, k] Idemp S T = T L T = T L Table 3 Characterizatio of MT-implicatios for the t-orm T k with k < k < To fiish, ote that the geeral case of modus poes for QL ad D-operators ca be traslated also for modus tolles via duality, obtaiig agai exactly the same results I view of the characterizatios of MP ad MT coditios, sice both coicide i all four cases, it is clear that i each case the correspodig characterizatio also works i fact for the MPT-coditio 5 Coclusio The two mai iferece rules, modus poes (MP) ad modus tolles (MT), are studied for the four most usual classes of discrete implicatios: R, S, QL ad D- implicatios A characterizatio of MP ad a characterizatio of MT is give for all these kids of implicatios, obtaiig i the majority of cases the coditio T 1 (x, x) = 0, which directly derives (i the smooth case) ito the Lukasiewicz t-orm For this reaso, the o-smooth case is also studied for a geeral class of discrete t-orms T 1 that satisfy the coditio above I this study, a lot of ew solutios amog R, S, QL ad D-implicatios, derived from smooth t-orms, is obtaied for both properties MP ad MT Ackowledgemet This paper has bee partially supported by the Spaish grat MTM ad the Govermet of the Balearic Islads grat PCTIB-2005GC1-07 Refereces [1] B De Baets ad J C Fodor, Residual operators of uiorms, Soft Computig 3 (1999) [3] JC Fodor, Cotrapositive symmetry o fuzzy implicatios, Fuzzy Sets ad Systems 69 (1995) [4] J C Fodor, Smooth associative operatios o fiite ordial scales, IEEE Tras o Fuzzy Systems 8 (2000) [5] Ll Godo ad C Sierra, A ew approach to coective geeratio i the framework of expert systems usig fuzzy logic, i: Proceedigs of the XVI- IIth ISMVL, Palma de Mallorca, 1988, pp [6] S Jeei (2000), New family of triagular orms via cotrapositive symmetrizatio of residuated implicatios, Fuzzy Sets ad Systems, Vol 110, [7] EP Klemet, R Mesiar ad E Pap, Triagular orms, Kluwer Academic Publishers, Dordrecht (2000) [8] M Mas, G Mayor ad J Torres, t Operators ad uiorms o a fiite totally ordered set, It J of Itelliget Systems 14 (1999) [9] M Mas, M Moserrat ad J Torres, S- implicatios ad R-implicatios o a fiite chai, Kyberetika 40 (2004) 3 20 [10] M Mas, M Moserrat ad J Torres, O two types of discrete implicatios, It J of Approximate Reasoig 40 (2005) [11] M Mas, M Moserrat ad J Torres, QL ad D-Implicatios from uiorms, i : Proceedigs of IPMU-2006, Paris, Frace, 2006, pp [12] M Mas, M Moserrat, J Torres ad E Trillas, A survey o fuzzy implicatio fuctios, IEEE Trasactios o Fuzzy Systems, accepted [13] G Mayor ad J Torres, Triagular orms i discrete settigs, i: EP Klemet ad R Mesiar (Eds), Logical, Algebraic, Aalytic, ad Probabilistic Aspects of Triagular Norms Elsevier, Amsterdam, 2005, pp [14] D Ruiz ad J Torres, Residual implicatios ad co-implicatios from idempotet uiorms, Kyberetika 40 (2004) [15] E Trillas, C Alsia ad A Pradera, O MPTimplicatio fuctios for fuzzy logic, Rev R Acad Cie Serie A Mat 98 (2004) [2] B De Baets ad R Mesiar, Triagular orms o product lattices, Fuzzy Sets ad Systems 104 (1999) 61 75
Product measures, Tonelli s and Fubini s theorems For use in MAT3400/4400, autumn 2014 Nadia S. Larsen. Version of 13 October 2014.
Product measures, Toelli s ad Fubii s theorems For use i MAT3400/4400, autum 2014 Nadia S. Larse Versio of 13 October 2014. 1. Costructio of the product measure The purpose of these otes is to preset the
More informationCSE 1400 Applied Discrete Mathematics Number Theory and Proofs
CSE 1400 Applied Discrete Mathematics Number Theory ad Proofs Departmet of Computer Scieces College of Egieerig Florida Tech Sprig 01 Problems for Number Theory Backgroud Number theory is the brach of
More informationDiscrete-Time Systems, LTI Systems, and Discrete-Time Convolution
EEL5: Discrete-Time Sigals ad Systems. Itroductio I this set of otes, we begi our mathematical treatmet of discrete-time s. As show i Figure, a discrete-time operates or trasforms some iput sequece x [
More informationWeek 5-6: The Binomial Coefficients
Wee 5-6: The Biomial Coefficiets March 6, 2018 1 Pascal Formula Theorem 11 (Pascal s Formula For itegers ad such that 1, ( ( ( 1 1 + 1 The umbers ( 2 ( 1 2 ( 2 are triagle umbers, that is, The petago umbers
More informationPROBLEM SET 5 SOLUTIONS 126 = , 37 = , 15 = , 7 = 7 1.
Math 7 Sprig 06 PROBLEM SET 5 SOLUTIONS Notatios. Give a real umber x, we will defie sequeces (a k ), (x k ), (p k ), (q k ) as i lecture.. (a) (5 pts) Fid the simple cotiued fractio represetatios of 6
More informationInfinite Sequences and Series
Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet
More informationThe Choquet Integral with Respect to Fuzzy-Valued Set Functions
The Choquet Itegral with Respect to Fuzzy-Valued Set Fuctios Weiwei Zhag Abstract The Choquet itegral with respect to real-valued oadditive set fuctios, such as siged efficiecy measures, has bee used i
More informationCommutativity in Permutation Groups
Commutativity i Permutatio Groups Richard Wito, PhD Abstract I the group Sym(S) of permutatios o a oempty set S, fixed poits ad trasiet poits are defied Prelimiary results o fixed ad trasiet poits are
More information6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer.
6 Itegers Modulo I Example 2.3(e), we have defied the cogruece of two itegers a,b with respect to a modulus. Let us recall that a b (mod ) meas a b. We have proved that cogruece is a equivalece relatio
More informationSequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence
Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece 1, 1, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet
More informationTHE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS
THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS DEMETRES CHRISTOFIDES Abstract. Cosider a ivertible matrix over some field. The Gauss-Jorda elimiatio reduces this matrix to the idetity
More information62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +
62. Power series Defiitio 16. (Power series) Give a sequece {c }, the series c x = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + is called a power series i the variable x. The umbers c are called the coefficiets of
More informationLecture Notes for CS 313H, Fall 2011
Lecture Notes for CS 313H, Fall 011 August 5. We start by examiig triagular umbers: T () = 1 + + + ( = 0, 1,,...). Triagular umbers ca be also defied recursively: T (0) = 0, T ( + 1) = T () + + 1, or usig
More informationA Note on the Symmetric Powers of the Standard Representation of S n
A Note o the Symmetric Powers of the Stadard Represetatio of S David Savitt 1 Departmet of Mathematics, Harvard Uiversity Cambridge, MA 0138, USA dsavitt@mathharvardedu Richard P Staley Departmet of Mathematics,
More information1. By using truth tables prove that, for all statements P and Q, the statement
Author: Satiago Salazar Problems I: Mathematical Statemets ad Proofs. By usig truth tables prove that, for all statemets P ad Q, the statemet P Q ad its cotrapositive ot Q (ot P) are equivalet. I example.2.3
More informationChapter 3. Strong convergence. 3.1 Definition of almost sure convergence
Chapter 3 Strog covergece As poited out i the Chapter 2, there are multiple ways to defie the otio of covergece of a sequece of radom variables. That chapter defied covergece i probability, covergece i
More information4.3 Growth Rates of Solutions to Recurrences
4.3. GROWTH RATES OF SOLUTIONS TO RECURRENCES 81 4.3 Growth Rates of Solutios to Recurreces 4.3.1 Divide ad Coquer Algorithms Oe of the most basic ad powerful algorithmic techiques is divide ad coquer.
More informationChimica Inorganica 3
himica Iorgaica Irreducible Represetatios ad haracter Tables Rather tha usig geometrical operatios, it is ofte much more coveiet to employ a ew set of group elemets which are matrices ad to make the rule
More informationRecursive Algorithms. Recurrences. Recursive Algorithms Analysis
Recursive Algorithms Recurreces Computer Sciece & Egieerig 35: Discrete Mathematics Christopher M Bourke cbourke@cseuledu A recursive algorithm is oe i which objects are defied i terms of other objects
More informationA sequence of numbers is a function whose domain is the positive integers. We can see that the sequence
Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece,, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet as
More information4 The Sperner property.
4 The Sperer property. I this sectio we cosider a surprisig applicatio of certai adjacecy matrices to some problems i extremal set theory. A importat role will also be played by fiite groups. I geeral,
More informationSOME TRIBONACCI IDENTITIES
Mathematics Today Vol.7(Dec-011) 1-9 ISSN 0976-38 Abstract: SOME TRIBONACCI IDENTITIES Shah Devbhadra V. Sir P.T.Sarvajaik College of Sciece, Athwalies, Surat 395001. e-mail : drdvshah@yahoo.com The sequece
More informationSequences. Notation. Convergence of a Sequence
Sequeces A sequece is essetially just a list. Defiitio (Sequece of Real Numbers). A sequece of real umbers is a fuctio Z (, ) R for some real umber. Do t let the descriptio of the domai cofuse you; it
More informationMeasure and Measurable Functions
3 Measure ad Measurable Fuctios 3.1 Measure o a Arbitrary σ-algebra Recall from Chapter 2 that the set M of all Lebesgue measurable sets has the followig properties: R M, E M implies E c M, E M for N implies
More informationsubcaptionfont+=small,labelformat=parens,labelsep=space,skip=6pt,list=0,hypcap=0 subcaption ALGEBRAIC COMBINATORICS LECTURE 8 TUESDAY, 2/16/2016
subcaptiofot+=small,labelformat=pares,labelsep=space,skip=6pt,list=0,hypcap=0 subcaptio ALGEBRAIC COMBINATORICS LECTURE 8 TUESDAY, /6/06. Self-cojugate Partitios Recall that, give a partitio λ, we may
More information(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3
MATH 337 Sequeces Dr. Neal, WKU Let X be a metric space with distace fuctio d. We shall defie the geeral cocept of sequece ad limit i a metric space, the apply the results i particular to some special
More informationMath 155 (Lecture 3)
Math 55 (Lecture 3) September 8, I this lecture, we ll cosider the aswer to oe of the most basic coutig problems i combiatorics Questio How may ways are there to choose a -elemet subset of the set {,,,
More informationChapter 6 Infinite Series
Chapter 6 Ifiite Series I the previous chapter we cosidered itegrals which were improper i the sese that the iterval of itegratio was ubouded. I this chapter we are goig to discuss a topic which is somewhat
More informationMath F215: Induction April 7, 2013
Math F25: Iductio April 7, 203 Iductio is used to prove that a collectio of statemets P(k) depedig o k N are all true. A statemet is simply a mathematical phrase that must be either true or false. Here
More informationSection 4.3. Boolean functions
Sectio 4.3. Boolea fuctios Let us take aother look at the simplest o-trivial Boolea algebra, ({0}), the power-set algebra based o a oe-elemet set, chose here as {0}. This has two elemets, the empty set,
More information} is said to be a Cauchy sequence provided the following condition is true.
Math 4200, Fial Exam Review I. Itroductio to Proofs 1. Prove the Pythagorea theorem. 2. Show that 43 is a irratioal umber. II. Itroductio to Logic 1. Costruct a truth table for the statemet ( p ad ~ r
More informationOptimally Sparse SVMs
A. Proof of Lemma 3. We here prove a lower boud o the umber of support vectors to achieve geeralizatio bouds of the form which we cosider. Importatly, this result holds ot oly for liear classifiers, but
More information6.3 Testing Series With Positive Terms
6.3. TESTING SERIES WITH POSITIVE TERMS 307 6.3 Testig Series With Positive Terms 6.3. Review of what is kow up to ow I theory, testig a series a i for covergece amouts to fidig the i= sequece of partial
More informationChapter 0. Review of set theory. 0.1 Sets
Chapter 0 Review of set theory Set theory plays a cetral role i the theory of probability. Thus, we will ope this course with a quick review of those otios of set theory which will be used repeatedly.
More informationSquare-Congruence Modulo n
Square-Cogruece Modulo Abstract This paper is a ivestigatio of a equivalece relatio o the itegers that was itroduced as a exercise i our Discrete Math class. Part I - Itro Defiitio Two itegers are Square-Cogruet
More informationA class of spectral bounds for Max k-cut
A class of spectral bouds for Max k-cut Miguel F. Ajos, José Neto December 07 Abstract Let G be a udirected ad edge-weighted simple graph. I this paper we itroduce a class of bouds for the maximum k-cut
More informationLecture Overview. 2 Permutations and Combinations. n(n 1) (n (k 1)) = n(n 1) (n k + 1) =
COMPSCI 230: Discrete Mathematics for Computer Sciece April 8, 2019 Lecturer: Debmalya Paigrahi Lecture 22 Scribe: Kevi Su 1 Overview I this lecture, we begi studyig the fudametals of coutig discrete objects.
More informationConvergence of random variables. (telegram style notes) P.J.C. Spreij
Covergece of radom variables (telegram style otes).j.c. Spreij this versio: September 6, 2005 Itroductio As we kow, radom variables are by defiitio measurable fuctios o some uderlyig measurable space
More informationDefinition 4.2. (a) A sequence {x n } in a Banach space X is a basis for X if. unique scalars a n (x) such that x = n. a n (x) x n. (4.
4. BASES I BAACH SPACES 39 4. BASES I BAACH SPACES Sice a Baach space X is a vector space, it must possess a Hamel, or vector space, basis, i.e., a subset {x γ } γ Γ whose fiite liear spa is all of X ad
More informationHoggatt and King [lo] defined a complete sequence of natural numbers
REPRESENTATIONS OF N AS A SUM OF DISTINCT ELEMENTS FROM SPECIAL SEQUENCES DAVID A. KLARNER, Uiversity of Alberta, Edmoto, Caada 1. INTRODUCTION Let a, I deote a sequece of atural umbers which satisfies
More informationRecursive Algorithm for Generating Partitions of an Integer. 1 Preliminary
Recursive Algorithm for Geeratig Partitios of a Iteger Sug-Hyuk Cha Computer Sciece Departmet, Pace Uiversity 1 Pace Plaza, New York, NY 10038 USA scha@pace.edu Abstract. This article first reviews the
More informationBertrand s Postulate
Bertrad s Postulate Lola Thompso Ross Program July 3, 2009 Lola Thompso (Ross Program Bertrad s Postulate July 3, 2009 1 / 33 Bertrad s Postulate I ve said it oce ad I ll say it agai: There s always a
More information2.4 Sequences, Sequences of Sets
72 CHAPTER 2. IMPORTANT PROPERTIES OF R 2.4 Sequeces, Sequeces of Sets 2.4.1 Sequeces Defiitio 2.4.1 (sequece Let S R. 1. A sequece i S is a fuctio f : K S where K = { N : 0 for some 0 N}. 2. For each
More informationThe Random Walk For Dummies
The Radom Walk For Dummies Richard A Mote Abstract We look at the priciples goverig the oe-dimesioal discrete radom walk First we review five basic cocepts of probability theory The we cosider the Beroulli
More informationLecture 3 The Lebesgue Integral
Lecture 3: The Lebesgue Itegral 1 of 14 Course: Theory of Probability I Term: Fall 2013 Istructor: Gorda Zitkovic Lecture 3 The Lebesgue Itegral The costructio of the itegral Uless expressly specified
More informationOn the Inverse of a Certain Matrix Involving Binomial Coefficients
It. J. Cotemp. Math. Scieces, Vol. 3, 008, o. 3, 5-56 O the Iverse of a Certai Matrix Ivolvig Biomial Coefficiets Yoshiari Iaba Kitakuwada Seior High School Keihokushimoyuge, Ukyo-ku, Kyoto, 60-0534, Japa
More informationRiesz-Fischer Sequences and Lower Frame Bounds
Zeitschrift für Aalysis ud ihre Aweduge Joural for Aalysis ad its Applicatios Volume 1 (00), No., 305 314 Riesz-Fischer Sequeces ad Lower Frame Bouds P. Casazza, O. Christese, S. Li ad A. Lider Abstract.
More informationDefinitions and Theorems. where x are the decision variables. c, b, and a are constant coefficients.
Defiitios ad Theorems Remember the scalar form of the liear programmig problem, Miimize, Subject to, f(x) = c i x i a 1i x i = b 1 a mi x i = b m x i 0 i = 1,2,, where x are the decisio variables. c, b,
More informationTopic 9: Sampling Distributions of Estimators
Topic 9: Samplig Distributios of Estimators Course 003, 2016 Page 0 Samplig distributios of estimators Sice our estimators are statistics (particular fuctios of radom variables), their distributio ca be
More information2.1. The Algebraic and Order Properties of R Definition. A binary operation on a set F is a function B : F F! F.
CHAPTER 2 The Real Numbers 2.. The Algebraic ad Order Properties of R Defiitio. A biary operatio o a set F is a fuctio B : F F! F. For the biary operatios of + ad, we replace B(a, b) by a + b ad a b, respectively.
More informationProof of Fermat s Last Theorem by Algebra Identities and Linear Algebra
Proof of Fermat s Last Theorem by Algebra Idetities ad Liear Algebra Javad Babaee Ragai Youg Researchers ad Elite Club, Qaemshahr Brach, Islamic Azad Uiversity, Qaemshahr, Ira Departmet of Civil Egieerig,
More informationTEACHER CERTIFICATION STUDY GUIDE
COMPETENCY 1. ALGEBRA SKILL 1.1 1.1a. ALGEBRAIC STRUCTURES Kow why the real ad complex umbers are each a field, ad that particular rigs are ot fields (e.g., itegers, polyomial rigs, matrix rigs) Algebra
More informationChapter 7 Isoperimetric problem
Chapter 7 Isoperimetric problem Recall that the isoperimetric problem (see the itroductio its coectio with ido s proble) is oe of the most classical problem of a shape optimizatio. It ca be formulated
More informationCHAPTER 5 SOME MINIMAX AND SADDLE POINT THEOREMS
CHAPTR 5 SOM MINIMA AND SADDL POINT THORMS 5. INTRODUCTION Fied poit theorems provide importat tools i game theory which are used to prove the equilibrium ad eistece theorems. For istace, the fied poit
More information1 Duality revisited. AM 221: Advanced Optimization Spring 2016
AM 22: Advaced Optimizatio Sprig 206 Prof. Yaro Siger Sectio 7 Wedesday, Mar. 9th Duality revisited I this sectio, we will give a slightly differet perspective o duality. optimizatio program: f(x) x R
More informationBeurling Integers: Part 2
Beurlig Itegers: Part 2 Isomorphisms Devi Platt July 11, 2015 1 Prime Factorizatio Sequeces I the last article we itroduced the Beurlig geeralized itegers, which ca be represeted as a sequece of real umbers
More informationAssignment 5: Solutions
McGill Uiversity Departmet of Mathematics ad Statistics MATH 54 Aalysis, Fall 05 Assigmet 5: Solutios. Let y be a ubouded sequece of positive umbers satisfyig y + > y for all N. Let x be aother sequece
More informationEmpirical Processes: Glivenko Cantelli Theorems
Empirical Processes: Gliveko Catelli Theorems Mouliath Baerjee Jue 6, 200 Gliveko Catelli classes of fuctios The reader is referred to Chapter.6 of Weller s Torgo otes, Chapter??? of VDVW ad Chapter 8.3
More informationZeros of Polynomials
Math 160 www.timetodare.com 4.5 4.6 Zeros of Polyomials I these sectios we will study polyomials algebraically. Most of our work will be cocered with fidig the solutios of polyomial equatios of ay degree
More informationProperties of Fuzzy Length on Fuzzy Set
Ope Access Library Joural 206, Volume 3, e3068 ISSN Olie: 2333-972 ISSN Prit: 2333-9705 Properties of Fuzzy Legth o Fuzzy Set Jehad R Kider, Jaafar Imra Mousa Departmet of Mathematics ad Computer Applicatios,
More informationThe picture in figure 1.1 helps us to see that the area represents the distance traveled. Figure 1: Area represents distance travelled
1 Lecture : Area Area ad distace traveled Approximatig area by rectagles Summatio The area uder a parabola 1.1 Area ad distace Suppose we have the followig iformatio about the velocity of a particle, how
More informationSolution. 1 Solutions of Homework 1. Sangchul Lee. October 27, Problem 1.1
Solutio Sagchul Lee October 7, 017 1 Solutios of Homework 1 Problem 1.1 Let Ω,F,P) be a probability space. Show that if {A : N} F such that A := lim A exists, the PA) = lim PA ). Proof. Usig the cotiuity
More informationLecture 2 Clustering Part II
COMS 4995: Usupervised Learig (Summer 8) May 24, 208 Lecture 2 Clusterig Part II Istructor: Nakul Verma Scribes: Jie Li, Yadi Rozov Today, we will be talkig about the hardess results for k-meas. More specifically,
More informationIf a subset E of R contains no open interval, is it of zero measure? For instance, is the set of irrationals in [0, 1] is of measure zero?
2 Lebesgue Measure I Chapter 1 we defied the cocept of a set of measure zero, ad we have observed that every coutable set is of measure zero. Here are some atural questios: If a subset E of R cotais a
More informationLecture 10: Mathematical Preliminaries
Lecture : Mathematical Prelimiaries Obective: Reviewig mathematical cocepts ad tools that are frequetly used i the aalysis of algorithms. Lecture # Slide # I this
More informationStochastic Matrices in a Finite Field
Stochastic Matrices i a Fiite Field Abstract: I this project we will explore the properties of stochastic matrices i both the real ad the fiite fields. We first explore what properties 2 2 stochastic matrices
More informationAn analog of the arithmetic triangle obtained by replacing the products by the least common multiples
arxiv:10021383v2 [mathnt] 9 Feb 2010 A aalog of the arithmetic triagle obtaied by replacig the products by the least commo multiples Bair FARHI bairfarhi@gmailcom MSC: 11A05 Keywords: Al-Karaji s triagle;
More informationa 3, a 4, ... are the terms of the sequence. The number a n is the nth term of the sequence, and the entire sequence is denoted by a n
60_090.qxd //0 : PM Page 59 59 CHAPTER 9 Ifiite Series Sectio 9. EXPLORATION Fidig Patters Describe a patter for each of the followig sequeces. The use your descriptio to write a formula for the th term
More informationMath 299 Supplement: Real Analysis Nov 2013
Math 299 Supplemet: Real Aalysis Nov 203 Algebra Axioms. I Real Aalysis, we work withi the axiomatic system of real umbers: the set R alog with the additio ad multiplicatio operatios +,, ad the iequality
More informationAlgebra of Least Squares
October 19, 2018 Algebra of Least Squares Geometry of Least Squares Recall that out data is like a table [Y X] where Y collects observatios o the depedet variable Y ad X collects observatios o the k-dimesioal
More informationPolynomial identity testing and global minimum cut
CHAPTER 6 Polyomial idetity testig ad global miimum cut I this lecture we will cosider two further problems that ca be solved usig probabilistic algorithms. I the first half, we will cosider the problem
More informationTopic 9: Sampling Distributions of Estimators
Topic 9: Samplig Distributios of Estimators Course 003, 2018 Page 0 Samplig distributios of estimators Sice our estimators are statistics (particular fuctios of radom variables), their distributio ca be
More informationMathematical Foundations -1- Sets and Sequences. Sets and Sequences
Mathematical Foudatios -1- Sets ad Sequeces Sets ad Sequeces Methods of proof 2 Sets ad vectors 13 Plaes ad hyperplaes 18 Liearly idepedet vectors, vector spaces 2 Covex combiatios of vectors 21 eighborhoods,
More informationMAT1026 Calculus II Basic Convergence Tests for Series
MAT026 Calculus II Basic Covergece Tests for Series Egi MERMUT 202.03.08 Dokuz Eylül Uiversity Faculty of Sciece Departmet of Mathematics İzmir/TURKEY Cotets Mootoe Covergece Theorem 2 2 Series of Real
More informationSupermodular and ultramodular aggregation evaluators
Supermodular ad ultramodular aggregatio evaluators Marta Cardi 1 ad Maddalea Mazi 2 1 Dept. of Applied Mathematics, Uiversity of Veice, Dorsoduro 3825/E, 30123 Veice, Italy mcardi@uive.it http://www.uive.it
More informationThe r-generalized Fibonacci Numbers and Polynomial Coefficients
It. J. Cotemp. Math. Scieces, Vol. 3, 2008, o. 24, 1157-1163 The r-geeralized Fiboacci Numbers ad Polyomial Coefficiets Matthias Schork Camillo-Sitte-Weg 25 60488 Frakfurt, Germay mschork@member.ams.org,
More informationb i u x i U a i j u x i u x j
M ath 5 2 7 Fall 2 0 0 9 L ecture 1 9 N ov. 1 6, 2 0 0 9 ) S ecod- Order Elliptic Equatios: Weak S olutios 1. Defiitios. I this ad the followig two lectures we will study the boudary value problem Here
More informationLargest families without an r-fork
Largest families without a r-for Aalisa De Bois Uiversity of Salero Salero, Italy debois@math.it Gyula O.H. Katoa Réyi Istitute Budapest, Hugary ohatoa@reyi.hu Itroductio Let [] = {,,..., } be a fiite
More informationOn the distribution of coefficients of powers of positive polynomials
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 49 (2011), Pages 239 243 O the distributio of coefficiets of powers of positive polyomials László Major Istitute of Mathematics Tampere Uiversity of Techology
More informationTopic 9: Sampling Distributions of Estimators
Topic 9: Samplig Distributios of Estimators Course 003, 2018 Page 0 Samplig distributios of estimators Sice our estimators are statistics (particular fuctios of radom variables), their distributio ca be
More information3. Z Transform. Recall that the Fourier transform (FT) of a DT signal xn [ ] is ( ) [ ] = In order for the FT to exist in the finite magnitude sense,
3. Z Trasform Referece: Etire Chapter 3 of text. Recall that the Fourier trasform (FT) of a DT sigal x [ ] is ω ( ) [ ] X e = j jω k = xe I order for the FT to exist i the fiite magitude sese, S = x [
More informationLinear Regression Demystified
Liear Regressio Demystified Liear regressio is a importat subject i statistics. I elemetary statistics courses, formulae related to liear regressio are ofte stated without derivatio. This ote iteds to
More informationAnalytic Continuation
Aalytic Cotiuatio The stadard example of this is give by Example Let h (z) = 1 + z + z 2 + z 3 +... kow to coverge oly for z < 1. I fact h (z) = 1/ (1 z) for such z. Yet H (z) = 1/ (1 z) is defied for
More informationOnce we have a sequence of numbers, the next thing to do is to sum them up. Given a sequence (a n ) n=1
. Ifiite Series Oce we have a sequece of umbers, the ext thig to do is to sum them up. Give a sequece a be a sequece: ca we give a sesible meaig to the followig expressio? a = a a a a While summig ifiitely
More informationMachine Learning Theory Tübingen University, WS 2016/2017 Lecture 11
Machie Learig Theory Tübige Uiversity, WS 06/07 Lecture Tolstikhi Ilya Abstract We will itroduce the otio of reproducig kerels ad associated Reproducig Kerel Hilbert Spaces (RKHS). We will cosider couple
More informationStatistics 511 Additional Materials
Cofidece Itervals o mu Statistics 511 Additioal Materials This topic officially moves us from probability to statistics. We begi to discuss makig ifereces about the populatio. Oe way to differetiate probability
More information1 Introduction. 1.1 Notation and Terminology
1 Itroductio You have already leared some cocepts of calculus such as limit of a sequece, limit, cotiuity, derivative, ad itegral of a fuctio etc. Real Aalysis studies them more rigorously usig a laguage
More informationEstimation for Complete Data
Estimatio for Complete Data complete data: there is o loss of iformatio durig study. complete idividual complete data= grouped data A complete idividual data is the oe i which the complete iformatio of
More informationFeedback in Iterative Algorithms
Feedback i Iterative Algorithms Charles Byre (Charles Byre@uml.edu), Departmet of Mathematical Scieces, Uiversity of Massachusetts Lowell, Lowell, MA 01854 October 17, 2005 Abstract Whe the oegative system
More informationMachine Learning Theory Tübingen University, WS 2016/2017 Lecture 12
Machie Learig Theory Tübige Uiversity, WS 06/07 Lecture Tolstikhi Ilya Abstract I this lecture we derive risk bouds for kerel methods. We will start by showig that Soft Margi kerel SVM correspods to miimizig
More information(b) What is the probability that a particle reaches the upper boundary n before the lower boundary m?
MATH 529 The Boudary Problem The drukard s walk (or boudary problem) is oe of the most famous problems i the theory of radom walks. Oe versio of the problem is described as follows: Suppose a particle
More informationAppendix to Quicksort Asymptotics
Appedix to Quicksort Asymptotics James Alle Fill Departmet of Mathematical Scieces The Johs Hopkis Uiversity jimfill@jhu.edu ad http://www.mts.jhu.edu/~fill/ ad Svate Jaso Departmet of Mathematics Uppsala
More information7 Sequences of real numbers
40 7 Sequeces of real umbers 7. Defiitios ad examples Defiitio 7... A sequece of real umbers is a real fuctio whose domai is the set N of atural umbers. Let s : N R be a sequece. The the values of s are
More informationSection 5.1 The Basics of Counting
1 Sectio 5.1 The Basics of Coutig Combiatorics, the study of arragemets of objects, is a importat part of discrete mathematics. I this chapter, we will lear basic techiques of coutig which has a lot of
More informationInverse Matrix. A meaning that matrix B is an inverse of matrix A.
Iverse Matrix Two square matrices A ad B of dimesios are called iverses to oe aother if the followig holds, AB BA I (11) The otio is dual but we ofte write 1 B A meaig that matrix B is a iverse of matrix
More informationFIXED POINTS OF n-valued MULTIMAPS OF THE CIRCLE
FIXED POINTS OF -VALUED MULTIMAPS OF THE CIRCLE Robert F. Brow Departmet of Mathematics Uiversity of Califoria Los Ageles, CA 90095-1555 e-mail: rfb@math.ucla.edu November 15, 2005 Abstract A multifuctio
More informationStructural Functionality as a Fundamental Property of Boolean Algebra and Base for Its Real-Valued Realizations
Structural Fuctioality as a Fudametal Property of Boolea Algebra ad Base for Its Real-Valued Realizatios Draga G. Radojević Uiversity of Belgrade, Istitute Mihajlo Pupi, Belgrade draga.radojevic@pupi.rs
More informationSequences and Series of Functions
Chapter 6 Sequeces ad Series of Fuctios 6.1. Covergece of a Sequece of Fuctios Poitwise Covergece. Defiitio 6.1. Let, for each N, fuctio f : A R be defied. If, for each x A, the sequece (f (x)) coverges
More informationEntropy and Ergodic Theory Lecture 5: Joint typicality and conditional AEP
Etropy ad Ergodic Theory Lecture 5: Joit typicality ad coditioal AEP 1 Notatio: from RVs back to distributios Let (Ω, F, P) be a probability space, ad let X ad Y be A- ad B-valued discrete RVs, respectively.
More informationFundamental Theorem of Algebra. Yvonne Lai March 2010
Fudametal Theorem of Algebra Yvoe Lai March 010 We prove the Fudametal Theorem of Algebra: Fudametal Theorem of Algebra. Let f be a o-costat polyomial with real coefficiets. The f has at least oe complex
More information