FazBrowse Wikipedia Viewer | Main Page |
Search Wikipedia:
|
Viewing: https://en.wikipedia.org/wiki/Injective_function

Injective function

Contents
Proving that functions are injective
Gallery
See also
Notes
External links

In mathematics, an injective function (also known as injection, or one-to-one function) is a function f(x1) ≠ f(x2) (equivalently by contraposition, 1</sub>) {{=}} ''f''(''x''<sub>2</sub>)"}},"i":0}}]}'/>f(x1) = f(x2) implies 1</sub> = ''x''<sub>2</sub>"}},"i":0}}]}'/>x1 = x2). In other words, every element of the function's codomain is the image of one-to-one correspondence that refers to bijective functions, which are functions such that each element in the codomain is an image of exactly one element in the domain.

A homomorphism between algebraic structures is a function that is compatible with the operations of the structures. For all common algebraic structures, and, in particular for vector spaces, an f that is not injective is sometimes called many-to-one.

⁠a and ⁠a=b⁠
; that is, a=b⁠. Equivalently, if f(a)≠f(b) in the contrapositive statement.

Symbolically,f:A↣B or X and any subset S→X (which sends any element f:ℝ→ℝ defined by g(x)=x2 is g is redefined so that its domain is the non-negative real numbers exp⁡:ℝ→ℝ defined by x↦ln⁡x is injective.

  • The function ⁠Y are both the real line f:ℝ→ℝ is one whose graph is never intersected by any horizontal line more than once. This principle is referred to as the f:X→Y⁠, if there is a function x∈X⁠, f is injective. The proof is that ⁠⁠⁠g. It can be defined by choosing an element g(y) to the unique element of the pre-image g is not necessarily an inverse of f∘g⁠, may differ from the identity on f:X→Y into a bijective (hence invertible) function, it suffices to replace its codomain g:X→J such that x∈X⁠; then ⁠J into f and g∘f is injective, then f:X→Y is injective if and only if, given any functions h:W→X whenever ⁠A is a subset of ⁠⁠A and X⁠, then h:W→Y can be decomposed as ⁠h(W) of ⁠Y has at least as many elements as Y⁠ to X and Y are finite with the same number of elements, then f is bijective).
  • An injective function which is a homomorphism between two algebraic structures is an embedding.
  • Unlike surjectivity, which is a relation between the graph of a function and its codomain, injectivity is a property of the graph of the function alone; that is, whether a function f⁠.
  • Proving that functions are injective

    edit

    A proof that a function f(x)=f(y)⁠, then f(x)=2x+3

    Proof: Let ⁠⁠x=y⁠. Therefore, it follows from the definition that f is a linear transformation it is sufficient to show that the kernel of f of a real variable f is injective or one-to-one.

    Gallery

    edit
        X1 and Y2 are subsets of ⁠X to map to the same Making functions injective. The previous function can be reduced to one or more injective functions (say) and ⁠⁠, shown by solid curves (long-dash parts of initial curve are not mapped to anymore). Notice how the rule has not changed – only the domain and range. and are subsets of and are subsets of ⁠⁠: for two regions where the initial function can be made injective so that one domain element can map to a single range element. That is, only one in maps to one in ⁠⁠.
      Making functions injective. The previous function f:X2→Y2⁠, shown by solid curves (long-dash parts of initial curve are not mapped to anymore). Notice how the rule X2 are subsets of Y⁠: for two regions where the initial function can be made injective so that one domain element can map to a single range element. That is, only one y in ⁠f:X→Y⁠, where ⁠Y= range of function, and x in Y⁠. The circled parts of the axes represent domain and range sets — in accordance with the standard diagrams above

    See also

    edit

    Notes

    edit
    1. ↑ Sometimes one-one function in Indian mathematical education. "Chapter 1: Relations and functions" (PDF). Archived (PDF) from the original on December 26, 2023 – via NCERT.
    2. 1 2 3 Farlow, S. J. "Section 4.2 Injections, Surjections, and Bijections" (PDF). Mathematics & Statistics - University of Maine. Archived from the original (PDF) on Dec 7, 2019. Retrieved 2019-12-06.
    3. ↑ {0,1}→ℝ of the two-element set in the reals cannot have a left inverse, as it would violate indecomposability, by giving a retraction of the real line to the set {0,1}.
    4. ↑ Halmos, Paul R. (1974), Naive Set Theory, New York: Springer, ISBN 978-0-387-90092-6, p. 38 ff.
    5. External links

      edit
      Wikimedia Commons has media related to Injectivity.
    Look up injective in Wiktionary, the free dictionary.
    Mathematical logic
    General
    Theorems
    (list),
    paradoxes
    Logics
    Traditional
    Propositional
    Predicate
    Set theory
    Types
    of sets
    Maps,
    cardinality
    Theories
    Formal
    systems

    (list),
    language,
    syntax
    Example
    axiomatic
    systems

    (list)
    Proof theory
    Model theory
    Computability
    theory
    Related
    Mathematicsportal

    View original on Wikipedia | Back | FazBrowse Home