Proving AND distributive law using Boolean algebra

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
1
down vote

favorite
1












$$ X(Y+Z) = (XY) + (XZ) $$



I can’t seem to derive the proper steps to prove this equation using Boolean axioms. The hint I’ve been given is using demorgans laws proofs but I still can’t seem to figure it out.
These are the axioms I’ve been given to prove this. I know that this is typically a given axiom but I have to use the others to prove that this is true.



https://encrypted-tbn0.gstatic.com/images?q=tbn:ANd9GcTPdbHp-cPxgLiwXS1zP2npvK92CG-I8IPxvN52574xEs2pd_Q










share|cite|improve this question























  • Using the Boolean axioms, means that you should set up a truth table, right ?
    – Ahmad Bazzi
    Sep 10 at 21:25










  • No it means using any of these axioms to prove that both sides are equivalent encrypted-tbn0.gstatic.com/…
    – Jakemathbad
    Sep 10 at 21:27











  • This is usually one of the axioms for a Boolean algebra. Since this isn't the case for you: What precisely are the axioms of a Boolean algebra that you've been given?
    – Stefan Mesken
    Sep 10 at 21:28











  • Then it is the distributive law
    – Ahmad Bazzi
    Sep 10 at 21:35










  • @AhmadBazzi yes it is the distributive law, but I have to prove that both sides of the equation are equivalent using only Boolean equations (not the AND distributive law) the point is to derive the equation
    – Jakemathbad
    Sep 10 at 21:39














up vote
1
down vote

favorite
1












$$ X(Y+Z) = (XY) + (XZ) $$



I can’t seem to derive the proper steps to prove this equation using Boolean axioms. The hint I’ve been given is using demorgans laws proofs but I still can’t seem to figure it out.
These are the axioms I’ve been given to prove this. I know that this is typically a given axiom but I have to use the others to prove that this is true.



https://encrypted-tbn0.gstatic.com/images?q=tbn:ANd9GcTPdbHp-cPxgLiwXS1zP2npvK92CG-I8IPxvN52574xEs2pd_Q










share|cite|improve this question























  • Using the Boolean axioms, means that you should set up a truth table, right ?
    – Ahmad Bazzi
    Sep 10 at 21:25










  • No it means using any of these axioms to prove that both sides are equivalent encrypted-tbn0.gstatic.com/…
    – Jakemathbad
    Sep 10 at 21:27











  • This is usually one of the axioms for a Boolean algebra. Since this isn't the case for you: What precisely are the axioms of a Boolean algebra that you've been given?
    – Stefan Mesken
    Sep 10 at 21:28











  • Then it is the distributive law
    – Ahmad Bazzi
    Sep 10 at 21:35










  • @AhmadBazzi yes it is the distributive law, but I have to prove that both sides of the equation are equivalent using only Boolean equations (not the AND distributive law) the point is to derive the equation
    – Jakemathbad
    Sep 10 at 21:39












up vote
1
down vote

favorite
1









up vote
1
down vote

favorite
1






1





$$ X(Y+Z) = (XY) + (XZ) $$



I can’t seem to derive the proper steps to prove this equation using Boolean axioms. The hint I’ve been given is using demorgans laws proofs but I still can’t seem to figure it out.
These are the axioms I’ve been given to prove this. I know that this is typically a given axiom but I have to use the others to prove that this is true.



https://encrypted-tbn0.gstatic.com/images?q=tbn:ANd9GcTPdbHp-cPxgLiwXS1zP2npvK92CG-I8IPxvN52574xEs2pd_Q










share|cite|improve this question















$$ X(Y+Z) = (XY) + (XZ) $$



I can’t seem to derive the proper steps to prove this equation using Boolean axioms. The hint I’ve been given is using demorgans laws proofs but I still can’t seem to figure it out.
These are the axioms I’ve been given to prove this. I know that this is typically a given axiom but I have to use the others to prove that this is true.



https://encrypted-tbn0.gstatic.com/images?q=tbn:ANd9GcTPdbHp-cPxgLiwXS1zP2npvK92CG-I8IPxvN52574xEs2pd_Q







discrete-mathematics boolean-algebra






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Sep 10 at 21:30

























asked Sep 10 at 21:19









Jakemathbad

305




