Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Binary relation
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
=== Matrix representation === Binary relations over sets <math>X</math> and <math>Y</math> can be represented algebraically by [[Logical matrix|logical matrices]] indexed by <math>X</math> and <math>Y</math> with entries in the [[Boolean semiring]] (addition corresponds to OR and multiplication to AND) where [[matrix addition]] corresponds to union of relations, [[matrix multiplication]] corresponds to composition of relations (of a relation over <math>X</math> and <math>Y</math> and a relation over <math>Y</math> and <math>Z</math>),<ref>{{cite newsgroup |title=quantum mechanics over a commutative rig |author=John C. Baez |author-link=John C. Baez |date=6 Nov 2001 |newsgroup=sci.physics.research |message-id=9s87n0$iv5@gap.cco.caltech.edu |url=https://groups.google.com/d/msg/sci.physics.research/VJNPMCfreao/TMKt9tFYNwEJ |access-date=November 25, 2018}}</ref> the [[Hadamard product (matrices)|Hadamard product]] corresponds to intersection of relations, the [[zero matrix]] corresponds to the empty relation, and the [[matrix of ones]] corresponds to the universal relation. Homogeneous relations (when <math>X = Y</math>) form a [[matrix semiring]] (indeed, a [[matrix semialgebra]] over the Boolean semiring) where the [[identity matrix]] corresponds to the identity relation.<ref name="droste">Droste, M., & Kuich, W. (2009). Semirings and Formal Power Series. ''Handbook of Weighted Automata'', 3β28. {{doi|10.1007/978-3-642-01492-5_1}}, pp. 7-10</ref>
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)