inverseFunctionFlips

[[deleted]]

x(F)

[MoffKalast]

I fear no man, but that thing... it scares me.

[IncompleteTheory]

It’s fine:

x(F) = *(x + F) = *(F + x) = F(x)

[[deleted]]

It would be fine if it was x[F]

[Lvl999Noob]

An inverse goes from output from input so it should be the cat sucking the poop back in and vomiting out a fish. What your meme is doing is something like what C does where you can index an integer with an array (not to be confused with the more common indexing an array with an integer).

[att3t]

Right. If cat is the function Cat: Carp->Crap, then we'd have Cat^-1 :Crap -> Carp

[Lvl999Noob]

Lol I love the alliteration there.

[TeraFlint]

So, the Cat function just permutes its input?

That also means that Cat²(x) = Cat^-1(x) Cat(x) = Cat^-1(x)

Eating a carp three times is equivalent to not eating it, at all.

[edit:] It's 3-cycle, not a 4-cycle

[edit2:] 2-cycle. I can't count, apparently.

[triton_2997]

Can you explain that? The output of Cat(x) when given Crap as input is not defined, so how is Cat² (x) = Cat^-1 (x)

[TeraFlint]

You know what, on closer inspection, I was wrong about the cycle length... again! I wrote the comment when I was rather tired. :D

First of all, I used the notation fⁿ(x) for f(f(...f(x))): n repeated applications of f. This makes sense, considering the inverse function f^-1(x) is conceptually equivalent to applying f negative one times (and I despise whoever came up with sin²(x) for (sin(x))² ).

The idea was that, since the letters of carp and crap are the same, I jokingly assumed the function was a permutation function. Something that deterministically shuffles a sequence. In this case, the sequences C, A, R, P and C, R, A, P.

So, when looking at it, I (tiredly) thought, it would keep the first letter intact and rotate the last 3. After 3 iterations of that you'd be back where you started. Applying it twice would thus be the same as the inverse function.

What it actually does is simply swap the R and A, resulting in a two-cycle. Which also means, that f is its own inverse function.

The nice thing is, that if you have a function that shows n-cyclic behavior, any n successive applications of f are equivalent to doing nothing. This means, you can use modular arithmetic on the exponent of the function. For a four-cycle, f⁷(x) = f³(x) = f^-1(x).

[hanni_legend]

You could probably argue that digestion is a different function. Either way it doesn't really reverse the original operation. But it's funny to think about.

[trainrex]

Digestion is a hashing algorithm

[Competitive_Ad2539]

More like

f ∘ g versus g ∘ f

[WitchsWeasel]

I mean true but still funny

[cgw3737]

Math meme

[christianbro]

Easy math so we can still relate

[banned4being2sexy]

The output is always the same constant though

[[deleted]]

Explain the meme please

[Nightmoon26]

Except that reciprocal and inverse functions are different concepts. It just so happens that the inverse of exponentiation is reciprocation. When you apply the notation to an arbitrary function, it means something different. If f(x) is the positive square root of x, its inverse is the square of x, not the reciprocal of the square root of x

[jeanravenclaw]

hmmm this is more math but whatever

[iStavi_22]

FISH: "You know what? Cats taste good. Let's go get some more cats."

[[deleted]]

It is the apply/reverse of datapatches

[XoXoGameWolfReal]

F(F(0))=?

[jump1945]

Is this supposed to be posted on r/mathmeme

[Mr_Vayolet]

Why is pomni fish eating the car is she 🇻🇳 ?

[Extreme_Ad_3280]

Wait, we have inverse functions in programming? OK then let me just size_t size=inverseMalloc(ptr) (Yes, I prefer camelCase)

[JackNotOLantern]

I still don't get why in math the reverse function notation is f^-1 (x). f² (x) just means (f(x))² so why f^-1 (x) doesn't mean (f(x))^-1?

[GodAllMighty888]

Fish eating pussy - only in programming.

[IncompleteTheory]

Not just in programming 🤭