Order preserving
function and
isomorphisms
Functions:
A function is an equation for which any x
that can be plugged into the equation
will yield exactly one y out of the
equation.
function:
is made up of 2 sets: the domain and the codomain,
as well as rule that translates each domain element
to exactly on codomain element.
Domain Codomain Range
The set of all possible inputs for the The set of all possible outputs for the The set of all actual outputs for the
function. function. function.
Steps of solving a
function
Let's go through the steps with the help of an example:
f(x) = 3x - 1
Solve for f(x) = 8
Step 1
Substitute the value of f(x) into the problem. In this case:
8 = 3x - 1
Step 2
Isolate the variable. In this case, you add 1 to both sides to isolate the variable term by using the opposite operation to
move the constant term across the equal sign. So, therefore:
8 + 1 = 3x - 1 + 1
9 = 3x
Step 3
Continue to isolate the variable. In this case, you divide by 3 on both sides to isolate the variable itself. So therefore:
9 / 3 = 3x / 3
Step 4
Simplify. So we get:
x=3
Because this is a linear function, it's appropriate to format the final answer in function form.
For the function f(x) = 3x - 1, f(3) = 8.
Given:
f(x)= 3x-1
f(x)=5
Solution:
5=3x-1
Let's 5+1=3x-1+1
Solve 6=3x
Together 6/3= 3x/3
2=x
f(2)=5
What is isomorphism?
In the mathematical field of order theory, an
order isomorphism is a special kind of monotone
function that constitutes a suitable notion of
isomorphism for partially ordered sets (posets).
Whenever two posets are order isomorphic, they
can be considered to be "essentially the same" in
the sense that either of the orders can be
obtained from the other just by renaming of
elements. Two strictly weaker notions that relate
to order isomorphisms are order embeddings
and Galois connections.
For More information kindly
watch this video
Boolean Algebra
What is Boolean Algebra:
Boolean algebra is a division of mathematics that deals with
operations on logical values and incorporates binary variables.
Boolean algebra traces its origins to an 1854 book by
mathematician George Boole.
The distinguishing factor of Boolean algebra is that it deals only
with the study of binary variables. Most commonly Boolean
variables are presented with the possible values of 1 ("true") or 0
("false"). Variables can also have more complex interpretations,
such as in set theory. Boolean algebra is also known as binary
algebra.
George Boole (1815–1864)
Was an English mathematician and a
founder of the algebraic tradition in
logic. He worked as a schoolmaster in
England and from 1849 until his death
as professor of mathematics at
Queen’s University, Cork, Ireland. He
revolutionized logic by applying
methods from the then-emerging field
of symbolic algebra to logic.
Boolean Algebra Operations
The basic operations of Boolean algebra are as follows:
Conjunction or AND operation
Disjunction or OR operation
Negation or Not operation
Laws for Boolean Algebra
A set of rules or Laws of Boolean Algebra expressions have been invented to
help reduce the number of logic gates needed to perform a particular logic
operation resulting in a list of functions or theorems known commonly as the
Laws of Boolean Algebra.
Boolean Algebra Terminologies
Boolean Algebra: Boolean algebra is the branch of algebra that deals with logical operations and
binary variables.
Boolean Variables: A boolean variable is defined as a variable or a symbol defined as a variable or a
symbol, generally an alphabet that represents the logical quantities such as 0 or 1.
Boolean Function: A boolean function consists of binary variables, logical operators, constants such
as 0 and 1, equal to the operator, and the parenthesis symbols.
Literal: A literal may be a variable or a complement of a variable.
Complement: The complement is defined as the inverse of a variable, which is represented by a bar
over the variable.
Truth Table: The truth table is a table that gives all the possible values of logical variables and the
combination of the variables. It is possible to convert the boolean equation into a truth table. The
number of rows in the truth table should be equal to 2n, where “n” is the number of variables in the
equation. For example, if a boolean equation consists of 3 variables, then the number of rows in the
truth table is 8. (i.e.,) 23 = 8.
Truth table
For More information kindly
watch this video
For More information kindly
watch this video
References
https://youtu.be/BAmWgVjSosY
https://www.investopedia.com/terms/b/boolean-
algebra.asp#:~:text=Boolean%20algebra%20is%20a%20division,the%20study%
20of%20binary%20variables.
https://en.wikipedia.org/wiki/Group_isomorphism#:~:text=In%20abstract%20
algebra%2C%20a%20group,the%20groups%20are%20called%20isomorphic.
https://study.com/academy/lesson/how-to-solve-linear-functions.html
https://plato.stanford.edu/entries/boole
https://byjus.com/maths/boolean-algebra/
https://youtu.be/EPJf4owqwdA
https://youtu.be/kh1jlQD252
