Shannon's expansion
Shannon's expansion is a theorem in Boolean algebra. It came out in 1949. It was created by Claude Shannon and George Boole.
- Came out
- 1949
- Created by
- Claude Shannon
All 5 facts, and where they come from
Facts
5 facts · 0 confirmed by two sources · 0 cited · 4 from one source · 1 where the sources disagree
What’s different
- Came out: we show 1949 (Sources disagree). Wikidata also lists 1854
Where this comes from
Papalocal keeps its own record. It started from these sources; what each one said is kept here as it was copied, so a change on their side never changes this page by itself. Tap one to read its version.
What Wikidata says · copied November 16, 2026 · revision 2466245671
- Described as
- theorem in Boolean algebra
- Other names
- Boole's expansion theorem, decomposition
- What it is
- theorem
- Created by
- Claude Shannon; George Boole
- Came out
- 1949; 1854
- Named after
- Claude Shannon
- Wikipedias with a page
- 6
Wikidata item Q2277040 (wikidata.org/wiki/Q2277040), public domain (CC0). Copied 2026-11-16.
What Wikipedia says · copied November 16, 2026 · revision 1371703287
Boole's expansion theorem, often referred to as the Shannon expansion or Shannon decomposition, is the identity F=x⋅Fx+x′⋅Fx′, where F is any Boolean function, x is a variable, x′ is the complement of x, and Fxand Fx′ are F with the argument x set equal to 1 and to 0 respectively.
The terms Fx and Fx′ are sometimes called the positive and negative Shannon cofactors, respectively, of F with respect to x. These are functions, computed by the restrict operator, restrict(F,x,0) and restrict(F,x,1). (See also valuation and partial application.)
The theorem has been called the "fundamental theorem of Boolean algebra". Besides its theoretical importance, it paved the way for binary decision diagrams (BDDs), satisfiability solvers, and many other techniques relevant to computer engineering and formal verification of digital circuits.
In such contexts, particularly in BDDs, the expansion is interpreted as an if-then-else, with the variable x being the condition and the cofactors being the branches (Fx when x is true and respectively Fx′ when x is false).
From the Wikipedia article “Boole's expansion theorem” (en.wikipedia.org/wiki/Boole's_expansion_theorem), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-16; not changed.
Confirmed Two sources agree. Cited One source, and it names where it got it. One source One source, without a reference of its own. Sources disagree The sources disagree. We show the best-supported value and keep theirs below.