305











  • Using the Boolean axioms, means that you should set up a truth table, right ?
    – Ahmad Bazzi
    Sep 10 at 21:25










  • No it means using any of these axioms to prove that both sides are equivalent encrypted-tbn0.gstatic.com/…
    – Jakemathbad
    Sep 10 at 21:27











  • This is usually one of the axioms for a Boolean algebra. Since this isn't the case for you: What precisely are the axioms of a Boolean algebra that you've been given?
    – Stefan Mesken
    Sep 10 at 21:28











  • Then it is the distributive law
    – Ahmad Bazzi
    Sep 10 at 21:35










  • @AhmadBazzi yes it is the distributive law, but I have to prove that both sides of the equation are equivalent using only Boolean equations (not the AND distributive law) the point is to derive the equation
    – Jakemathbad
    Sep 10 at 21:39
















  • Using the Boolean axioms, means that you should set up a truth table, right ?
    – Ahmad Bazzi
    Sep 10 at 21:25










  • No it means using any of these axioms to prove that both sides are equivalent encrypted-tbn0.gstatic.com/…
    – Jakemathbad
    Sep 10 at 21:27











  • This is usually one of the axioms for a Boolean algebra. Since this isn't the case for you: What precisely are the axioms of a Boolean algebra that you've been given?
    – Stefan Mesken
    Sep 10 at 21:28











  • Then it is the distributive law
    – Ahmad Bazzi
    Sep 10 at 21:35










  • @AhmadBazzi yes it is the distributive law, but I have to prove that both sides of the equation are equivalent using only Boolean equations (not the AND distributive law) the point is to derive the equation
    – Jakemathbad
    Sep 10 at 21:39















Using the Boolean axioms, means that you should set up a truth table, right ?
– Ahmad Bazzi
Sep 10 at 21:25




Using the Boolean axioms, means that you should set up a truth table, right ?
– Ahmad Bazzi
Sep 10 at 21:25












No it means using any of these axioms to prove that both sides are equivalent encrypted-tbn0.gstatic.com/…
– Jakemathbad
Sep 10 at 21:27





No it means using any of these axioms to prove that both sides are equivalent encrypted-tbn0.gstatic.com/…
– Jakemathbad
Sep 10 at 21:27













This is usually one of the axioms for a Boolean algebra. Since this isn't the case for you: What precisely are the axioms of a Boolean algebra that you've been given?
– Stefan Mesken
Sep 10 at 21:28





This is usually one of the axioms for a Boolean algebra. Since this isn't the case for you: What precisely are the axioms of a Boolean algebra that you've been given?
– Stefan Mesken
Sep 10 at 21:28













Then it is the distributive law
– Ahmad Bazzi
Sep 10 at 21:35




Then it is the distributive law
– Ahmad Bazzi
Sep 10 at 21:35












@AhmadBazzi yes it is the distributive law, but I have to prove that both sides of the equation are equivalent using only Boolean equations (not the AND distributive law) the point is to derive the equation
– Jakemathbad
Sep 10 at 21:39




@AhmadBazzi yes it is the distributive law, but I have to prove that both sides of the equation are equivalent using only Boolean equations (not the AND distributive law) the point is to derive the equation
– Jakemathbad
Sep 10 at 21:39










1 Answer
1






active

oldest

votes

















up vote
1
down vote













I'm using the notation you use in the question.

It might not be obvious which law is each, since in the image your axioms have a different notation, but I thing with the tags in each step you'll get it.
beginalign
XY + XZ
&= (XY + X)(XY + Z) tagdistributivity\
&= X (XY + Z) tagabsorption\
&= X (Z + XY) tagcommutativity\
&= X ((Z + X)(Z + Y)) tagdistributivity\
&= (X(Z + X))(Z + Y) tagassociativity\
&= X(Z + Y) tagabsorption\
&= X(Y + Z). tagcommutativity
endalign
Notice you still have to pick the right law (there is a pair of each), except for the distributivity, in which case we're using here the one there we're not proving.






share|cite|improve this answer




















  • I'm confused on the very first step, how did you use the OR distributive law to make XY + XZ = (XY + X) (XY + Z ), maybe I just can't see it, but it looks as if you used the AND law of distributivity
    – Jakemathbad
    Sep 11 at 20:17










  • @Jakemathbad Make $W=XY$, and use $W+XZ=(W+X)(W+Z)$.
    – amrsa
    Sep 11 at 20:34










Your Answer




StackExchange.ifUsing("editor", function ()
return StackExchange.using("mathjaxEditing", function ()
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
);
);
, "mathjax-editing");

StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "69"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);

else
createEditor();

);

function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
convertImagesToLinks: true,
noModals: false,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);



);













 

draft saved


draft discarded


















StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2912380%2fproving-and-distributive-law-using-boolean-algebra%23new-answer', 'question_page');

);

Post as a guest






























1 Answer
1






active

oldest

votes








1 Answer
1






active

oldest

votes









active

oldest

votes






active

oldest

votes








up vote
1
down vote













I'm using the notation you use in the question.

It might not be obvious which law is each, since in the image your axioms have a different notation, but I thing with the tags in each step you'll get it.
beginalign
XY + XZ
&= (XY + X)(XY + Z) tagdistributivity\
&= X (XY + Z) tagabsorption\
&= X (Z + XY) tagcommutativity\
&= X ((Z + X)(Z + Y)) tagdistributivity\
&= (X(Z + X))(Z + Y) tagassociativity\
&= X(Z + Y) tagabsorption\
&= X(Y + Z). tagcommutativity
endalign
Notice you still have to pick the right law (there is a pair of each), except for the distributivity, in which case we're using here the one there we're not proving.






