@AsafKaragila The annoying thing is that I was stuck at something seemingly unrelated and it took me a hell of a long time to see that I was just looking for those darn families...
@tb I see. I know that often mathematicians prefer to try on their own and not ask other people for help. I can tell you that several times I began writing an email, which essentially made me put the question into exact details - and solve it on my own.
I know that effect too well... That's why I ask so few questions on this site. While writing them up I solve them :)
@JonasTeuwen well, it really depends on how you're taught complex analysis. Our prof lulled us into sleep for about two months by massaging formal power series. When I started realizing that the action had begun, it was already over. :)
@AsafKaragila thanks for spelling it out, I was aware of it.
@JonasTeuwen The Riemann integral gives you the $L^2$-norm, right? So the completion is $L^2$. Who wants to know that the completion consists of classes of measurable functions? :)
@AsafKaragila I see: The König doing grassroot campaigning.
@JonasTeuwen It will. You probably have regulated functions in mind, but there the issue is that you take the uniform completion of the step functions in order to guarantee that the limit function is still integrable.
@JonasTeuwen Put differently: The Riemann integral gives you a functional on $C[0,1]$. So the measure's already there by Riesz-Markov.
Yes. So, here we are also having the fact that Automorphism preserves the order of the element. So, this seems to be more natural. Is this correct line of thought for this choice of decomposition?
@MarianoSuárezAlvarez If $A = k[t]$ is a polynomial ring then shouldn't my homomorphism $f : A \rightarrow M$ be completely determined by say the image of the indeterminate $t$ in $M$?
Thanks for the context. Kannapan has started a commutative algebra room where we discuss AM. I told him it is not possible to do AM without knowing general topology
I have just thought too long about this problem, but I think my answer should be convincing, even if lacking some of the rigor that I usually like to give to answers. After having thought about it for a long time, I saw this and said, "of course!"
@RajeshD I think a lot of the voting frenzy was because the problem is hard to think about using normal tools. The problem is pretty simple, but you have to use simpler optimization techniques. I think that the simplicity of the answer will prevent the voting frenzy to continue to my answer :-)
spose i received over 100 poiunts in a day and i look at my reputation and it lists the questions. but those questions aren't changed, or voted on, or anything...
@Jeff Your answer was downvoted because it did not sound satisfying to the person who did it. And, they are expected to drop in a line as to why they downvoted the post. But most people don't.
@Kanna A partition of n is something like (a1,a2,...) with the entries' sum being n. The number of partitions of n is p(n). So "is equal to the partition of n" is bad English. Also, I could have swore there was a closed-form for p(n) in the news recently...
I feel like I have seen news that a paper was recently published, at most a few months ago, that solved the well-known problem of finding a closed-form expression for the partition function $p(n)$ which enumerates the number of integer partitions of $n$: does anybody have the reference of this pa...
@Kannappan: Re-reading, to me it looks like what the OP wants is set partitions of a set X of size n quotiented by the equivalence relation x~gx where g is the action of $S_X$ on partions of $X$.
Actually, scratch that, I have no idea what he is talking about.
@robjohn After reading your answer, I am impressed with the question too..(no complaints) !.........But i did not understand at one point...How did you get (3) from (1) and (2)...a small elaboration is required for me to appreciate
Rumpelstiltskin is the eponymous character and antagonist of a fairy tale which originated in Germany (where he is known as Rumpelstilzchen). The tale was collected by the Brothers Grimm, who first published it in the 1812 edition of Children's and Household Tales. It was subsequently revised in later editions.
Plot
In order to make himself appear more important, a miller lied to a king, telling him that his daughter could spin straw into gold. The king called for the girl, shut her in a tower room with straw and a spinning wheel, and demanded that she spin the straw into gold by morn...
@RajeshD Are you still there? I've now looked at your argument, but I'm pretty confused by it, to be honest.
For instance, I do not understand this:
> The minimum value of $n$ = sum of, the number of times $f_1$ is differentiable at $\tau-x$ and the number of times $f_2$ id differentiable at $x$, $\forall x \in (0,1)$.
This reminds me of a conversation I overheard in the lift to the library: A: do you use highlighters? B: Yes I started using them recently. A: Good, they're immensely practical. You can see immediately if you're reading something for the second time
@AsafKaragila Don't worry, you'll find plenty of ways to avoid that :p
Good. Now to email Magidor and ask him which of these theorems we already covered in class, because I cannot remember!
@tb It's not the first time he's been doing that.
Once he did that after his answered turned into CW. I flagged another answer which was CW-ified to be un-CW and mentioned his answer and that someone should look into that.
I was hoping to write an answer to that new question on AC, but I simply don't understand what on earth does that guy want me to answer.
I'm in serious want of dexterity when it comes to any kind of juggling. The only thing I really could handle was the diabolo. No I'm amply satisfied by just sitting in the sun (provided it's warm enough, which it currently isn't) :)
@tb Well, I used to have several friends from Norway related to the metal scene. I've since cut ties with "everyone" several times so by now I'm not in touch with any of them.
Notation question: given a cardinal $\kappa$ how do you usually denote the cardinality of the iterated powerset, that is $\kappa_0 = \kappa$ and $\kappa_{n+1} = 2^{\kappa_n}$?
$\mathcal P^\alpha(\kappa)$, if you want $\alpha\ge\omega$ then you have to specify what happens at limit points though (direct limit usually works fine).
There's a variation on $\beth$ numbers in which you also note the starting point. That could come in handy too if you prefer it that way.
Quick question on algebra: "Describe the set of equivariant maps $G/H\to G/K$." Would I be correct saying they are $xH \to xvK$ for each element in the set of $v$ such that $vHv^{-1}\subseteq K$ quotient'd by the action of $H\cap K$?
@AsafKaragila Yes, that's what I encountered most frequently. Thanks, that's about what I wanted to hear, I'll just write down the iterative definition since I don't seem to need to use that systematically.
I've written up the isomorphic classification of some special types of Banach spaces and for one type there's a cardinal invariant of this form coming up.