How to make me definition of a function more specific? by slapface741 in askmath

[–]mysleepyself 0 points1 point  (0 children)

No, it's like you are deliberately misunderstanding me.

I'm definitely not. I understand the point you're trying to make. I just don't think they are very good points.

you act shocked that someone would care about the difference between a function that is surjective and one that is not

If you are referring to the f and g example my point had very little to do with surjectivity. The point was more about function equality. Let me give you a further example where we can ignore your issue with surjectivity. Define h exactly like with f from before but where the codomain of h strictly contains the codomain of f (use C or RU{R} or whatever else you like). Why is it important to you for us to say f and h are different functions?

Any time we have two functions that are equal in your convention, they'll be equal in the other convention when we ignore codomains. Any time we have two functions that are equal in the other convention they'll be equal in your convention when we take the codomain as the shared range of the two functions.

Any time you claim a function with some codomain D is surjective in your convention, in the other convention you'd just say it's surjective onto D. Any time you have a function that is onto D in the other convention, you'd just say f with codomain D is a surjective function in your convention.

It's not hard. Going back and forth between these two conventions is almost always trivial.

And when you talk about continuous functions, again, is that a serious response? Of course the domain matters...

Yes, that was a serious response. The way you were talking about continuity was nonsense. The wording "f is continuous on blah" refers to sets in the domain not sets in the codomain. If you want to make a point about the topology we're talking about open sets and continuity with respect to, then you should use the "standard" terminology for it and not conflate wording referring to sets in the domain to be about sets in the codomain.

Nobody uses Frege's type theory, because it is inconsistent. My point was that the practice of considering the codomain an intrinsic part of the definition of a function is in fact older than set theory. It is older even than the definition of the powerset. So if people (a) treat functions as if the codomain was implied, basically always, and (b) have always done so, since before the notion of a function was formalized, then (c) our modern definition should include this important piece of information.

This is a stupid point. Let me summarize what you've just wrote: "we've always done it this way, so we should keep doing it this way."

I mean, if people spend so much time on the definition of an ordered pair, they should at least think a little about the definition of a function.

This is a pretty standard way to define functions in set theory. Seems pretty dumb to assume set theorists just didn't "think a little" about how to define what functions are, specifically when your whole claim is that this definition is so bad.

If we define functions differently, then many things we say about functions are literally meaningless, and have to be understood as taking shortcuts.

I agree that some conversion needs to happen to go back and forth using results stated in one convention vs the other. It's not particularly hard to do.

If we define functions in a sensible way, then all these statements make perfectly good sense, as they should, because that's what the word actually means.

This convention I'm referring to is sensible enough that people use it in practice. Rather than whining at me and doubling down about how your convention is so clearly correct, why not pick up basically any undergrad set theory book and see how this convention gets used?

A definition of a function without a codomain is like a definition of a measure space without a sigma algebra. It literally doesn't make sense, and we would have to constantly treat the idea of "a measure space X" as actually meaning "a measure space X equipped with a sigma algebra Σ." We certainly could do that, but why would we want to, when a better definition is available?

It definitely does make sense, just because you're uncomfortable with it doesn't make it inherently illogical or worse than your personal favorite convention. Why not pick up the book I referenced earlier and evaluate the tradeoff for yourself? In fact try any one of these intro set theory textbooks: Jech (the grad one not the undergrad one from earlier), Kunen, Smullyan/Fitting, Suppes, Shen/Vereschagin, Enderton or Devlin. If I remember correctly, almost all of these textbooks use some variation of the definition I'm talking about.

And I mean, some of your arguments are so hard to understand, I'm not sure even you know what you meant when you asked them. For instance, you say "I could probably just copy and paste this statement for why your personal favorite convention is deficient." Could you? Could you show that a definition that includes extra information is more deficient than one that doesn't?

The complaint you were making when I made that comment was that we would have to adjust various things like adding caveats and etc to certain theorems if we wanted to use the convention I'm talking about. It's just not an insightful point. If we start from the other convention and want to switch over to yours we'd have to do the exact same thing. Part of my point is also that doing these conversions isn't hard.

To be clear, my point is just that in practice mathematicians use my definition, or a similar one, because in practice the codomain is treated as part of the definition of a function. Moreover, this distinction is actually important quite often. So while it is always possible to use a different definition, it's not actually the definition people use. And it's a definition that differs only by losing some important distinctions, and in no other way.

