Section 4.3. Boolean functions

Transcription

1 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, which is (bottom), ad the set {0}, which is. Let us write 2 for this algebra; thus, 2 = {, }, with the total orderig give by <. t is obvious, either because we are havig a two-elemet total orderig, or because we are havig a algebra of sets, that the Boolea operatios are as follows: = = = = = = = = - = - =. We read as true, as false ; we read the operatio as ad, as or, - as ot. this way, the two-elemet Boolea algebra becomes a algebra of truth-values, ad becomes the basis of propositioal logic. propositioal logic, we aalyze seteces ito costituet parts out of which the setece is built up usig the coectives: (cojuctio; "ad"), (disjuctio; "or"), (egatio; "ot"; the differece to the "mius" sig, -, is iessetial), ad two more: (coditioal; "if..., the...") ad (bicoditioal; "if ad oly if"). We also call a setece of the form A B a cojuctio, its terms A ad B the cojucts i the setece. As idicated i the previous paragraph, the operatio of cojuctio is the oe that forms A B out of A, B. A B is a disjuctio; A ad B are its disjucts. A B is a coditioal; A is its atecedet, B its succedet. A B is a bicoditioal. 22

2 Cosider the followig seteces: " is divisible by 2, or is divisible by 3." " is divisible by 2, ad is divisible by 3." "f the greatest commo divisor of ad 6 is ot, the is divisible by 2, or is divisible 3." " is divisible by 6 if ad oly if is divisible by 2 ad is divisible by 3." By deotig the setece " is divisible by 2 " by A ; also A " is divisible by 2 "; B " is divisible by 3 ", C " is divisible by 6 ", D " The greatest commo divisor of ad 6 is ", the above seteces may be aalyzed, respectively, as E A B, F A B, G ( D) (A B), H C (A B). 23

3 The truth or falsity of the last four composite seteces deped o the truth-values of their costituets A, B, C ad D. (Of course, the truth-value of each of A, B, C ad D deped o the value of the, which we assume to be a fixed, but uspecified, atural umber.) The depedece of the truth-value of E is exactly accordig to the truth-table give above describig the effect of the operatio of (cojuctio) o the two truth-values. That is to say, if A ad B are both true, so is E A B ; i ay other of the three cases cocerig the values of A ad B : (, ), (, ), ad (, ), the value of A B is false. This correspods to the ordiary use of the coective "ad". The truth-value of F A B is computed accordig to the truth-table for (disjuctio) give above. E.g., if = 6, or if = 2, or if = 3, A B is true; i fact, accordig to the first three lies of that table, i the give order. However, if =, the A B is false; this correspods to the last lie of the table. Notice that disjuctio as we are describig it here is o-exclusive "or" ; a disjuctio is true if, i particular, both disjucts are true. The setece i questio is, i more explicit form, "Either is divisible by 2, or is divisible by 3, or both." Let us ote that i mathematics, "or" (disjuctio) is always iteded as o-exclusive "or". (With exclusive "or", a disjuctio would be true just i case precisely oe disjuct is true.) This may be see e.g. o the setece G that is regarded as beig true, o matter what is. f = 6, the the succedet of the coditioal, A B is true uder the o-exclusive iterpretatio, but ot uder the exclusive oe. The coective of egatio as used i mathematical laguage, clearly correspods to the table give for it above. f = 5, the D (with D the setece deoted by D above) is true, ad D is false; if = 2, the D is false, ad D is true. The coective of the coditioal also correspods to a operatio i the two-elemet algebra 2 as follows: =, =, =, =. 24

4 This table says that a coditioal is true uless the atecedet is true, ad the succedet is false. particular, the coditioal is true wheever the atecedet is false, idepedetly of the truth-value of the succedet: "false implies everythig". We may verify that this correspods to the usual mathematical use by cosiderig that the setece that is, C A, "f is divisible by 6, the is divisible by 2 ", should be true o matter what the value of is. f = 6, = 2, =, we obtai the seteces "f 6 is divisible by 6, the 6 is divisible by 2 ", "f 2 is divisible by 6, the 2 is divisible by 2 ", "f is divisible by 6, the is divisible by 2 ". These are of the respective forms,,. As said, ordiary mathematical usage attributes the value true to these forms, i agreemet with the table for the coditioal above. The fact that a coditioal is true oce the atecedet is false is also reflected i the geeral approach to the proof of a coditioal, which is that we start by assumig that the atecedet is true. fact, we may just as well do so, sice if the atecedet is false, the whole coditioal is automatically true, ad we ca rest i our task of provig the coditioal to be true. 25

