If I have a vector space $X$ with a translation invariant topology, does it follow that showing continuity of a linear operator $T : X \times X \to X$ reduces to showing continuity at $(0,0)$?
Decided not to continue auditing it, I didn't have much time to learn certain background things he thought we knew like tensors and Lie derivatives, and the first couple lectures weren't that good
It's tricky navigating a course when you don't know what people actually know. I always preferred to teach year-long sequences and be to blame for what they didn't know :P
Well, when a lot of teachers require nothing from the students to get an A (in advanced grad courses) and I require stuff, it's not unexpected to get some feedback :P
Thankfully there was someone there who knew a good bit of GR and independently saw stuff like tensors and vector bundles (the main stuff people struggled with) and they pulled it off
And I think people said that reading first chapter of Do Carmo mostly fixed the problems in that regard. The only person I asked about the second pset said that his main difficulty was in solving the ODEs
Yeah here there's the double whammy in grad school that every grad student has to take the full year of algebra/analysis/topology, while a number of them already don't care much for some subset, and then they only have to pass rather the class
I told my class yesterday that I was not going to teach any more for AoPS because I was too frustrated about the lack of responsiveness/work outside of class.
The year I took analysis, only one grad student in the class was interested in analysis. So aside from that guy it was the undergrads who cared and the grads who didn't
Ah, that's fair enough. In my abstract algebra course this semester there are about 10 education majors, and you can tell they're not feeling the subject matter.
Generally, sadly, math education majors/grad students don't have much love for math. I think that explains a lot of the problems with education in this country.
Basically the professor was trying to balance having a general interest that was more geometric vs commutative algebra for the people who were going that direction and it didn't work too well
I know 2 years ago apparently it mostly avoided commutative algebra, half because the professor himself doesn't seem to like it that much and half because he was like yeah the algebraists all place out so I'm assuming everyone here is an analyst and doesn't care about commutative algebra
Then the year after another guy taught and made it mostly commutative algebra + a bit of varieties + Cech cohomology at the end from nowhere and everyone was like uhhh. Then apparently this year was more of an experiment, in part from requests to make things more geometric
It's got 3 "underground" floors (quotation marks because the place is on a very tall hill so the first 3 floors are a good bit above the the street), and then 9 floors above ground. The grad lounge is in the top floor and overlooks the city and lake, it's real nice
The basement floors have the library and all the classrooms (each of them has a lot more area than the higher ones), floor 1 is basically just the entrance, I'm not sure what's on the second floor, 3-8 is all offices, and 9 has the ground lounge mainly
And then there's one weird area called the math bunker that's trickier to access, you have to leave the building from the first floor, head outside (still walking on the roof of the basement floors), go to this other structure, and then get in. Some number of grad student cubicles are there (other grad students get offices in the main building)
It's hard to get a feel for which places are good at undergrad math. Highly ranked places are known for having good researchers but there's no "How well does this place teach?" ranking which is kinda more relevant if you're an undergrad
I think interest might have started the trend, though it is true that grad admissions now is starting to make it closer to an expectation (friends of mine say that for experimental physics, classes and all definitely don't cut it anymore)
things have gotten much more competitive and university funding is becoming more weird and disastrous and making it in the sciences doing research has become insanely hard and opaque
so there's a lot of resume padding that happens bc if everyone is doing it ull be uncompetitive if you dont do it too
even if it doesnt reproduce the internal benefits it should, it all becomes a game
In math I don't have a clear picture. It seems there are a lot of Mickey Mouse projects that people seem to not help people much, but more and more people seem to do more serious things and that seems to become a bonus
One of my professors said it to describe a bunch of REUs, basically boils down to problems that some of these give their students which nobody really cares about but which undergrads could work on and get a paper out of
@TedShifrin i think universities have been ostensibly a game of credentialism for a long time, they just used to be gated off to a lot more people than they are now (see: ppl from backgrounds like mine) and now that budgets shrink to nothing (while administrative costs balloon) the problem gets harder and harder for students
In order to show that $x=0$ is asymptotically stable, one needs to show that $$\forall \varepsilon > 0, \; \exists\, T > 0 \; \mathrm{s.t.} \; t > T \implies || x ( t ) - 0 || < \varepsilon.$$
The intuitive sketch of the proof is that one has to fit a sublevel set of continuous functions $...
Yeah in general no, I think it's just that Peter (who organizes the one here) very much doesn't believe in the usual REU format, he just wants it to be 8 weeks of learning math casually
"If $U$ is a domain in $\Bbb C$ and $K$ is a compact subset of $U$, then for all holomorphic functions on $U$, we have $\sup_{z \in K}|f(z)| \leq C_K \|f\|_{L^2(U)}$ with $C_K$ depending only on $K$ and $U$" this took me way longer than it should have
@Silent I'm not sure. I think the maximum and minimum of $||Av||/||v||$ will depend on the inner product between the eigenvectors for the two eigenvalues
Well, $A$ has these two dictinct eigenvalues meaning that $A$ can be diagonalised to a diagonal matrix with these two values as its diagonal. What will that mean when multiplied to a given vector (x,y) and how will the magnitude of that vector changed?
Alternately, compute the operator norm of $A$ and see if it is larger or smaller than 2, 1/2
Generally, speaking, given. $\alpha=a+b\sqrt{\delta}$, $\beta=c+d\sqrt{\delta}$ we have that multiplication (which I am writing as $\otimes$) is $\alpha\otimes\beta=(a\cdot c+b\cdot d\cdot\delta)+(b\cdot c+a\cdot d)\sqrt{\delta}$
so you basically want to check whether $(\alpha \otimes \beta) \otimes \gamma = \alpha \otimes (\beta \otimes \gamma)$. Bruteforcing it works but is super messy looking
Yep, the reason I am exploring alternative routes of showing associativity is because writing out three elements worth of variables is taking up more than a single line in Latex, and that is really bugging my desire to keep things straight.
hmm... I wonder if you can argue about the rationals forming a ring (hence using commutativity, associativity and distributivitity). You cannot do that for the field you are calculating, but you might be able to take shortcuts by using the multiplication rule and then properties of the ring $\Bbb{Q}$
for example writing $x = ac+bd\delta$ and $y = bc+ad$ we then have $(\alpha \otimes \beta) \otimes \gamma = (xe +yf\delta) + (ye + xf)\sqrt{\delta}$ and then you can argue with the ring property of $\Bbb{Q}$ thus allowing you to deduce $\alpha \otimes (\beta \otimes \gamma)$
So there's a question I've been thinking about a lot for a long time. Maybe about a year. The question is: out of all arithmetic statements, which ones are provable?
Of course, the answer is determined once you choose a working theory.
I feel like there's a vague consensus that an arithmetic statement is "provable" if and only if ZFC proves it. But I wonder what makes ZFC so great, that it's the standard working theory by which we judge everything.
I'm not sure if I'm making any sense. Let me know if I should either clarify what I mean or shut up. :D
I've thought about alternate sets of axioms. But establishing anything worthwhile from a given set of fundamental axioms is a lot of work (at least, I get that impression)
Associativity proofs in general have no shortcuts for arbitrary algebraic systems, that is why non associative algebras are more complicated and need things like Lie algebra machineries and morphisms to make sense of
Axiom of choice make things like SUPER EASY, as otherwise you will have to demonstrate a procedure to get you to the end of a proof, this often means to check every single case
whereas axiom of choice allows you to just find some well ordered set of any cardinality, without need to worry about the details within, and it will does all the counting for you
Basically, if you want to prove a property about a set you can reduce the number of cases to just one by saying this proof is obvious and left as an exercise to the reader.
One aspect, which I will illustrate, of the "push-button" efficacy of Isabelle/HOL is its automation of the classic "diagonalization" argument by Cantor (recall that this states that there is no surjection from the naturals to its power set, or more generally any set to its power set).
theorem ...
The axiom of triviality is also used extensively in computer verification languages... take Cantor's Diagnolization theorem. It is obvious.
(but seriously, the best tactic is over powered...)
Extensions is such a powerful idea. I wonder if there exists algebraic structure such that any extensions of it will produce a contradiction. O wait, there a maximal algebraic structures such that given some ordering, it is the largest possible, e.g. surreals are the largest field possible
It says on Wikipedia that any ordered field can be embedded in the Surreal number system. Is this true? How is it done, or if it is unknown (or unknowable) what is the proof that an embedding exists for any ordered field?
Here's a question for you: We know that no set of axioms will ever decide all statements, from Gödel's Incompleteness Theorems. However, do there exist statements that cannot be decided by any set of axioms except ones which contain one or more axioms dealing directly with that particular statement?
"Infinity exists" comes to mind as a potential candidate statement.
Well, take ZFC as an example, CH is independent of ZFC, meaning you cannot prove nor disprove CH using anything from ZFC. However, there are many equivalent axioms to CH or derives CH, thus if your set of axioms contain those, then you can decide the truth value of CH in that system
@Rithaniel That is really the crux on those rambles about infinity I made in this chat some weeks ago. I wonder to show that is false by finding a finite sentence and procedure that can produce infinity
but so far failed
Put it in another way, an equivalent formulation of that (possibly open) problem is:
> Does there exists a computable proof verifier P such that the axiom of infinity becomes a theorem without assuming the existence of any infinite object?
If you were to show that you can attain infinity from finite things, you'd have a bombshell on your hands. It's widely accepted that you can't. If fact, I believe there are some proofs floating around that you can't attain infinity from the finite.
and Terry Tao in one of his blog mentioned something about some infinitistic proposition has a one to one correspondence with a finitistic proposition (let me dig that up...)
My philosophy of infinity however is not good enough as implicitly pointed out when many users who engaged with my rambles always managed to find counterexamples that escape every definition of an infinite object I proposed, which is why you don't see my rambles about infinity in recent days, until I finish reading that philosophy of infinity book
The knapsack problem or rucksack problem is a problem in combinatorial optimization: Given a set of items, each with a weight and a value, determine the number of each item to include in a collection so that the total weight is less than or equal to a given limit and the total value is as large as possible. It derives its name from the problem faced by someone who is constrained by a fixed-size knapsack and must fill it with the most valuable items.
The problem often arises in resource allocation where there are financial constraints and is studied in fields such as combinatorics, computer science...
O great, given a transcendental $s$, computing $\min_P(|P(s)|)$ is a knapsack problem
hmm...
By the fundamental theorem of algebra, every complex polynomial $P$ can be expressed as:
$$P(x) = \prod_{k=0}^n (x - \lambda_k)$$
If the coefficients of $P$ are natural numbers , then all $\lambda_k$ are algebraic
Thus given $s$ transcendental, to minimise $|P(s)|$ will be given as follows:
Thus minimisation of $|P(s)|$ means every factor $|s - \lambda_k| < 1$
However, there are countably many such $\lambda_k$ to bring $|s - \lambda_k| < \epsilon$ for some $\epsilon > 0$, thus $|P(s)|$ can be as small as we want
Whenever I see a function like that, my first instinct is to try and identify things I can replace such that the value of the function increases for all $z$.
The first thing I think of with that particular one is to replace the $(1+z^2)$ with $z^2$. Though, this is just at a cursory glance, so it would be worth checking to make sure that such a replacement doesn't have any ugly corner cases.
In number theory, a Liouville number is a real number x with the property that, for every positive integer n, there exist integers p and q with q > 1 and such that
0
<
|
x
−
p
q
|
<
1
q
n
.
{\displaystyle 0<\left|x-{\frac {p}...
Do these still exist if the axiom of infinity is blown up?
Hmmm...
Under a finitist framework where only potential infinity in the form of natural induction exists, define the partial sum:
$$\sum_{k=1}^M \frac{1}{b^{k!}}$$
The resulting partial sums for each M form a monotonically increasing sequence, which converges by ratio test
therefore by induction, there exists some number $L$ that is the limit of the above partial sums. The proof of transcendentally can then be proceeded as usual, thus transcendental numbers can be constructed in a finitist framework
There's this theorem in Spivak's book of Calculus:
Theorem 7
Suppose that $f$ is continuous at $a$, and that $f'(x)$ exists for all $x$ in some interval containing $a$, except perhaps for $x=a$. Suppose, moreover, that $\lim_{x \to a} f'(x)$ exists. Then $f'(a)$ also exists, and
$$f'...
and neither Rolle nor mean value theorem need the axiom of choice
Thus under finitism, we can construct at least one transcendental number. If we throw away all transcendental functions, it means we can construct a number that cannot be reached from any algebraic procedure
Therefore, the conjecture is that actual infinity has a close relationship to transcendental numbers. Anything else I need to finish that book to comment
typo: neither Rolle nor mean value theorem need the axiom of choice nor an infinite set
Working on the last abstract algebra homework of the semester.
Current task is to show that in the field $\mathbb{Q}[\sqrt{\delta}]$ the function that takes $a+b\sqrt{\delta}$ to $a-b\sqrt{\delta}$ is an automorphism.
Nice :) $\delta$ being a square free integer? Usually people write $\Bbb Q(\sqrt{\delta})$ for that field (though the notations are equivalent in this case)
Ultimately it's going to be fairly easily, but I want to get the bijective-ness out of the way by saying that $a-b$ is unique for every $a+b$. Doing that cleanly has be stopped for the moment.
An abelian group $(R,+)$ equipped with a second binary operation $(\cdot)$ such that $(R\setminus\{0\},\cdot)$ is an abelian group and $(a+b)\cdot c=a\cdot c+a\cdot b, \forall a,b,c\in R$
Right, if the kernel is the whole field then you have the trivial map so if you want something interesting you need the kernel to be trivial, but what does it mean for a kernel to be trivial?
> are there palindromes such that the explosion of palindromes is a palindrome nonstop palindrome explosion palindrome prime square palindrome explosion palirome prime explosion explosion palindrome explosion cyclone cyclone cyclone hurricane palindrome explosion palindrome palindrome explosion explosion cyclone clyclonye clycone mathphile palirdlrome explosion rexplosion palirdrome expliarome explosion exploesion