« first day (4947 days earlier)      last day (370 days later) » 

19:00
@TedShifrin happy to do so. is this the math 3500 series?
its a statement that sets are equal when their elements are equal
equality is a logical symbol
I see, you're saying I'm being too flippant calling this a "definition" rather than a fact/axiom?
flippancy! Quite an allegation!
19:01
no, I think you're just wrong when you do that
its an axiom
If axiom of extensionality wasn't there, you could still write $x = y$ for sets $x$ and $y$
its just that there could exist sets $x, y$ such that $\forall_z (z\in x\iff z\in y)$, but $x$ and $y$ aren't equal
@TedShifrin haha, in mathematics it's a big problem i guess!
gotcha @Jakobian that makes sense
@Jakobian this line crystallizes it for me perfectly, thank you
thats why I said that axiom of extensionality justifies set-builder notation
that part I don't know if i follow still. by set-builder notation we mean $\{x,y,z\}$ "builds the set containing x,y,z"?
no, set of $x$ with certain conditions …
If sets are determined by their elements, then if a set such that $z\in x$ iff $\varphi(z)$ exists, then we can write $x = \{z : \varphi(z)\}$ because it will be unique
@EE18 we mean $\{z : \varphi(z)\}$ and all other variations
19:08
OK, I think I'm starting to see. So we use specification/comprehension to guarantee that the set exists and then extensionality so that it is unique?
Well, you use more axioms than just this one to show a set exists
as for the latter, axiom of extensionality tells you that for each formula $\varphi$ of set theory there can exist at most one set $x$ with $z\in x\iff \varphi(z)$
the set doesn't have to exist, but if it does, there is only one
True. I guess I should amend the above to say that given some set $X$ exists, we justify set-builder notation to build a set $Y$ from $X$ by using specification/comprehension to guarantee the existence of the set and extensionality to ensure its uniqueness
Got it!
thanks again
I suppose you are right that part of set-builder notation is based on axiom of comprehension
namely, we often write $\{z\in y : \varphi(z)\}$ where $y$ is a set and $\varphi$ is a formula
From axiom schema of comprehension we know this must be a set
EE18: "set-builder notation" is a term that a lot of books would not define and does not generally have an established place i know of in set theory
but at least some books would use it roughy to refer to a use of {x in A: f(x)} where A is a known set and f is a nice enough formula (perhaps also depending on things besides x)
and not just any use of curly braces, some of which are much more fundamental
or "{x: f(x)}" where the role of an ambient set is understood
@leslietownes Would you mind expanding on what you
re alluding to here? Not sure i follow
19:15
its maybe helpful to separate stuff that exists within your chosen formalization of set theory because of how you're formalizing set theory, and stuff that can be carried from place to place outside of that
looks like my reach for the apostrophe bar failed, ending in ENTER instead
its okay to write $\{x : \varphi(x)\}$ as long as a set with $x\in y\iff \varphi(x)$ exists
i was just attempting to do that in a tiny way
otherwise we would call it a proper class, which in ZFC is just the formula $\varphi$ itself
tries not to shriek with all this set nonsense
19:17
the terminology "set-builder notation" is something i would regard as having an informal scope that you might use as part of a discussion
it is not morse code for some specific axiom
@leslietownes I disagree
as jakobian notes it might be related to some use of a specific axiom but it is a correspondence in the sense of how humans talk about things and not a theorem in the sense of something that is in a textbook
jakobian: you don't get to, i'm sorry
jakobian: here's a pedagogical point you might consider. if someone is reading set theory out of a book that gives very explicit definitions for some things, and does not define others, and "set-builder notation" is not one of those other things, it is pedagogically unwise to tell such a person that "set-builder notation" is morse code for one of the things they're reading about
it is also pedagogically unwise to do this if they might be reading out of such a text and you just don't know either way
regardless of your own feelings on the subject
this is just an enormous blind spot you have about how you talk about math
Damn, leslie and Ted agree yet again.
in mathematical logic its important to define certain things formally such as union $x\cup y$
I believe set builder notation is one of those things
i think you'll find that many set theory and logic books at the levels of formality that you find respectable do not use the term "set builder notation" anywhere
19:26
why wouldn't they
its still made for human beings
it's just not common. i honestly don't know if you're trolling or if this is actually an issue of english use vs. whatever "Set builder notation" is in a language you also read
@leslietownes This is well taken
It's also well taken (I think) that it's at least interesting and useful to think about how one might formalize set-builder notation if they had to, if for no other reason than that's useful for flexing the relevant brain muscles for a rookie like me :)
You're going down the pedantic rabbit hole, @EE18. See you in a few years.
EE18: to get back to the point, i've definitely read or taught out of books where "almost anything with curly braces and commas in it" would be described as set builder notation, including e.g. {1,2,3}, although [again all of this depends on axiomatization] the axioms you need to make sense of something like {1,2,3} would not necessarily draw on comprehension/abstraction/whatever you call it
But ya I think a lot of heartache I had in the first chapter of Amann Escher was that they are so damn precise about everything...except for everything underneath where they start...so it can be hard to delineate the two
@TedShifrin ;) it's a bad habit i need to avoid, at least for now. it's just so damn tempting
19:30
it's not so much a dichotomy between "precise" vs. "imprecise" as "part of a long list of choices i'm making" vs. "not"
That's fair. They need to start somewhere i guess
I think you can do and learn plenty of rigorous mathematics without spending two years studying foundational ZFC and axiomatic set theory. At least, I sure did.
The amount of foundational set theory in Munkres's Topology is sufficient for at least 99% of mathematicians.
i'll give an example, i opened the one set theory book i have, and herbert enderton's "elements of set theory" refers to what you call comprehension as "abstraction" and informally refers to the use of "B = {x in c: ___}" (where c is a known set and ___ is a symbolic formula not containing B) as "abstraction notation"
The things I often encounter are foundation issues in topology, so no this isn't enough for me
but sure, you can do without it, depending on the field
The topology you look at is far, far, far from where research in topology has been for 50 years.
Let's not just judge everyone by your particular interests.
19:36
recent paper I've looked at was from 2010
yeah lets not judge everyone huh
especially with your bias against me
3
Q: Functions that have the same derivative

