Algebraic normal form

From Wikiversity
Jump to navigation Jump to search
Studies of Boolean functions
ANF   matrix   twins
noble   gentle
smallest Zhegalkin index
Variadic XOR (left) and AND (right)
From ANF to truth table
From truth table to ANF

The algebraic normal form (ANF) is a canonical normal form of a Boolean function.

It is a XOR formula of AND formulas, like this:

Here it shall be abbreviated like this:

Both operators are variadic, i.e. they can have any number of arguments, including none or one.
XOR without arguments is false (empty sum 0). AND without arguments is true (empty product 1).

The empty XOR is false:

XOR containing empty AND is true:

XOR containing unary AND is an atomic statement:

The presence of empty AND works as a negator:

So the negation of the introductory example is this:

Each AND formula corresponds to a set of integers, which can be interpreted as a binary number.
Thus each XOR formula also corresponds to a set of integers, which can also be interpreted as a binary number.

empty sum 0

In short, there is a bijection between the non-negative integers and algebraic normal forms.
While the truth tables for a given arity can be interpreted as integers, truth tables in general can only be assigned rational values between 0 and 1.
The ANF allows to assign every Boolean function (regardless of its arity) a unique integer, which shall be called its Zhegalkin index.

It has the interesting property, that its parity corresponds to the just mentioned fraction:
Boolean functions with an even (odd) Zhegalkin index have a rational value below (above) .
Here is a list of examples: v:Studies of Euler diagrams/list

The Zhegalkin indices of Boolean functions in the same permutation equivalence class have the same binary weight.

For a specific arity each Boolean function can be interpreted as an integer.
So the map from integers to Boolean functions becomes a map from integers to integers, which is the Zhegalkin permutation.

See also: Zhegalkin matrix