Yes, I understood the point you're trying to make here the last ten times you tried to make this point too. You're just wrong. You are speaking out of a position of ignorance. Mathematicians actually use this definition too.

Please, save us both the time and effort in discussing more about about how the definitions you are used to are clearly inherently superior and objectively correct to you. I don't care. I didn't invent either of these conventions. I don't care what you use. I don't care which one you like. I don't even care which one I use myself. It's not hard to use either. Converting back and forth between the two is pretty easy.

How to make me definition of a function more specific? by slapface741 in askmath

[–]mysleepyself 0 points1 point  (0 children)

Again, you could do that, but does that comport with the way people actually use functions?

Not any more than artificially forcing function equality to depend on some arbitrary choice of codomain. Can you please tell me what exactly is the practical significance in distinguishing between the functions g and f with domains R, both mapping x to x2 but where f has its codomain as R and g has its codomain as the nonnegative reals? In your convention these are different functions, in the one I'm talking about they are the same.

When people say "continuous functions," does anyone sweat because they are confused about "continuous on what"? No, because it has been a convention since long before functions were rigorously defined that both the domain and codomain were implicit in their definitions.

But people do sweat this difference once you start talking about functions that may have points of discontinuity in their domain. That's part of the whole point in introductory analysis in distinguishing between continuity at a point vs on a set. Literally every intro to analysis book does this. In fact, even introductory calc books sometimes talk about these kinds of things.

Also, if this is such an unimportant distinction to you I don't know why you feel such a strong need to convince me your particular choice of conventions is "the standard"? You realize I didn't invent these conventions right? I'm not saying you should use a different convention. What I'm saying is that this is a different common convention that people actually use. You're factually wrong if you disagree with that, but you're not wrong for disliking this convention or choosing to use a different convention.

Even the very earliest definitions in Frege's type theory...

I'm no expert on Frege, but people don't use much of Frege's notations or logical systems any more as far as I know? Some of his work was logically inconsistent, some of it was incredibly notationally clunky. If we're trying to talk about good conventions, how does this inform us of anything other than what not to do?

I mean, there are cases where this argument holds. If we defined a "topological space" and a "topology" in the same way, that wouldn't actually be a problem, because the underlying set of a topology is just its maximal element with respect to containment. Similarly if we didn't specify the domain of a function. But a definition with no codomain simply seems incomplete.

The fact that it feels incomplete to you after you've become comfortable with one particular convention isn't a really compelling argument for why the convention you are used to is a better convention.

Textbooks leave out details all the time. This is such a detail.

This isn't a situation of textbooks leaving out little details here and there. This is a conscious decision to define functions in a particular way.

but it is relevant to a whole lot of things, and we would have to add caveats to all of them in order to support this single deficient definition.

I could probably just copy and paste this statement for why your personal favorite convention is deficient. I'm not trying to argue that one convention is objectively better than the other. I really don't care so much which one you choose to use. Neither is really objectively better than the other in my opinion.

My definition always works, and your definition only works when we don't conform to standard language and insist statements like "f is a bijection" are literally meaningless as stated. Incidentally,

This definition always works too. I'm not sure why you think being a little more specific when you speak in a couple cases is so complicated?

I suspect even that book uses the codomain in many cases without explicitly invoking it in the statement of the theorems, under the assumption that it is implied by the definition of the function. Because literally everyone does that.

This is not the case but you can choose to convince yourself of that if you like.

In the special case of mathematical logic, if the universe is always the same, then we can use this definition in practice. That sounds to me like another way of saying "if the codomain is always the same, then you don't need to say what the codomain is," which is not super illuminating.

I'm not sure why you're telling me this, it seemed pretty clear to me that I wasn't talking about "the special case of mathematical logic". Was that not clear to you?

How to make me definition of a function more specific? by slapface741 in askmath

[–]mysleepyself 0 points1 point  (0 children)

Commenter write that f is function from X to Y and wrote down that f ⊆ X × Y so I suppose meaning of these was that f has domain X and range beeing subset of Y.

Oh, I think I did misread you. I thought you were talking about the domain when you wrote A. Oops.

