About the Book
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Pages: 74. Chapters: Bijection, Equivalence relation, Surjective function, Well-order, Total order, Equivalence class, Binary relation, Idempotence, Partial function, Congruence relation, Finitary relation, Directed set, Antisymmetric relation, Preorder, Partially ordered set, Relation algebra, Relation reduction, Series-parallel partial order, Semiorder, Bijection, injection and surjection, Strict weak ordering, Unimodality, Well-quasi-ordering, Multivalued function, Representation, Well-founded relation, Transitive closure, Intransitivity, Contour set, Exceptional isomorphism, Allegory, Transitive relation, Separoid, Prewellordering, Composition of relations, Inverse relation, Partial equivalence relation, Reflexive relation, Covering relation, Dependence relation, Comparability, Cyclic order, Ternary relation, Ancestral relation, Dependency relation, Total relation, Bidirectional transformation, Propositional function, Trichotomy, Asymmetric relation, Cointerpretability, Quasitransitive relation, Symmetric closure, Euclidean relation, Coreflexive relation, Demonic composition, Relation construction, Reflexive closure, Dense order, Tolerance relation, Dense relation, Involutive relation. Excerpt: A function, in mathematics, associates one quantity, the argument of the function, also known as the input, with another quantity, the value of the function, also known as the output. A function assigns exactly one output to each input. The argument and the value may be real numbers, but they can also be elements from any given set. An example of a function is f(x) = 2x, a function which associates with every number the number twice as large. Thus 5 is associated with 10, and this is written f(5) = 10. The input to a function need not be a number, it can be any well defined object. For example, a function might associate the letter A with the...
