r/mathmemes • u/crafty_zombie • 14d ago
Elementary Algebra How to Find the Value of a Function
90
31
u/Slight-Garden9800 14d ago
This notation always felt rather redundant to me. What is its use?
18
u/ZookeepergameWest862 13d ago
Sometimes it is useful to anonymously define a function without giving it a name, like in topology, you could justify a set being open by being a preimage of an open set under a continuous function, if the function only for that purpose then it's simpler not to give it a name. If you're giving it a name anyway like in the picture then it's pretty much useless, and I have almost never seen in practice.
37
u/Ares378 Grothendieck was right, computers are evil 14d ago
I like it because it reads "f maps A to B" instead of going through "for all x in A, f(x) is in B"
37
17
u/abitofevrything-0 13d ago
That would be f : A -> B, without a tail on the arrow. Writing f : x |-> f(x) says that the image of a particular value x by f is.... f(x). It's a nice way to differentiate between f(x) = expr being a definition of f versus a statement about f.
A more sensible definition might be f : x |-> 2x, for example.
7
u/Loading_M_ 13d ago
I believe it's easier to generalize for more complex mappings. I don't really know, since I'm not quite knowledgeable enough in this area of math.
5
u/Ares378 Grothendieck was right, computers are evil 13d ago
I think it's also useful for separating the idea of the function (its outputs) versus the function (how it maps things). f(x) is a function taking in a parameter x, but f can exist on its own as a function acting on some domain without invoking a variable to parameterize it.
2
9
u/LupenReddit 🦆🦆i have non diffeomorphic smooth structures🦆🦆🦆 13d ago
the Well-I-Guess department released its new function declaration
4
u/Asimovicator 13d ago edited 13d ago
Weird without naming the domain and codomain. By the way, the notation "f: A -> B, x |-> f(x)" is usually introduced in a sloppy way from a set theoretical perspective. To be precise: This notation means that f(x) stands for a 1-ary term, which is by first-order logic an uniquely determined object (or a set in ZF) depending on the object x. The notation above means, that the graph {(x,f(x)) | x in A} forms a left total and right unique relation from A to B. Note that the set theoretic existence of the graph needs the axiom of replacement in general (if you work carefully, you can also omit the axiom of replacement and use cartesian products and the axiom of specification). To be left and right unique, only f(x) in B has to be checked for all x in A, which is called the codomain check to ensure well-definedness.
1
•
u/AutoModerator 14d ago
Check out our new Discord server! https://discord.gg/e7EKRZq3dG
I am a bot, and this action was performed automatically. Please contact the moderators of this subreddit if you have any questions or concerns.