Starting from $\tan x=\frac{\sin x}{\cos x}=\frac{\sum (-1)^nx^{2n+1}/(2n+1)!}{\sum(-1)^nx^{2n}/(2n)!}$ and manipulating, you get a continued fraction for $\tan x$.
Ah right so there was a perturbation of the circle that was involved when doing it, which we weren't using appropriately, or at least, the book didn't specify how bad it has to be
Or, even what notion of approximation we were using
@TedShifrin This is the relevant theorem, quoting Eliashberg-Mishachev: Let $K \subset V$ be a polyhedron of codimension $\geq 1$ and $\omega$ a p-form. Then there exists an arbitrarily $C^0$-small diffeotopy $h_\tau : V \to V$ such that $\omega$ can be $C^0$-approximated near $\tilde{K} = h_1(K)$ by an exact p-form $\tilde{\omega} = d\alpha$.
$V$ here is a manifold.
The counterexample we proposed was $\omega = -ydx + xdy$ on $K = S^1$ in $V = \Bbb R^2$
The point should be that everything is a $C^0$-approximation, so if $\omega_n$ are a bunch of exact forms approximating $\omega$ uniformly, it has to hold that $\int_U \omega_n \to \int_U \omega$ where $U$ is some neighborhood of the circle
But that's total garbage because those integrals are zero, and what they tend to is something nonzero.
You have to decide what norm you want everything to have
Let's make that general: what metric you want everything to have
You could say the following:
$V$ is a Riemannian manifold. So that gives a length metric $d$ on $V$
$h_1(U)$ is a subspace of $V$. Can't you give it the induced metric from $(V, d)$?
The answer is "No". That's the wrong notion. You give $h_1(U)$ the induced Riemannian metric first. And then you extract the length metric $d'$ on $h_1(U)$ to get the metric space $(h_1(U), d')$.
Notice that "induced metric of length metric of a Riemannian metric $\neq$ length metric of induced Riemannian metric"
Find: $\displaystyle \lim_{x\to -\infty} \dfrac{\ln (1+e^x)}{x}$ (no L'Hospital)
I'm getting a hard time solving this limit. The book shows 1 as the answer, Wolfram Alpha shows 0.
I could solve easily another problem when the denominator was $e^x$ but got stuck on this one.
No L'Hospital...
@Akiva "Approximation" here means a double limit. The claim should be something like that for every $\epsilon > 0$ there is an $N > 0$ such that for all $n > N$, $\|\omega_n - d\alpha\|_n < \epsilon$
Where the forms, as well as the norms, are changing
It's a sad mess
But yeah when your norms change you have no reason to be able to invoke integrals and shtick
@Akiva If you want to do it explicitly, say $h_n$ is the isotopy which makes the Riemannian metric larger by a factor of $n$ on $h_n(S^1)$, in comparison to $S^1$ (So it introduces loooots of wiggles at each $n$-th stage).
Define $\alpha_n = -ydx + xdy - \omega_n$ where $\omega_n$ is a 1-form on $h_n(S^1)$ which integrates to $2\pi$. $(-ydx + xdy)$ integrates to $2\pi$ on $h_n(S^1)$ (because it's homotopic to $S^1$), so $\alpha$ integrates to $0$ on $h_n(S^1)$. That means $\alpha$ is exact near $h_n(S^1)$. But $\omega_n$ is very small in $C^0$ norm near $h_n(S^1)$ because $h_n(S^1)$ is long.
This means that it can't be written in terms of polynomial, logarithms, trigonometric functions, or any combination of those using addition, subtraction, multiplication, division, or exponentiation
That is, while the function "exists", it can't be written down in terms of functions you know about
Trey, people have created several functions whose integrands are $\dfrac{\text{well known function}}{\text{linear term}}$ because a lot of them come up often but dont have answers in term of elementary functions
wolfram alpha says the conventional choice here is
@BalarkaSen So all you need is the weak homotopy type of a CW cpx with cells in no larger dimension than the manifold. That follows from irritatingly fancy algebraic topology: mathoverflow.net/q/201944/40804
In mathematics, the exponential integral Ei is a special function on the complex plane. It is defined as one particular definite integral of the ratio between an exponential function and its argument.
== Definitions ==
For real non zero values of x, the exponential integral Ei(x) is defined as
Ei
(
x
)
=
−
∫
−
x
∞
e
−
t
...
I liked to the "applications" section
and it gave me this whole novel to accompany the link :(
Basically, I have to learn the linear optimization problem in very deep detail on my own, without tutors etc., with relatively little background in maths
The author describes the linear optimization problem in a highly abstract way, and continues to write up all known ways for finding (or approximating) solutions for it, from the useless naive ones to the practical ones.
Which the book defines as "Given the complete directed graph Dn with arc weights cij for evey pair i,j, compute a spanning acyclic tournament T in An such that the sum of the arc weights is as large as possible"
@Clarinetist Maybe I should do it indeed. I tried the CS site first, but there the people in chat also told me that it is unlikely that anybody there will know about it.
I am a bit taken aback by the idea to go to the research level site, because I need a beginner-level explanation
I already have the research level explanation in front of me and simply don't get it
and then there is the book from which I am learning, in which the information from these papers is presented even more densely than in the papers themselves.
@Clarinetist It was on their chat where I heard that probably nobody there can explain this stuff.
but I would really like to at least know what these cuts are about. And why they are different from any standard Chvatal Gomory cut (which I was only able to understand because some nice professor from the MIT has publicly uploaded a nice entry level tutorial)
The infamous limits-without-lhospital tag.
A lot of these questions are of the form
$$\lim_{x \to a}\dfrac{f(x)-f(a)}{x-a}$$
form, and anyone who's seen the first few chapters of a typical calculus book would know the above is the definition of the derivative of $f$ at $a$ when the limit exists,...
@GFauxPas Actually, they aren't. "It turned out that this approach cannot be utilized in practice because after the addition of many such cutting planes severe numerical problems occur".
This is how the section on them ends in the textbook.
OK, not exactly. It also says "On the other hand, however, it was shown that the careful use of Chvatal-Gomory cuttning planes can lead to substantial improvements in linear programming" - I will have to remember that for the next time I have a convex polyeder lying around and am wondering exactly which cutting plane can be of use.
@LeakyNun Yeah, these questions have been particularly frustrating. I think for most of these that I've answered (note: I haven't dug through them myself), I've answered with the definition of the derivative, which is usually covered MUCH MUCH earlier than L-Hospital is for a calc course. Then I get a comment about how I'm actually using L-Hospital...
K-theory is actually used by some people in condensed matter
There’s a pretty well-known table which lists off the topological indices of various cond-mat systems. It’s indexed by dimension and the relevant physical symmetries, but the latter is somehow equivalent to both a K-theory statement and a random-matrix statement
Please someone take a look here: (In my notations) Exercise 26's hint says to go this way: $A\implies C\implies D \implies B$. Does not that mean $C\implies B$? But $C\implies B$ is not true since $\Bbb R$ is separable but not compact.
hmm, I am currently so far off in most of maths to maintain my maths projects and experiments in the Mathworks room. Sure I can switch from foundations to something more popular, but currently, I al so far behind in integrals and other stuff to do experiments on them without going off the trail
oh... 11 choices for the first chocolate cookie, 12 for the second, but before and immediately after the first chocolate cookie are the same...so 11 for the second, and so on for the 3 choco cookie
Alternatively: there are 13! ways to pick three chocolate cookies then ten raspberry cookies. But there are 3! ways to order the chocolates and 10! ways to order the raspberries, so it’s 13!/(10!*3!).
We construct a sequence $S$ of distinct positive integers as follows
1) the sequence $S$ starts as $1,2,3$
2) If and only If $x,y$ are in the sequence and $ x^2 + y^2 > 3 $ Then $x^2 + y^2 $ is also in the sequence.
3) the sequence is strictly increasing.
4) the sequence is completely determi...
Okay. But all the problem says is to arrange 3 boys and 2 girls. So by my reading of the question both of these arrangements correspond to bbggg and are not distinct
Is there a notion of an 'affine' approximation of a computer program? i.e. You approximate a loop as occurring either 0, 1, or infinite times (non-termination).
@Semiclassical @Abra Guys it's really nice to meet you , honestly I like to get you as new friends if you don't mind, So Can I get your profile on another websites to keep on touch ?
I don't like people who only point what is wrong with you and not telling what is right
These people will only give links to the correct material, point out that you are wrong, but afterwards, completely ignore you when you ask them after reading the link and whether you understood correctly
It does make me wonder whether they love to point out others wrong and we have to exploit this habit of them by deliberately rephrase the latter question so as to force that behaviour to be triggered
The problem is that such is impractical as for every deliberate misinformed question that is ask, it cost you reputation and hence future probability of your question being responded
Why does these people always get away from the mess they cause
They are just like hitler, a karma houdini
How is this relevant to the math chat? Well, there are at least 3 users belong to this category
(O f***, too early to quote the h bar and now that is a misquote!)
We construct a sequence $S$ of distinct positive integers as follows
1) the sequence $S$ starts as $1,2,3$
2) If and only If $x,y$ are in the sequence and $ x^2 + y^2 > 3 $ Then $x^2 + y^2 $ is also in the sequence.
3) the sequence is strictly increasing.
4) the sequence is completely determi...
I felt it might help to think of this problem geometrically: The required sequence will be 1,2,3 and all points of the integer lattice that intersect circles of positive integer radii (since the square of any integers is an integer)
I have no idea how relative density is defined. A linearly ordered set is dense if for every x,y there exists a x such that x< z<y
The integers are not dense in the usual definition of dense set, let alone a subset of them