imported>Christian75: Adding short description: "Boolean function which has monotonic properties"

2025-04-28T13:58:36Z

Adding short description: "Boolean function which has monotonic properties"

New page

{{Short description|Boolean function which has monotonic properties}}
A '''unate function''' is a type of [[boolean function]] which has [[monotonic]] properties.
They have been studied extensively in [[switching theory]].

A function <math>f(x_1,x_2,\ldots,x_n)</math> is said to be '''positive unate''' in <math>x_i</math>
if for all possible values of <math>x_j</math>, <math>j\neq i</math>
:<math>f(x_1,x_2,\ldots,x_{i-1},1,x_{i+1},\ldots,x_n) \ge f(x_1,x_2,\ldots,x_{i-1},0,x_{i+1},\ldots,x_n).\,</math>
Likewise, it is '''negative unate''' in <math>x_i</math> if
:<math>f(x_1,x_2,\ldots,x_{i-1},0,x_{i+1},\ldots,x_n) \ge f(x_1,x_2,\ldots,x_{i-1},1,x_{i+1},\ldots,x_n).\,</math>
If for every <math>x_i</math> ''f'' is either positive or negative unate in the variable <math>x_i</math> then it is said to be '''unate''' (note that some <math>x_i</math> may be positive unate and some negative unate to satisfy the definition of unate function). A function is '''binate''' if it is not unate (i.e., is neither positive unate nor negative unate in at least one of its variables).

For example, the [[logical disjunction]] function ''or'' with boolean values used for true (1) and false (0) is positive unate. Conversely, [[Exclusive or]] is non-unate, because the transition from 0 to 1 on input x0 is both positive unate and negative unate, depending on the input value on x1.

Positive unateness can also be considered as passing the same slope (no change in the input) and negative unate is passing the opposite slope....
non unate is dependence on more than one input (of same or different slopes)

[[Category:Boolean algebra]]

Unate function - Revision history

imported>Christian75: Adding short description: "Boolean function which has monotonic properties"