share|cite|improve this answer




















  • I'm confused on the very first step, how did you use the OR distributive law to make XY + XZ = (XY + X) (XY + Z ), maybe I just can't see it, but it looks as if you used the AND law of distributivity
    – Jakemathbad
    Sep 11 at 20:17










  • @Jakemathbad Make $W=XY$, and use $W+XZ=(W+X)(W+Z)$.
    – amrsa
    Sep 11 at 20:34














up vote
1
down vote













I'm using the notation you use in the question.

It might not be obvious which law is each, since in the image your axioms have a different notation, but I thing with the tags in each step you'll get it.
beginalign
XY + XZ
&= (XY + X)(XY + Z) tagdistributivity\
&= X (XY + Z) tagabsorption\
&= X (Z + XY) tagcommutativity\
&= X ((Z + X)(Z + Y)) tagdistributivity\
&= (X(Z + X))(Z + Y) tagassociativity\
&= X(Z + Y) tagabsorption\
&= X(Y + Z). tagcommutativity
endalign
Notice you still have to pick the right law (there is a pair of each), except for the distributivity, in which case we're using here the one there we're not proving.






share|cite|improve this answer




















  • I'm confused on the very first step, how did you use the OR distributive law to make XY + XZ = (XY + X) (XY + Z ), maybe I just can't see it, but it looks as if you used the AND law of distributivity
    – Jakemathbad
    Sep 11 at 20:17










  • @Jakemathbad Make $W=XY$, and use $W+XZ=(W+X)(W+Z)$.
    – amrsa
    Sep 11 at 20:34












up vote
1
down vote










up vote
1
down vote









I'm using the notation you use in the question.

It might not be obvious which law is each, since in the image your axioms have a different notation, but I thing with the tags in each step you'll get it.
beginalign
XY + XZ
&= (XY + X)(XY + Z) tagdistributivity\
&= X (XY + Z) tagabsorption\
&= X (Z + XY) tagcommutativity\
&= X ((Z + X)(Z + Y)) tagdistributivity\
&= (X(Z + X))(Z + Y) tagassociativity\
&= X(Z + Y) tagabsorption\
&= X(Y + Z). tagcommutativity
endalign
Notice you still have to pick the right law (there is a pair of each), except for the distributivity, in which case we're using here the one there we're not proving.






share|cite|improve this answer












I'm using the notation you use in the question.

It might not be obvious which law is each, since in the image your axioms have a different notation, but I thing with the tags in each step you'll get it.
beginalign
XY + XZ
&= (XY + X)(XY + Z) tagdistributivity\
&= X (XY + Z) tagabsorption\
&= X (Z + XY) tagcommutativity\
&= X ((Z + X)(Z + Y)) tagdistributivity\
&= (X(Z + X))(Z + Y) tagassociativity\
&= X(Z + Y) tagabsorption\
&= X(Y + Z). tagcommutativity
endalign
Notice you still have to pick the right law (there is a pair of each), except for the distributivity, in which case we're using here the one there we're not proving.







share|cite|improve this answer












share|cite|improve this answer



share|cite|improve this answer










answered Sep 11 at 13:39









amrsa

3,3532518




3,3532518











  • I'm confused on the very first step, how did you use the OR distributive law to make XY + XZ = (XY + X) (XY + Z ), maybe I just can't see it, but it looks as if you used the AND law of distributivity
    – Jakemathbad
    Sep 11 at 20:17










  • @Jakemathbad Make $W=XY$, and use $W+XZ=(W+X)(W+Z)$.
    – amrsa
    Sep 11 at 20:34
















  • I'm confused on the very first step, how did you use the OR distributive law to make XY + XZ = (XY + X) (XY + Z ), maybe I just can't see it, but it looks as if you used the AND law of distributivity
    – Jakemathbad
    Sep 11 at 20:17










  • @Jakemathbad Make $W=XY$, and use $W+XZ=(W+X)(W+Z)$.
    – amrsa
    Sep 11 at 20:34















I'm confused on the very first step, how did you use the OR distributive law to make XY + XZ = (XY + X) (XY + Z ), maybe I just can't see it, but it looks as if you used the AND law of distributivity
– Jakemathbad
Sep 11 at 20:17




I'm confused on the very first step, how did you use the OR distributive law to make XY + XZ = (XY + X) (XY + Z ), maybe I just can't see it, but it looks as if you used the AND law of distributivity
– Jakemathbad
Sep 11 at 20:17












@Jakemathbad Make $W=XY$, and use $W+XZ=(W+X)(W+Z)$.
– amrsa
Sep 11 at 20:34




@Jakemathbad Make $W=XY$, and use $W+XZ=(W+X)(W+Z)$.
– amrsa
Sep 11 at 20:34

















 

draft saved


draft discarded















































 


draft saved


draft discarded














StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2912380%2fproving-and-distributive-law-using-boolean-algebra%23new-answer', 'question_page');

);

Post as a guest













































































這個網誌中的熱門文章

Why am i infinitely getting the same tweet with the Twitter Search API?

Is there any way to eliminate the singular point to solve this integral by hand or by approximations?

Strongly p-embedded subgroups and p-Sylow subgroups.