Eden HazardLet’s say I have two continuous functions $f(x)$ and $g(x)$ , and both have the same derivative $h(x)$. How could I formally show that $f(x)=g(x)+c$ where $c$ is a constant. I know I have to show that $f(x)-g(x)$ is a constant function but not sure how? Thanks

Isn't providing a counterexample the correct way of answering this question? Instead of assuming another condition to proof the statement.
@Jakobian Deal with it.
@leslie How do we prove Liouville's Theorem for real analytic functions?
@TedShifrin ok just real quick question. When I've used the dot product in cosine similarity, in that formula, the $\theta = \text{arccos} \left(\frac{\mathbf{x}\cdot \mathbf{y}}{\lVert \mathbf{x}\rVert \lVert \mathbf{y}\rVert }\right)$

that itself is a measure of closeness of two vectors, right?
soumik: so, it's not a well-formed question because of its silence about the (preusmably common) domains of f and g, and i'd hope that any answer would point that out, and expressly state what they were assuming about the domains of f and g in order to give a "proof"
@TedShifrin its you that assumed that I'm talking about everyone. And its also you that seems to be assuming that just because you didn't have to deal with foundational issues, everyone wouldn't have to
lots of people don't have to, but there are some that do
19:40
i wouldn't think it unreasonable to post an answer that expressly provides that assumption and gives that proof. i.e. the kind of condition that you'd need to assume for the question to make sense is not an arbitrary choice, coming out of nowhere
liquid spaces and all that is all modern research yet its strictly about foundations
50 years? yeah right
@Stan No, not really. Is a vector of length $1$ close to any vector of length $10$?
i don't think it's great that people responded with 'proofs' that don't make their assumptions (or even their arguments) very clear
Oh, never mind, @leslie. That was stupid. Let me rephrase: How can we prove that there is no real analytic function that goes to $0$ at $\infty$?
i was wondering what "liouville's theorem" was gonna be :)
what's stopping e^(-x^2) from being something like that
19:44
@leslietownes If someone asks to prove a false statement, what would be the correct approach at answering it? providing a counterexample or proving after having further assumptions?
@leslietownes Yes, all the other answers except the accepted one are wrong
Yes, of course, @leslie. Today is just my day for being dumb. Too busy being surrounded by formalism.
soumik: well in the example you've given, the missing hypotheses (needed to make the statement true) are pretty clear, and so commonly made in a lot of "calculus class" type pedagogical environments that the OP might not even be aware that they are hypotheses. so maybe this isn't a very representative example of the world of "somebody asking to prove a false statement"
soumik: and literally none of them have upvotes? is there something that upsets you about this question specifically? it looks like MSE voting actually works in this case
i'm not sure if you are asking something specific to this question (from 2019??) or are you asking about some more general phenomenon
I just recently learned that two continuous functions that do not differ by a constant can have identical derivatives everywhere
So I checked the question here and found that post
@Soumik Yes. If they are not everywhere continuous.
Consider $\tan x$ and $\tan x + 5$ and $\tan x + 9$ on different intervals.
That's one of the big misunderstandings of many calculus students :)
@TedShifrin Sorry I don't get it
19:50
Yeah, I didn't type it right the first time.
Oh you changed
Let me know if I still need to elaborate.
Well, I was still right, I just need to be more specific.
for some reason i always think in terms of sliding the two "halves" of the graph of 1/x up and down as my canonical example
$f(x)=\tan x$.
although piecewise constant functions would do just as well
19:51
$g(x)=\begin{cases} \tan x, & |x|<\pi/2 \\ \tan x + 5, & |x|>\pi/2\end{cases}$.
True, but then one gets confused about maximal domain. :P @leslie
@TedShifrin in other words, even if the angles are the same, the magnitudes matter a lot?
@TedShifrin but if you make the assumption all vectors u are working with have the same magnitude, then it would be a measure of similarity?
@Stan If you're talking about vectors of the same length, then, yes, the angle (hence dot product) tells you how close they are. :)
@TedShifrin i'm glad you pointed this out. i've not remembered that's a requirement and just accepted passively when people told me its a measure of similarity
wow LOL i need to think for myself more
Similarity is a terrible word.
I know only similarity of triangles or other geometric figures.
I neeeever liked this. Ever. Ever. This dot product thing has bothered me from day 1 of learning in ML class that it was a measure for similarity
19:58
What are two non isomorphic traingulations of 4 vertices? Or is there only one?
@Stan What is their definition of "similarity"?
@TedShifrin apparently only learn math from mathematicians! :')
idk but the dot product is one of the common ones accepted
maybe they just assume in every case you're going to only have vectors of identical length
I really think we need a definition.
You seem to be thinking of it as "closeness" in a metric space.
@Simd What do you mean? You want two different simplicial complexes with 4 vertices?
@TedShifrin I am not sure what a simplicial complex is, sorry. But I want 4 vertices connected by edges so that every edge is in a cycle of length 3
There may only be one up to isomorphism
Certainly I could make something less symmetric than the usual tetrahedron. But your requirement that every edge is in a cycle of length 3 destroys my examples. You certainly did not say that to start with.
20:02
Isn't that a triangulation?
@leslietownes Maybe I'm not understanding the statement being made, but how is this an example? Isn't the claim essentially "let f and g be two continuous functions with same codomain and domain. Then f' = g' is sufficient but not necessary to guarantee f = g + c for some constant c"?
Well, I should not speak so quickly.
One refers to a triangulation of a topological space, not a triangulation of a set of vertices.
@TedShifrin I mean, I can only speak from it based on experience. in many language ML classes, the vector representations of words. Suppose I have the word "happy" as a vector and I ask it to use this cosine formula and comptue the angle between "happy" vector and other words. It will often return words with very highly similar meaning such as like "elated" etc.
So in this sense, it can be used to find "similar" words. there are other contexts where this works too. So I had typically taken it as an assumption that this dot product cosine angle formula was a measure of closeness.
no one pointed out that, if you think intuitively about it, obviously if you just took two vectors in 2D and computed their angle, whithout a restriction on magnitudes, the vectors may not be anywhere near each other.
What if the topological space is the union of a triangle and a point not contained in that triangle? That gives you 4 vertices.
20:04
@EE18 you need to read this as a calculus student will read it. keep in mind like 99% of people using MSE have never heard the word "codomain" and certainly aren't thinking about varying the domain.
Apologies if my definition is not standard
a standard hypotheses in calculus books, sometimes buried in a paragraph of remarks and used only inconsistently later, is that when you make statements of whatever type, you are restricting to a domain that is an interval
@TedShifrin ah yes. How about connected graphs?
@EE18 First, you need to say differentiable, not continuous. It is NOT sufficient. It is certainly necessary.
@Simd OK, now why can't I take a triangle union a segment from one vertex to an external vertex?
Like a triangle with a hair growing out of one vertex. :)
Oof! So the statement is ""let f and g be two differentiable functions with same codomain and domain. Then f' = g' is sufficient but not necessary to guarantee f = g + c for some constant c"? I vaguely recall this from Spivak, but are you saying my comment about sufficiency is wrong even in this restatement Ted?
20:07
@TedShifrin can you explain the graph? What are the edges?
@EE18 oh sorry i now see what you're replying to. if f and g are different "slidings" of the halves (the idea is shift the two pieces by different constants) they will have the same derivative but not be the same.
@TedShifrin would that edge be in a cycle of length 3?
I'm saying you have necessary and sufficient mixed up, or else I'm just brain-dead.
@TedShifrin @leslietownes The example I was looking at is a bit more complicated, where the difference function is strictly increasing
@Simd No. But you added the cycle condition later in the game.
20:08
@TedShifrin I am sure it is my fault
@TedShifrin yes, sorry
soumik: isn't the top-voted answer (which points out the implicit hypotheses of connectedness for the theorem to hold, and what can happen if the domain has more than one 'piece') still at least somewhat informative in whatever example that is?
The cycle condition is a definite topological restriction.
I suspect there is only one for 4 vertices. But what about 5 vertices?
Huh?
Ah.
(typo fixed)
20:09
Still a condition about cycles?
Yes
@leslietownes Yes, the counter example is a construction on a Cantor set
@leslietownes Hmm, still not sure I follow. If I look at the two pieces of 1/x then they have the same derivative if I "read" the left piece from right to left and the right piece from left to right? But not sure I follow. anyway, no stress, don't want to waste your time with my misunderstanding
I am saying $f' = g' \implies f = g+c$. Isn't that "$f' = g'$ is sufficient for $f = g+c$"? @TedShifrin
@Simd So now you can have different ones. Take ABC together with ACD together with BCE.
@EE18 an alternative way to think of this is the "calculus formula" integral -1/x^2 dx "=" 1/x + c is kinda wrong because the most general antiderivative to -1/x^2 [i.e. having the same largest domain as that thing] does not require "the c" for "the two 1/x pieces" to be "the same"
20:12
Oh wait. I take it back. For 4 we can have different ones. What about ABC together with ACD? Why do we have to include BCD?
65211235: I should say locally constant instead of constant. As a piecewise function works as a counter example in the constant case.
@EE18 But that's false unless your domain is connected.
EE18 when i was using the word "pieces" i was speaking informally. consider any numbers A, B and define f for x negative by f(x) = 1/x + A and for x positive by f(x) = 1/x + B. then f'(x) = -1/x^2 for all x regardless of what A and B are
I guess that means I am totally forgetting some underlying hypotheses Spivak was making. That was a few years ago but dang that's bad still :( will hopefully get this better once I am deeper into Zorich and AE. Thanks for clarifying Ted
in particular, the condition that f'(x) = -1/x^2 does not require any relation between A and B
20:14
@TedShifrin for 4 vertices do you mean edges (a,b), (b,c), (a,c) them which edge?
Thank you for your help
I see, thanks Leslie!
4 vertices with edges AB, BC, CA, AD, CD, but NOT BD.
@EE18 Spivak is definitely working on intervals. It's all the mean value theorem.
That definitely comports with what vague memory I have
$\int f = g+C$ only making sense on intervals (i.e. the $+C$ depends on component you are in) is one of the first encounters of people with the notion of connectedness
@Simd So it seems your 3-cycle condition gives two different graphs up to isomorphism. It depends on whether there is any net boundary to the structure. For the tetrahedron with AB, BC, CA, AD, BD, CD, there is no boundary. But if you remove one of these edges, you now have boundary.
20:19
I'm talking about integration here, but $f' = g' \implies f = g+C$ is basically the same context
Would connectedness not come up in calculus of one real variable?
don't have my copy of Spivak on me but I don't recall it
@EE18 No. We don't use the word. We talk about things on intervals and warn students that if your domain is not an interval, things can go bad.
I've encountered it after integration
only further down the road I've realized its all about connectedness
@EE18 Even in my multivariable math book, I don't define connectedness, although path connectedness appears in an exercise.
But I do define open, closed, compact sets (in $\Bbb R^n$ only).
I think everyone does it the same, we first encounter a concept, and then have a sequence of, mostly guided, realizations about the subject so that we understand them more
20:23
@TedShifrin The counter example I saw also assumes the function to be continuous everywhere. The reference is S. Saks, Theory of the integral, page 205-206
@SoumikMukherjee identical derivatives everywhere?
there certainly are such two continuous functions if derivatives are equal almost everywhere
what I think you're saying is that fundamental theorem of calculus is false
@Jakobian Yes
but this is for a.e. equality of derivatives
The domain is not connected
then you don't even need to reference a book like Saks
its easy if domain is not connected
however, if it is connected, even if $f' = g'$ except for countable set, this still implies $f = g+C$
I suspect someone linked Saks because of the example that $f' = g'$ a.e. doesn't imply $f = g+C$ for continuous $f, g$ (and on a connected set)
that's only situation I can think of for someone to reference that book
side note: If you want to learn about theory of integration, there are better more modern releases
Though I agree Saks is somewhat of a classic
20:33
I was reading the Counterexamples in Analysis book, where they referred the Saks book
@Jakobian Like?
@SoumikMukherjee I'd suggest starting with Bartle or Fonda for Kurzweil-Henstock integrals, both have advantages, Bartle is a great book to read from, and Bartle is side-tracked a lot, so you gain exposure to more in integration theory. On the other hand Fonda does things more straightforward, it only discusses the relevant theory. Fonda also discusses generalizations to multiple dimensions, and to differential topology
The last book I'd recommend is the one by Gordon, when he goes very extensive more akin to Saks, but more modern
the last book expositions you to various concepts of integrals
Ah okay, thank you for the suggestions.
@Jakobian Another question, what books would you suggest for point set topology? Dugundji?
its an option
Munkres is fine
I'm not willing to recommend anything for point set topology without knowing whats it for
Dugundji added some of his own flavour into his book, so while its interesting you might encounter some things you might never find useful
if you want to read further into topology while already knowing a chunk of it, I recommend Engelking
its a great book, and I wish I had read it in full at some point
if you want to further your knowledge in some subfield of topology, there are options there too
if don't know any topology, not even metric spaces, you'd do better learning that first
also Dugundji goes very informal with algebraic topology part of his book, I didn't enjoy that part
I don't have a solid go to book for furthering your knowledge in point set topology after exposure to metric spaces, but Munkres or even Dugundji, its alright
20:49
@Jakobian Yeah I want to deepen my understandings of topology. Till date I only followed from Munkres.
@SoumikMukherjee topology in general?
then Engelking
a lot of point-set topology is not immediately worth learning unless point-set topology is your specific area of interest
not sure if that's what you're going for or not
I'd assume Soumik knows that and is asking out of interest
20:52
Say I want to learn from a book that has a different style than Munkres
you know thats a different question
@SoumikMukherjee VI lenin, "imperialism: the highest stage of capitalism"
If you are to read Engelking you're going to learn a lot about general topology than from Munkres
@Jakobian Why? won't learning from a different source help deepen my understandings?
the difference in two is enormous
20:54
@Jakobian Yeah that's fine
Munkres in comparison to Engelking is just an undergraduate book, while Engelking is a source and reference
the material matters first and foremost
@leslietownes been there, done that
why do you want to learn point-set topology
im still not sure, do you want something that covers similar material to Munkres, but in a different style? or do you want to learn something new altogether?
20:55
Engelking is not something you learn from unless you really want to understand point set topology on a really deep level
its way more material than in Munkres
@BalarkaSen thats what we're trying to figure out
and a lot of it is very insular in comparison
i didnt see the question explicitly being asked anywhere
almost all the material in Munkres is also useful in other areas of topology
the same cannot be said for the material in Engelking
Munkres talks about useless topics like box topology
unless you're embarking on a year-long reading project on point-set topology, engelking is not appropriate
20:58
@Thorgott you're totally wrong?
@Jakobian lol no
Engelking is prime reference for point set topology
yes, and "point set topology" is not useful in other areas of topology
mostly
indeed
@BalarkaSen For the sake of learning new things and relearning the old things in a different way if possible
20:59
I misunderstood the statement
@SoumikMukherjee that's too nonspecific
you must have a goal in mind

« first day (4947 days earlier)      last day (370 days later) »