Difference between revisions of "Commutator and De Morgan's laws"
(Created page with "Commutator in quantum mechanics behaves very similarly to Demorgan's Law. This can be found from the video<ref>{{:Video/Ch 10: What's the commutator and the uncertainty principle?}}</ref> by Quantum Sense. <noinclude> {{PagePosftix |category_csd=Quantum Mechanics,Boolean Logic,Demorgan's Law,Commutator,Symmetry }} </noinclude>") |
|||
| (10 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
Commutator in [[quantum mechanics]] behaves very similarly to [[ | [[Commutator]] in [[quantum mechanics]] behaves very similarly to [[De Morgan's laws]]. This can be found from the video<ref>{{:Video/Ch 10: What's the commutator and the uncertainty principle?}}</ref> by [[Brandon Sandoval]]. | ||
<noinclude> | <noinclude> | ||
{{ | =How does commutator relate to De Morgan's law in boolean algebra?= | ||
|category_csd=Quantum Mechanics,Boolean Logic,Demorgan's Law,Commutator,Symmetry | {{:How does commutator relate to De Morgan's law in boolean algebra?}} | ||
{{PagePostfix | |||
|category_csd=Quantum Mechanics,Boolean Logic,Demorgan's Law,Commutator,Symmetry,Observable,De Morgan's laws | |||
}} | }} | ||
</noinclude> | </noinclude> | ||
Latest revision as of 02:10, 2 February 2023
Commutator in quantum mechanics behaves very similarly to De Morgan's laws. This can be found from the video[1] by Brandon Sandoval.
How does commutator relate to De Morgan's law in boolean algebra?
In boolean algebra, De Morgan's law states that the negation of a conjunction (AND) of two propositions is equal to the disjunction (OR) of their negations, and vice versa. The two De Morgan's laws can be written as:
~(A & B) = ~A v ~B
~(A v B) = ~A & ~B
The term "commutator" is often used to describe operations that commute, meaning that their order does not affect the result. In boolean algebra, the De Morgan's laws show that negation and conjunction (or disjunction) commute, in the sense that negating the result of a conjunction (or disjunction) is equivalent to first negating the individual terms and then computing the conjunction (or disjunction).
In this sense, the De Morgan's laws are related to the idea of commutativity, as they show that negation and conjunction (or disjunction) can be performed in either order and still produce the same result. The De Morgan's laws are important laws of boolean algebra and are widely used in computer science, logic, and mathematics.
— ChatGPT
References
- ↑ Sandoval, Brandon (Jan 24, 2023). Quantum Sense, ed. Ch 10: What's the commutator and the uncertainty principle?. local page: Quantum Sense.
Related Pages