So when you see the sun rising, cherish the moment, as it has never happened before and will never happen again.
The original comment's "theorem" is funny, but unless you are doing a homework problem, you better have a good intuition for when to take a second look at a seemingly simple situation.
Sure, but if you're scientifically looking to answer "where and when will the sun rise" you're only going to collect enough variables to answer that question, and within an acceptable margin of error, right? If you can measure with greater accuracy and collect more data, then you would probably realize that every sunrise is not strictly identical.
We're splitting hairs at this point but I wonder if the comment I replied to that stated that "it has never happened before and will never happen again" can't be argued to be actually true. In a philosophical sense it's more obvious, but in a scientific sense, the more precision you get in your analysis of a sunrise, the more data you would get that differentiates it from other sunrises, no? After all, our solar system isn't closed and constant and there are minor changes not only in smaller factors like weather on Earth, but also larger factors like the orbit of the earth and the drift of the different planetary bodies.
There are books and articles and may be one can start with the key phrase What is same river
And the hidden issue is you. If you think it is unique every time frame ... what is same river and same you. Can One same you even step into the River
And if step into it and swim in parallel is the molecules mostly the same ...
Back to What is river? If it is keep on changing as any river that is not changing and moving is not a river, the sameness if you accept then you can step into the same river as many time as you like. But that is wrong per the statement. Hence what is “same river”.
I suspect that "all equations have one solution" is a lot easier to satisfy when all functions are continuous, or otherwise nice, as well.
Would you say that's an accurate characterization?
It is reminiscent of what Euler called “the universality of analysis” (note that over the history of mathematics, analysis has been used to refer to just about everything that isn’t geometry. In this case it means roughly the sort of mathematics a physicist or engineer might know well, so non-abstract algebra with integration and differentiation). He could do crazy things like solve combinatorics problems using infinite expansions of series in ways that didn’t really make sense (I think this example is well known but I can’t think what it is) but get to the right answer. A non-Eulerian example would be Dirac delta functions which aren’t functions at all and can be tricky to formalise but also just magically work within the framework of abstract symbol manipulation that is used in applied maths without significant modification (except when e.g. some fundamental property of your model of the universe depends on the value that the Heaviside step function takes at 0)
Could be the basel problem though he probably used this trick many times in his prolific life:
https://en.wikipedia.org/wiki/Basel_problem#Euler's_approach
Actually, at the start (2500 years ago) the word “analysis” in mathematics was only about geometry.
See e.g. https://www.jstor.org/stable/2250061
I guess that's related to the fact that all computable functions from real numbers to real numbers are continuous. It seems reasonable that the laws of physics should be computable to a large extent otherwise we'd have been able to build a hypercomputer by now.
For the particular example of a step function, consider the function f which is 1 on the positive reals (>=0) and 0 otherwise. What representation of the real numbers would you choose for the computation of f(0) to terminate in a finite amount of time? It cannot be the binary representation, as those are infinite. Your algorithm, terminating in a finite amount of time, will have checked only a finite number N of binary digits of the argument, and so I can choose x = 0.0{..N..}01 and obtain f(0) = f(x) by this algorithm, which is incorrect. You can choose the Cauchy sequence representation, or the Dedekind cut one, but this problem will persist (and [1] proves this in general).
You can "cheat" by saying that the leading two bits will store the sign of the number: 00 for 0, 01 for positive numbers and 10 for negative ones. But then suddenly arithmetic operations are not computable (see comments on [2])!
[1] https://lukepalmer.wordpress.com/2008/08/11/all-functions-ar...
[2] http://math.andrej.com/2006/03/27/sometimes-all-functions-ar...
[3] Vereshchagin, N., Shen, A. Computable Functions. https://bookstore.ams.org/stml-19/
Well, except the Taylor series part. Numerical analysis is perfectly happy to take you to the cleaners even in ultrafinitist settings.