ArticleslgStudy

mathematics

Zhegalkin algebra

Zhegalkin algebra is a mathematics topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand Zhegalkin algebra rather than just read about it. In short: In mathematics, Zhegalkin algebra is a set of Boolean functions defined by the nullary operation taking the value 1 {\displaystyle 1} , use of the binary operation of conjunction ∧ {\displaystyle \land } , and use of the binary sum operation for modulo 2 ⊕ {\displaystyle \oplus } . The constant 0 {\displaystyle 0} is introduced as 1 ⊕ 1 = 0 {\displaystyle 1\oplus 1=0} .

Key takeaways

  • Zhegalkin algebra belongs to mathematics; place it in that map before memorising details.
  • Learn the definition first, then one example that makes the definition concrete.
  • Connect Zhegalkin algebra to a quantity you can measure, compute or draw — that is where exam questions come from.
  • Reproduce the core statement of Zhegalkin algebra from memory before moving on to harder problems.

Reference excerpt

In mathematics, Zhegalkin algebra is a set of Boolean functions defined by the nullary operation taking the value 1 {\displaystyle 1} , use of the binary operation of conjunction ∧ {\displaystyle \land } , and use of the binary sum operation for modulo 2 ⊕ {\displaystyle \oplus } . The constant 0 {\displaystyle 0} is introduced as 1 ⊕ 1 = 0 {\displaystyle 1\oplus 1=0} . The negation operation is introduced by the relation ¬ x = x ⊕ 1 {\displaystyle \neg x=x\oplus 1} . The disjunction operation follows from the identity x ∨ y = x ∧ y ⊕ x ⊕ y {\displaystyle x\lor y=x\land y\oplus x\oplus y} . Using Zhegalkin Algebra, any perfect disjunctive normal form can be uniquely converted into a Zhegalkin polynomial (via the Zhegalkin Theorem).

Basic identities

x ∧ ( y ∧ z ) = ( x ∧ y ) ∧ z {\displaystyle x\land (y\land z)=(x\land y)\land z} , x ∧ y = y ∧ x {\displaystyle x\land y=y\land x}

x ⊕ ( y ⊕ z ) = ( x ⊕ y ) ⊕ z {\displaystyle x\oplus (y\oplus z)=(x\oplus y)\oplus z} , x ⊕ y = y ⊕ x {\displaystyle x\oplus y=y\oplus x}

x ⊕ x = 0 {\displaystyle x\oplus x=0}

x ⊕ 0 = x {\displaystyle x\oplus 0=x}

x ∧ ( y ⊕ z ) = x ∧ y ⊕ x ∧ z {\displaystyle x\land (y\oplus z)=x\land y\oplus x\land z}

Thus, the basis of Boolean functions ⟨ ∧ , ⊕ , 1 ⟩ {\displaystyle {\bigl \langle }\wedge ,\oplus ,1{\bigr \rangle }} is functionally complete. Its inverse logical basis ⟨ ∨ , ⊙ , 0 ⟩ {\displaystyle {\bigl \langle }\lor ,\odot ,0{\bigr \rangle }} is also functionally complete, where ⊙ {\displaystyle \odot } is the inverse of the XOR operation (via equivalence). For the inverse basis, the identities are inverse as well: 0 ⊙ 0 = 1 {\displaystyle 0\odot 0=1} is the output of a constant, ¬ x = x ⊙ 0 {\displaystyle \neg x=x\odot 0} is the output of the negation operation, and x ∧ y = x ∨ y ⊙ x ⊙ y {\displaystyle x\land y=x\lor y\odot x\odot y} is the conjunction operation. The functional completeness of the two bases follows from completeness of the basis { ¬ , ∧ , ∨ } {\displaystyle \{\neg ,\land ,\lor \}} .

See also Zhegalkin polynomial

Notes

References Zhegalkin, Ivan Ivanovich (1927). "On the technique of calculating propositions in symbolic logic" (PDF). Matematicheskii Sbornik. 34 (1): 9–28. Retrieved 12 January 2024. "Zhegalkin algebra", Encyclopedia of Mathematics, EMS Press, 2001 [1994]

Worked examples

Example 1 — a first encounter with Zhegalkin algebra

Start with the simplest possible case. Write down what Zhegalkin algebra claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In mathematics, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Zhegalkin algebra before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Zhegalkin algebra ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Zhegalkin algebra

In research
Zhegalkin algebra appears in mathematics research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry
Engineering practice reuses Zhegalkin algebra in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom
Zhegalkin algebra is common in secondary-school and first-year university syllabi. It links to neighbouring topics Boolean algebra, so understanding it makes those chapters shorter.
In everyday life
Look for Zhegalkin algebra outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.
Ask Teacher Smith questions about this articleOpens your AI tutor with a question about “Zhegalkin algebra” →

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study Zhegalkin algebra in 20 minutes

  1. Read the reference excerpt below once, without taking notes.
  2. Close the page and write down what Zhegalkin algebra means in your own words.
  3. Compare your version with the excerpt and mark what you missed.
  4. Work through the three examples above with pen and paper.
  5. Explain Zhegalkin algebra out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Zhegalkin algebra in simple terms?

In mathematics, Zhegalkin algebra is a set of Boolean functions defined by the nullary operation taking the value 1 {\displaystyle 1} , use of the binary operation of conjunction ∧ {\displaystyle \land } , and use of the binary sum operation for modulo 2 ⊕ {\displaystyle \oplus } . The constant 0 {…

Why does Zhegalkin algebra matter?

Because it connects several mathematics ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Zhegalkin algebra?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Zhegalkin algebra.

Tags

  • Boolean algebra

Keep exploring