# Algebraic normal form

Template:Mergefrom Template:Mergefrom In Boolean algebra, the algebraic normal form (ANF), Zhegalkin normal form, or Reed–Muller expansion is a way of writing logical formulas in one of three subforms:

Formulas written in ANF are also known as Zhegalkin polynomials (Russian: полиномы Жегалкина{{#invoke:Category handler|main}}) and Positive Polarity (or Parity) Reed–Muller expressions.

## Common uses

ANF is a normal form, which means that two equivalent formulas will convert to the same ANF, easily showing whether two formulas are equivalent for automated theorem proving. Unlike other normal forms, it can be represented as a simple list of lists of variable names. Conjunctive and disjunctive normal forms also require recording whether each variable is negated or not. Negation normal form is unsuitable for that purpose, since it doesn't use equality as its equivalence relation: a ∨ ¬a isn't reduced to the same thing as 1, even though they're equal.

Putting a formula into ANF also makes it easy to identify linear functions (used, for example, in linear feedback shift registers): a linear function is one that is a sum of single literals. Properties of nonlinear feedback shift registers can also be deduced from certain properties of the feedback function in ANF.

## Performing operations within algebraic normal form

There are straightforward ways to perform the standard boolean operations on ANF inputs in order to get ANF results.

XOR (logical exclusive disjunction) is performed directly:

(Template:Fontcolor) ⊕ (Template:Fontcolor)
Template:FontcolorTemplate:Fontcolor
1 ⊕ 1 ⊕ x ⊕ x ⊕ y
y

NOT (logical negation) is XORing 1:[1]

Template:FontcolorTemplate:Fontcolor
Template:FontcolorTemplate:Fontcolor
1 ⊕ 1 ⊕ x ⊕ y
x ⊕ y

AND (logical conjunction) is distributed algebraically[2]

(Template:FontcolorTemplate:Fontcolor)Template:Fontcolor
Template:FontcolorTemplate:FontcolorTemplate:FontcolorTemplate:Fontcolor
(1 ⊕ x ⊕ y) ⊕ (x ⊕ x ⊕ xy)
1 ⊕ x ⊕ x ⊕ x ⊕ y ⊕ xy
1 ⊕ x ⊕ y ⊕ xy

OR (logical disjunction) uses either 1 ⊕ (1 ⊕ a)(1 ⊕ b)[3] (easier when both operands have purely true terms) or a ⊕ b ⊕ ab[4] (easier otherwise):

(Template:Fontcolor) + (Template:Fontcolor)
1 ⊕ (1 ⊕ Template:Fontcolor)(1 ⊕ Template:Fontcolor)
1 ⊕ x(x ⊕ y)
1 ⊕ x ⊕ xy

## Converting to algebraic normal form

Each variable in a formula is already in pure ANF, so you only need to perform the formula's boolean operations as shown above to get the entire formula into ANF. For example:

x + (y · ¬z)
x + (y(1 ⊕ z))
x + (y ⊕ yz)
x ⊕ (y ⊕ yz) ⊕ x(y ⊕ yz)
x ⊕ y ⊕ xy ⊕ yz ⊕ xyz

## Formal representation

ANF is sometimes described in an equivalent way:

where ${\displaystyle a_{0},a_{1},\ldots ,a_{1,2,\ldots ,n}\in \{0,1\}^{*}}$ fully describes ${\displaystyle f}$.

### Recursively deriving multiargument Boolean functions

There are only four functions with one argument:

To represent a function with multiple arguments one can use the following equality:

${\displaystyle f(x_{1},x_{2},\ldots ,x_{n})=g(x_{2},\ldots ,x_{n})\oplus x_{1}h(x_{2},\ldots ,x_{n})}$, where

Indeed,

Since both ${\displaystyle g}$ and ${\displaystyle h}$ have fewer arguments than ${\displaystyle f}$ it follows that using this process recursively we will finish with functions with one variable. For example, let us construct ANF of ${\displaystyle f(x,y)=x\lor y}$ (logical or):

{{ safesubst:#invoke:Unsubst||$N=Refimprove |date=__DATE__ |$B= {{#invoke:Message box|ambox}} }}