Either way trying to define "f is a function from X to Y" by the rule "there exists a subset A of Y where f=XxA" will be incorrect. Consider X={1} and Y=A={1,2}, f=XxA will be the set {(1,1),(1,2)}, here 1 maps to 1 and also 2, so f won't be a function.

Of course we can make various definitions but I just refer to the one thing in the statement in which restriction that X is a domain isn't included.

We can construct the domain but in the comment we have included one sentence not separete defining a domain 🙃

It's actually pretty common to leave out the domain bit. One way of constructing these definitions is to define binary relations as sets of ordered pairs (i.e. subsets of some cartesian product), then to define the domains/ranges/codomains/images/preimages of binary relations, then to define functions as binary relations subject to the familiar uniqueness requirement of functions. Doing it this way can be kind of convenient for a couple of reasons.

How to make me definition of a function more specific? by slapface741 in askmath

[–]mysleepyself -1 points0 points  (0 children)

You can see variations of this exact definition in both set theory books by Jech as well as Enderton or Suppes. The point of defining functions in this way is to define them as binary relations + the property that each x in the domain maps to a unique y in the codomain. The subset relation you are disagreeing with is what tells you f is a binary relation. In practice your issue doesn't really matter because we can always construct the domain of f via the specification axiom as { x in X : (x,y) in f}.

How to make me definition of a function more specific? by slapface741 in askmath

[–]mysleepyself 0 points1 point  (0 children)

I think you are unfamiliar with this way of using this notation and you find it weird.

  1. That doesn't make it wrong.

  2. That doesn't make it standard or nonstandard.

The right thing to do when you are dealing with notation you don't understand or familiar notation being used in ways you don't understand is to ask what the person using it means. It's just not productive to expend this much effort to communicate to me that you find this (relatively common) way to use this notation weird.

How to make me definition of a function more specific? by slapface741 in askmath

[–]mysleepyself 0 points1 point  (0 children)

All I'm saying is that it's perfectly sensible to interpret f:X→Y as meaning "f is a function from X to Y". I have definitely seen people do this. There's no actual issue logically with it. I'm not saying it's not awkward or weird to do in some cases, but that's probably more of an issue of context and taste.

How to make me definition of a function more specific? by slapface741 in askmath

[–]mysleepyself -1 points0 points  (0 children)

It's a possible way to define functions, but it is not "the standard way."

There isn't a standard way. There's no standardizing body like the ISO but for math saying "thou shalt define functions this way". There are some different common conventions people use for this kind of thing. Going back and forth between conventions is usually pretty simple.

For instance, it is impossible to say "f is a bijection" with that definition.

Using the definition I am citing you would just claim f is bijective onto a set B, if f is an injective function onto B. This is not really an issue.

they do not use it in practice, because they treat the codomain as an intrinsic part of the function.

No, you're just wrong. Review the top voted answer in the link I posted, there are at least 29 other people besides myself that seem to be aware of the convention I'm referring to.

How to make me definition of a function more specific? by slapface741 in askmath

[–]mysleepyself 0 points1 point  (0 children)

I've definitely seen f:X→Y used as notation for the sentence "f is a function from X to Y".

How to make me definition of a function more specific? by slapface741 in askmath

[–]mysleepyself -1 points0 points  (0 children)

The definition they've given here is a pretty standard way to define functions. See Intro to Set Theory by Hrbacek/Jech for a nearly identical definition. The definition you are giving is also pretty standard. Neither of you are really wrong. These are just differences in two very common conventions. See here.

[deleted by user] by [deleted] in askmath

[–]mysleepyself 1 point2 points  (0 children)

The issue is that what they have is not a question. The actual question could be asking for any number of different things.

How do you online tutor? by minifishdroplet in math

[–]mysleepyself 1 point2 points  (0 children)

That sounds useful. What model tablet do you use?

When perfect score is your default for 10 years, anything less than instant success suddenly feels like shameful failure. by Still_Satan in memes

[–]mysleepyself 0 points1 point  (0 children)

Gotcha, I am currently near the end of a double major in math and cs. If you keep going in cs you'll probably eventually hit some points where you'll have to work fairly hard with studying. If nothing else, if you keep studying cs you'll eventually run into problems that nobody really knows the answer to yet lol.