5 The coditioal ca be expressed i terms of egatio ad disjuctio: x y = (-x) y () is a idetity true for ay values of x ad y i 2 (verify!). Thus, i priciple, the coditioal could be dispesed with; setece G may be paraphrased as "Either the greatest commo divisor of ad 6 is, or is divisible by 2, or is divisible by 3." The bicoditioal has the followig truth-table: = = = =. other words, the bicoditioal is true just i case its terms have equal truth-values. The bicoditioal ca also be expressed i terms of previous coectives: x y = (x y) (y x) (2) (verify!). fact, this correspods to our geeral attitude towards the proof of a bicoditioal, which is that it ivolves the proof of two coditioals. The equalities (), (2) may be cosidered as iitios of the coditioal ad the bicoditioal as operatios i a arbitrary Boolea algebra. case that algebra is (B), the power-set algebra, the, for sets X ad Y B, we have that ad X Y = (-X) Y X Y = ((-X) Y) ((-Y) X). 26

6 Next, we itroduce a geeral costructio o Boolea algebras. Let = (A, ) be ay Boolea algebra, ay set. We cosider all fuctios from ito A as the elemets of a ew Boolea algebra deoted ; read " -to-the-power- ", or more simply, " -to- ". The uderlyig set of is, as we said, A, the set of all * fuctios ξ: A. The orderig i,, is ied compoetwise from : for ξ, ζ A, * ξ ζ ξ(i) ζ(i) for all i. * There are several thigs to check: firstly, that is ideed a order o A ; further, that this order has all the requisite properties to make =(A, * ) a Boolea algebra. fact, what * * * * * happes is that the Boolea operatios,,,, ad - i are all computed compoetwise: for all ξ, ζ A ad i, we have: * (i) =, * (i) =, (ξ ζ)(i) = ξ(i) ζ(i) * (we should have writte ξ ζ, but it is ot ecessary to be that pedatic...). (ξ ζ)(i) = ξ(i) ζ(i) (-ξ)(i) = -(ξ(i)) The proof of all these assertios is easy. For istace, the assertio for is that the fuctio η A for which η(i) = ξ(i) ζ(i) for all i is, i fact, the meet of ξ ad ζ i. Accordig to a display o page 80 i Sectio 3.2, the best way to prove this is showig that for all χ A, * χ η χ ξ ad χ ζ. 27

7 Whe we put i the iitio of η ad that of *, we get for all χ A, χ(i) ξ(i) ζ(i) χ(i) ξ(i) ad χ(i) ζ(i), which, for each i, is a istace of the same relatio o page 80 i Sectio 3.2 for the origial Boolea algebra. Let us apply the power-costructio to the algebra =2. The elemets of the Boolea algebra 2 are the fuctios {, } ; for ξ, ηε{, }, ξ η iff ξ(i) η(i) for all iε. Also ote that sice 2 has just two elemets ad, ad <, ξ(i) η(i) is equivalet to sayig that if ξ(i) =, the η(i) =. The power-algebra 2 () : is i fact a very familiar oe: it is isomorphic to the power-set algebra () 2. Let us specify the isomorphism, i fact, i both directios: f () 2 :: g for X ε (), f(x) is the fuctio {, } for which if u ε X f(x)(u) = if u X ad for ay fuctio ξ ε {, }, g(ξ) is the subset of give as g(ξ) = {uε ξ(u) = }. 28

