Math 2.0

definition

Boolean ring

Definition

A Boolean ring is a ring RR with identity such that x2=xx^2 = x for every x∈Rx \in R.

Remarks

In a Boolean ring, x+x=0x + x = 0 for every xx, and the ring is commutative. The ring Z/2Z\mathbb{Z}/2\mathbb{Z} is a Boolean ring. The power set of a set is a Boolean ring, with symmetric difference as addition and intersection as multiplication. Each Boolean ring is a Boolean algebra with x∧y=xyx \wedge y = xy, x∨y=x+y+xyx \vee y = x + y + xy and ¬x=1+x\neg x = 1 + x. This gives a correspondence between Boolean rings and Boolean algebras.

Explanations

L1 human

A Boolean ring is a ring in which squaring changes nothing. It is the same thing as a Boolean algebra, written with plus and times instead of or and and.

What this node needs for W2
  • edge instance_of in: one example (0 of 1)
  • edge not_instance_of in: one non-example that fails one clause (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

Sources

  1. Web https://en.wikipedia.org/wiki/Boolean_ring, lead section