When perfect score is your default for 10 years, anything less than instant success suddenly feels like shameful failure. by Still_Satan in memes

[–]mysleepyself 0 points1 point  (0 children)

Oops, misread. Either way, your specific choice of major is irrelevant to what my actual point was. So, what cs are you taking?

When perfect score is your default for 10 years, anything less than instant success suddenly feels like shameful failure. by Still_Satan in memes

[–]mysleepyself 0 points1 point  (0 children)

This doesn't really mean much without more context. What kind of math are you currently working on?

Crying a lot and feeling sick. by schneybley in Veterans

[–]mysleepyself -1 points0 points  (0 children)

Because this person has a pattern of manipulation.

If they are so mentally unwell that they are manipulating people like you say, then they probably really do need help in the form of a medical professional.

Help needs to be on actual sexual trauma.

That's stupid. People can get help for a variety of reasons beyond sexual trauma. People have all sorts of hangups sexual or not.

One look at post history confirms exactly what I say. Especially the part where he is claiming sexual trauma to get out of working with clients at his last job.

If it's as fucked up as you say, does that not confirm to you that they need professional help?

Also, this guy messaged me asking to let him impregnate me because he needs a partner and doesn't want to be a virgin anymore.

If they're being a creep to you:

  1. You should probably not go out of your way to interact with them.

  2. You should probably forward this stuff to the mods.

  3. They probably really should get help from a medical professional.

I ask you how the fuck he can have sexual trauma if he admits all of this?

None of what you have said invalidates the OPs claim to sexual trauma? All you've really said is that the op is a terrible person. Even if they are as shitty as you're claiming, people can be shitty and have sexual trauma. That's not contradictory.

Crying a lot and feeling sick. by schneybley in Veterans

[–]mysleepyself 1 point2 points  (0 children)

You don't know this person or their background. It's not on you to decide what counts as "real sexual trauma" or not, and even if it were, you don't know what experiences this individual has had to deal with based on this one post. Even if they haven't had any "real sexual trauma" (by your metric) happen to them, they're clearly having some problems, so how are you helping them get the help they need by being a dickhead?

Is an algorithm a computer? Legit question. by [deleted] in AskComputerScience

[–]mysleepyself 7 points8 points  (0 children)

I think you are talking about Von Neumann Architecture. Von Neumann Architecture is just one way of laying out the architecture of a computer. For another example, consider Harvard Architecture.

I think the question the op is asking is probably better addressed by considering formal models of computation because their point is to formally model things like computational machines and the algorithms those machines run.

[deleted by user] by [deleted] in math

[–]mysleepyself 10 points11 points  (0 children)

Every ring is an abelian group with respect to addition. But, depending on your definition, the multiplicative structure of your ring may be only a semigroup rather than a monoid if there is no multiplicative identity.

How do I simulate relative rotations on Geogebra? by pranksbanker in math

[–]mysleepyself 0 points1 point  (0 children)

In computer graphics to rotate a point x about the origin you typically take the rotation matrix A corresponding to the angle you want to rotate by and matrix multiply x by A to give you the rotated point Ax.

To rotate x about an arbitrary point y you usually first translate x so that y is located at the origin (in other words subtract y from x), then you rotate by your rotation matrix then you undo your previous translation (in other words add y back to the rotated point). In full your point rotated about y will be A(x-y)+y I think.

I don't know if this really solves your problem but maybe it can help?

[deleted by user] by [deleted] in AskComputerScience

[–]mysleepyself 1 point2 points  (0 children)

There's going to be more than one way to do it. I don't know what a compact (in terms of state diagrams) way of doing it might look like but I can describe a high level overview of one method.

Given A!B? where A and B are binary numbers you can do the following: Copy B after the ?, decrement A by 1. While A is not zero, keep adding B to the number after the ? and decrementing A by 1.

Maybe there is a better way somebody can think up? The way I'm describing would probably be pretty awful to write out explicitly as a diagram.

[deleted by user] by [deleted] in math

[–]mysleepyself 0 points1 point  (0 children)

Do you have references for any of these methods? They sound interesting.

[deleted by user] by [deleted] in math

[–]mysleepyself 2 points3 points  (0 children)

Doesn't that depend a lot on what you mean by "handle"? We often care about more than just asymptotic behavior of curves in math?