8 These mappigs f ad g respect the orders, ad they are iverses of each other; these facts are easily checked (exercises). other words, f is a isomorphism f: () 2. Note that, for X (), f(x) is what we call the characteristic fuctio of X. This represetatio of power-set algebras provides a direct proof that ay idetity that holds i the 2-elemet algebra 2 holds i ay power-set algebra, ad hece, i ay Boolea algebra whatsoever. The reaso is that, as it is see by ispectio, a idetity that holds i a algebra holds also i a power of it; also remember that we said i the previous sectio that all idetities i set-algebras hold i all Boolea algebras. See i the light of the last statemet, the iitio of "Boolea algebra" is just a summary of what idetities hold i the algebra of the two truth-values! Note carefully that, if we take this "iitio" of "Boolea algebra" as basic, it is ot obvious -- although ow kow by us -- that the Boolea laws are all cosequeces of the few that we earlier explicitly specified as the Boolea laws. Whe people talk about "Boolea fuctios", they mea fuctios of possibly several variables, all of which rage over the set {, }, ad whose values are also i {, }. (Very ofte (specially i computer sciece), we write for, ad 0 for ; but we will stick to the, -otatio.) f the fuctio f i questio has variables P,..., P [we write P for the variables, sice they are see as "propositios"; i fact, they simply take the values ad ], the f is a fuctio f : {, } {, } ; for ay P,..., P {, }, f(p,..., P ) is agai a elemet of {, }. (2 ) With the fixed, ote that the umber of distict -variable Boolea fuctios is 2. A Boolea fuctio f ca be represeted by a truth-table listig all possible systems of argumet-values, ad the correspodig fuctio-values. For istace, whe =3, the 29

9 truth-table might be like this (we write P, Q, R for P, P, P ): 2 3 P Q R f(p, Q, R) (3) Now, regard the set {, } as the uderlyig set of 2. The the -variable Boolea fuctios form the uderlyig set of the power-algebra 2, where ={, }. other words, for a fixed, the -variable Boolea fuctios themselves form a Boolea algebra. Let us write P to abbreviate P,..., P. The Boolea operatios o the power-algebra ({, 2 } ), the Boolea algebra of -variable Boolea fuctios, is ied compoetwise: (f g)(p) = f(p) g(p), ad similarly for the other operatios. ({, We write, more simply, BF[] for 2 } ), the Boolea algebra of -variable Boolea fuctios. The most atural examples for Boolea fuctios are the Boolea polyomials: these are the fuctios that ca be writte dow by repeated use of the basic Boolea operatios. For istace, whe =3, the followig are Boolea polyomials : ( (((P R) (Q R)) )) R (R Q). 30

10 The fact that the last does ot cotai the variable P does ot make it illegitimate as a three-variable polyomial: this oe simply does ot deped o P. Boolea polyomials should be see as aalogs to ordiary (algebraic) polyomials. The differeces are that, Boolea polyomials are fuctios o the truth-values, istead of umbers; ad the basic Boolea operatios figure i them, istead of the ordiary arithmetical operatios +,, etc. A Boolea polyomial is (or, deotes) a Boolea fuctio: substitutig iite truth-values for the variables, ad usig the basic Boolea operatios o truth-values, we get a iite value for the polyomial. For istace, here are all the values of the first of the two listed polyomials: P Q R ( (((P R) (Q R)) )) R Calculatig the value, for istace i the third lie, looks like this: ( (((P R) (Q R)) )) R this, first, we wrote the value of every variable uder each occurrece of the variable, icludig the value uder the costat i the polyomial; ext, we proceeded to calculate the values of the part-expressios from the iside out; there are as may as there are coectives, occurreces of,, ad -. The umbers idicate the order i which we go through all costituet expressios util we reach the total expressio i stage 8 ; the fial result is that above 8,. There is a slight ambiguity i the meaig of the expressio "Boolea polyomial". We 3

11 sometimes mea the formal expressio itself, rather tha the fuctio deoted by it. However, the official meaig should remai the fuctio itself; whe oe wats to refer to the formal otio, oe should say "formal polyomial". This remark is relevat i the light of the fact that two formally differet Boolea polyomials may be equal to each other. the first of the last two examples, the values i the value-colum coicide with the values of R ; the polyomial coicides (deotes the same fuctio as) the simple polyomial ("moomial") R. Of course, this pheomeo is familiar i the case of ordiary (algebraic) polyomials. E.g, 2 2 the two formal polyomial expressios (x-y)(x+y) ad x -y deote the same polyomial. We ca see this by usig the basic algebraic laws. The situatio with Boolea polyomials is similar. stead of goig through the tables of values (which ted to be very large eve with a moderate umber of variables), we may use the Boolea idetities to establish that two formal Boolea polyomials are the same polyomial. For istace, i the example at had: ( (((P R) (Q R)) )) R = ( (((P Q) R) )) R (distributive law) = ( ((P Q) R) ) R (uit law) = ( (P Q) R) ) R (De Morga) = ( (P Q) R) ) R (double egatio) = R (commutative law, absorptio) fact, what we said about all idetities of Boolea algebras beig true i 2 meas that every time two formal Boolea polyomials are the same fuctio o the truthc-values, this fact ca be deduced by usig the Boolea idetities aloe. Note that the Boolea operatios o the Boolea polyomials as Boolea fuctios are performed by formally applyig the operatio i questio. For istace, if the three variable polyomials metioed above are briefly called f ad g, the f g is (( (((P R) (Q R)) )) R ) (R Q). What this meas is that 32

