Ruka hadi maudhui
The Lumenary
Darasa la 6–8Category TheoryImepangwa

Function machines in sequence

Feeding the output of one function into another, the identity function that returns its input unchanged, inverse functions that undo, and tables and arrow diagrams for chained functions.

math.cat.chaining-functions

Onyesha kila kinachohitajika kufikia mada hii

Somo la mada hii bado halijaandikwa. Muhtasari ulio hapa chini ni sehemu ya ramani ya mtaala na haujakaguliwa.

Inajengwa juu ya

FunctionsOne thing after another

Masharti ya awali ya lazima 9 (hadi chini kabisa)

Utajifunza

  • Compute the result of applying one function and then another, using tables, arrow diagrams and formulas.
  • Recognise the identity function on a set and explain why chaining it with any function changes nothing.
  • Find inverses of simple bijections, such as x ↦ x + 3 or x ↦ 2x on ℚ, and check that they undo the original.

Fasili

  • Applying f : A → B and then g : B → C sends each a in A to g(f(a)) in C.
  • The identity function on A sends each element of A to itself.
  • A function g undoes f if g(f(a)) = a for every a in the domain of f.

Nadharia

  • Chaining is possible only when every output of the first function is an allowed input of the second.
  • Chaining with an identity function, before or after, gives back the original function.
  • If f and g can both be undone, then 'f, then g' is undone by 'undo g, then undo f'.

Mawazo potofu ya kawaida

  • Writing the chain 'first f, then g' as f(g(x)).
  • Thinking every function can be undone; x ↦ x² on ℤ cannot.
  • Ignoring whether the outputs of the first function lie in the domain of the second.

Inaelekea kwa

Diagrams where paths agree

Ugunduzi wa hiari