Actually, the thing I had envisioned kind of breaks apart.. $(yx_i)x_i=x_{i+1}x_i$ where $y(x_i^2)=x_{i+2}$, so, it has to hold that $x_{i+1}x_i=x_{i+2}$
I did the same thing with topology when I was taking a course on it. While thinking about the topic, I come up with what I think might be a valid construct, but then find that I don't really understand it, or if it's even valid.
Talking about it with people helps me understand where my thoughts went off the deep end.
Though, I came up with that one by trying to describe a mechanic in a video game (Opus Magnum) via a group. In this game you can combine two lead to get a tin, combine two tin to get an iron, ect. You can also combine a quicksilver with any metal to get the next highest level.
@TedShifrin I mean, a basis is a thing that always exists for vector spaces, but the choice of it, in general, is completely arbitrary. So I wondered what happens if we would not choose any basis at all.
If i were to embark in a quest to find a non-recursive formula that would give me the number of ways i can associate a word, given a non-associative binary operation; do you think i would be able to succeed in 2 weeks or less?
I (with help from a MSE user) used the following substitution to seperate variables in a second order linear PDE
$$\theta_w = e^{-\beta_hx}F'(x)e^{-\beta_cy}G'(y)$$
The following two ODEs (Eigenvalue problems) are a result of applying variable seperation to a system of three coupled PDEs
\begi...
@Zerix You have the implication backwards: if a function is differentiable, then it is continuous. (There are functions which are continuous on the whole real line but differentiable nowhere!) Your question is the contrapositive of this statement, so yes, it would be okay to say that.
The trajectories of two point masses with respect to their center of mass are conic sections or Kepler orbits.
But what if the bodies have finite size with respect to their separation, and not necessarily uniform, or even spherically symmetric mass distributions?
That though then led me to wond...
Since I have given some further though to my question I thought it would be better to write it down.
user131753
Let $F:(\mathbf{S},U)\to(\mathbf{T},V)$ be a concrete functor. For each $\mathbf{X}$-objects $X,Y$ consider the following full subcategory $\mathsf{PairFibre}_{\mathbf{S}}(X,Y)$ of $\mathbf{S}$ whose object class is the union of the $\mathbf{S}$-fibres of $X$ and $Y$. Similarly consider the full subcategory $\mathsf{PairFibre}_{\mathbf{T}}(X,Y)$ of $\mathbf{T}$ whose object class is the union of the $\mathbf{T}$-fibres of $X$ and $Y$.
user131753
Thus a concrete functor $F:(\mathbf{S},U)\to(\mathbf{T},V)$ is a concrete isomorphism iff for each $\mathbf{Set}$-objects $X,Y$, there exists an isomorphism $G_{(X,Y)}:\mathsf{PairFibre}_{\mathbf{S}}(X,Y)\to\mathsf{PairFibre}_{\mathbf{T}}(X,Y)$ such that the following diagram,
So, informally we can think of a concrete isomorphism as a "paired-local" version of an isomorphism in the sense that a concrete isomorphism is determined by focusing at the same pair of "structures" under two different guises. It is in this sense that so far we care only about the categorical properties, the $\mathsf{PairFibre}_{\mathbf{S}}(X,Y)$ and $\mathsf{PairFibre}_{\mathbf{T}}(X,Y)$ are "essentially same".
user131753
Hence, in particular when $X=Y$ we conclude that since $\mathsf{PairFibre}_{\mathbf{S}}(X,X)$ and $\mathsf{PairFibre}_{\mathbf{T}}(X,X)$ for categorical investigations an $\mathbf{S}$-structure can be completely substituted by a $\mathbf{T}$-structure.
user131753
6:08 AM
In other words for each categorical property of $\mathbf{S}$-objects and $\mathbf{S}$-morphisms there exists a logically equivalent formulation of the "essentially same" property by $\mathbf{T}$-objects and $\mathbf{T}$-morphisms and vice versa. Does this way of seeing things sound all right @KarlKronenfeld @MikeMiller?
We have a rational polynomial that has two complex roots and we want to show that it cannot be written in the form f=gh where neither g nor h are units, or not? @LeakyNun
Ah I understand that so far... so we suppose that f is irreducible then from your hint we have that if a is a root then its conjugate must also be a root of f. Since it is given that f(a)=f(a+1)=0 a+1 must be a conjugate of a. To get a contradiction we have to show that a+1 is not a conjugate of a? @LeakyNun
Hey quick question, my book says that a subset $E$ is dense in $X$ if every point in $X$ is a limit point of $E$, or a point in $E$. So by definition every set is dense in itself right, due to it satisfying the latter?
In mathematics, a subset
A
{\displaystyle A}
of a topological space is said to be dense-in-itself if
A
{\displaystyle A}
contains no isolated points.
Every dense-in-itself closed set is perfect. Conversely, every perfect set is dense-in-itself.
A simple example of a set which is dense-in-itself but not closed (and hence not a perfect set) is the subset of irrational numbers (considered as a subset of the real numbers). This set is dense-in-itself because every neighborhood of an irrational number
...
@SirCumference caveats: 1. usually $X$ is the ambient space, so you need the subspace topology to talk about a set being dense in itself; 2. a more concise definition would be $X \subseteq \overline{E}$ where $\overline E$ is the closure of $E$
@Mary if the assumption is that $a$ and $a + 1$ are conjugates then a more precise statement would be that there exists an $r \in G$ such that $r(a) = a + 1$ (since $G$ acts transitively on the roots of $f$)
I have also an other quesion.. It holds that $Gal(\mathbb{Q}(\zeta )/\mathbb{Q})$ is isomorphic to $(\mathbb{Z}/n\mathbb{Z})^{\times}$. Does this mean that $|Gal(\mathbb{Q}(\zeta )/\mathbb{Q})|=|(\mathbb{Z}/n\mathbb{Z})^{\times}|$ ? @ÍgjøgnumMeg
Since we have a bijection they must have the same cardinality, right? What I am trying to show is that $[\mathbb{Q}(\zeta):\mathbb{Q}]=\phi(n)/2$ for $n\geq 3$. Can we show that with the above one? @AlessandroCodenotti
@MaryStar Yes they have the same cardinality and no you can't show that because it's false, $[\Bbb Q(\zeta):\Bbb Q]=\varphi(n)$ (assuming $\zeta$ is a primite n-th root of unity since you didn't say that but that's what it usually means)
Ok! So we have that $|Gal(\mathbb{Q}(\zeta )/\mathbb{Q})|=|(\mathbb{Z}/n\mathbb{Z})^{\times}|$. We also have that $\mathbb{Q}(\zeta)$ is the splitting field of the cyclotomic polynomial is $\Phi_n$. Does it follow from that that $[\mathbb{Q}(\zeta):\mathbb{Q}]=\deg \Phi_n=\phi (n) ?
The main result you want to know here is that if $K/F$ is a field extension and $G=\mathrm{Gal}(K/F)$ then denoting with $K^G$ the fixed field of $G$ we have $[K:K^G]=|G|$. So in particular for Galois extensions we have $K^G=F$ and $[K:F]=|G|$. So the question is now wether $\Bbb Q(\zeta)$ is a Galois extension of $\Bbb Q$ or not, what do you think?
So the exercise statement that $[\mathbb{Q}(\zeta):\mathbb{Q}]=\phi(n)/2$ for $n\geq 3$ is wrong, isn't it? It must be $\phi (n)$ ? @AlessandroCodenotti
Right, well you'll want to use the fact that a purely inseparable extension $L/F$ is one such that for every element $a \in L$ you have $a^q \in F$ for some $q = p^k$, $p$ a prime
and a normal extension $K/L$ is one such that every irreducible polynomial $f(X) \in L[X]$ either remains irreducible in $K[X]$, or splits into (not necessarily distinct) linear factors over $K$
hmm, rephrase
a normal extension $K/L$ is one such that every irreducible polynomial in $L[X]$ has either no root in $K$, or splits into (not necessarily distinct) linear factors over $K$
In this example, they say that x+infinity = infinity but infinity is not the neutral element. However, they are mixing up infinity as a set, and infinity as an element of the set of infinity.
X + infinity = infinity only because on the left we have one element from the set of infinity and on the right we have an entirely different element of infinity, but these two elements are not equal.
I don't have the karma on mathematics to comment to him to ask him to amend his answer, and I don't want to look like I am vandalizing an answer that others have already upvoted, but the fact that this is an upvoted answer on Mathematics just further ingrains the problem that others don't understand that infinity as a set is not the same as infinity as an element.
I also don't want to give another answer to the problem as there is already an accepted answer that is very good.
What would be the best course of action in this case for me?
What are you trying to link? The second to top answer?
There is no issue what that answer. He merely defines a binary operation on $\Bbb R \cup \{\infty\}$ which no longer has additive inverses. Here $\infty$ is no more than a symbol.
@ChthonicOne What is the 'set of infinity'? Do you mean the ordinal \omega? What do you mean by infinity as an element? An element of what? If an element of the set Mike has suggested, I see no problem, otherwise I'm confused about what you've written
@ChthonicOne Do you know of countable vs uncountably infinite sets, etc
Sorry, having computer issues here, so I was offline with IT around for a bit. Yes, I know the difference between countably and uncountably infinite sets. The set of all integers for example is countably infinite, and the set of all real numbers is uncountably infinite. I can also prove based on that that the set of all rational numbers are countably infinite because of a diagonalization method.
Mike, I missed the part where he was overloading the infinity symbol with a new meaning, I withdraw my complaint at it, maybe I will think of formatting though to help clarify that this is what he was doing, as it was easy for me to miss.
Also, user616128 I did not say the set of infinity, but that we often use infinity as a set of all numbers that are not finite in nature. Infinity itself is not a number, unless we are drawing from this set, in which it becomes a number.
The fact that we use infinity for both is rather confusing for those that haven't grasped this. Because the set of all non finite numbers is a set, if I were to take one element alpha from the set, and then take another element beta from the set alpha only equals beta if beta is in fact alpha all along. Sets do not include duplicates.
Thus infinity + 1 = infinity only makes sense if we understand that each infinity in the equation is a different element in the set, where their difference is exactly 1.
Every symbol you've ever seen is overloaded. It's about determining what they mean from context.
On the other hand I have never seen, in my life, the symbol $\infty$ to denote an infinite set of natural numbers.
There's $\omega$, which symbolizes $\Bbb N$ as an ordered set. And people write $\aleph_0$ for the cardinality of the integers (that is, if any set is in bijection with the integers, we say that set has cardinality $\aleph_0$).
I think there is some deep confusion here but I'm not sure I understand what it is. Note that the set of naturals is in bijection with $\Bbb N \cup \{x\}$, where $x$ is a new element.
Next, there is no "set of all non finite numbers" (maybe you mean the proper class of infinite ordinals - but it is not a set), and second, they do not have a subtraction operation.
I am suggesting you contact the undergraduate coordinator in math or some other relevant person to find out how much liberty you'll have to pick courses. I'm suspecting you will have liberty like regular math majors, but it doesn't hurt to ask ahead.
So I have a doubt that should be really easy in algebraic topology
I'm looking at a torus and the two projections $\pi_1,\pi_2:S^1\times S^1\to S^1$
I take generators of the two $H^1(S^1)$ and those notes state that taking their image through $H^1(\pi_i)$ gives generators of $H^1(S^1\times S^1)$, why is that?
I think that the intuition of "measuring how inexact $\otimes$ and Hom are" is useful, but you can't compute anything if you only know that they are derived functors
@AlessandroCodenotti But better: there is a natural iso $H^1(X;G) \cong \text{Hom}(\pi_1 X, G)$, and so this follows from your statement about $\pi_1$ of a product
@TobiasKildetoft i think it's ok to let someone understand resolutions and then in a year see why there was a corresponding categorical framework built
@MikeMiller Sure, but you are really just writing down the proofs for derived functors in special cases (without even altering the notation). I don't disagree that it is a fine thing to do to keep things concrete, though.
Apparently coefficients are taken in a "band" but I cannot quite tell what these are
Aha, but a sheaf of groups gives a band in a tautological way, and these still have second cohomology
So it seems that in general you still have a second cohomology for sheaves of groups over a scheme, and I am sure the scheme structure is not crucial here
@MikeMiller Ok, I just looked up the algebraic version. If $X$ is a $G$-set then we can define $H^0(G,X)$. If it is a $G$-group, we get $H^1(G,X)$ (a pointed set). If $X$ is further abelian, then we can also get $H^2(G,X)$.
what relationship if any is there between all possible paths from the starting node (top left corner) and the ending node(bottom right) in a matrix and the binomial coefficients of all right hand columns?
there also might not be one, just came across something that looked interesting and was wondering if there was some higher level concept I might be missing.
@Rithaniel I do not know. I am asking what the parts that make up a logical disjunction are called. For example, in $a+b$, $a$ and $b$ are the addends and $+$ is the sum
I mean it depends on the context, if that book is a linear algebra book then they only care about linear isometries in which case it doesn't matter whether you phrase things in terms of the norm or metric
Yeah. I thought my old linear algebra book would be worth looking over with regard to normed vector/inner product spaces, tho it makes a lot of simplifications
If I have a context-free grammar that generates a language $L \subseteq \Sigma^*$, is it possible to obtain the generating function for the number of words in $\Sigma^n$ that have $m$ prefixes in $L$? Analytic Combinatorics by Flajolet and Sedgewick has an analysis for the case of regular grammars.