12 the Boolea polyomials form a subalgebra of BF[]. Cosider ow the variables P, P 2,... P themselves as such Boolea fuctios, i fact, Boolea polyomials. P i is the fuctio that satisfies P (ε,..., ε,..., ε ) = ε ; i i i here, each ε,, ε is a truth-value, or. (This is similar as whe the sigle variable say y is regarded as oe of the ordiary polyomials i variables x, y, z.) We clearly have that the particular elemets P i polyomials. of BF[] geerate the Boolea subalgebra of Boolea Now, claim that the Boolea fuctios P, P 2,... P are idepedet i the Boolea algebra of all -elemet Boolea fuctios. What we have to see is that, for ay distributio of the values ε,, ε i {, }, the meet-expressio ε P ε P... ε P 2 2 is differet from i the Boolea algebra of Boolea fuctios; here, εp meas P if ε =, ad -P if ε =. But if we give the value ε to P, we get that ε P takes i i i i the value : (P)(P= ) = ; (-P)(P= ) = ; thus, (ε P ε P... ε P )(P =ε,..., P =ε ) =... =. 2 2 Sice the fuctio takes the value the -fuctio, which is costat. at at least oe system of argumets, the fuctio is ot Remember that a idepedet family of elemets geerate a Boolea subalgebra of size (2 ) (2 2. t follows that there are exactly 2 ) distict Boolea polyomials. But the 33

13 (2 whole algebra BF[] is of the same size, 2 ). t follows that all Boolea fuctios are (represeted by) Boolea polyomials. fact, all Boolea fuctios ca be writte as jois of complete meet expressios i terms of the variables. The expressios P ad P (or, P ) are also called literals. The expressio of a Boolea i i i fuctio as a joi of distict complete meets of literals is called the disjuctive ormal form (df) of the fuctio. We have that every fuctio has a uique df: the complete meets of literals appearig i the df are determied as those atoms of BF[] that are below the give fuctio. Applyig duality, oe also gets a cojuctive ormal form. The last-stated fact has cocerig the existece of the df also has a direct proof, together with a simple method of producig the df of a fuctio, based o the truth-table of the fuctio. The result is this. Cosider the truth-table of the -variable Boolea fuctio f. Select those lies i the table i which the value of f is case are, 2,..., k. ; say the lies i which this is the Each lie j ( j=,..., k ) has a certai system of the values of the variables. Let us deote the value of P i lie i j by ε ji (ad ot ε ij, because j deotes the k "row-umber", i the "colum-umber"). The df of f is ε ji P i ; or i more j=i= detail, ε P ε 2 P 2... ε P ε 2 P ε 22 P 2... ε 2 P... ε P ε P... ε P. k k2 2 k Here we used the covetio applied before: P is P, P is P. To give a example, cosider the fuctio whose truth-table is (3). There are five lies where 34

14 the value is. The df is PQR PQR PQR PQR PQR. The proof that this is a correct procedure has to show that the df costructed assumes the same values at each system of values for the variables. Now, the df is if ad oly if oe of its disjucts is. But each disjuct correspods to a lie, say j, where the value of f is. The correspodig disjuct is ε P ε P... ε P, (4) j j2 2 j ad this will take the value iff each cojuct ε P takes the value ji i, which is the case if ad oly if P i takes the value ε ji. This meas that the uique system of truth-values where the value of (4) is is precisely the oe i lie j! We have cocluded that the df takes the value exactly i the lies j, for j=,..., k, which are also exactly the lies where f is. This proves that the df ad f are idetical fuctios. The df of a Boolea fuctio may be extremely large already i case of a moderate umber of variables. The problem of Boolea realizatio is to fid a possibly small formal Boolea polyomial represetig a give Boolea fuctio. 35