3k views

Does the open mapping theorem imply the Baire category theorem?

A nice observation by C.E. Blair1, 2, 3 shows that the Baire category theorem for complete metric spaces is equivalent to the axiom of (countable) dependent choice. On the other hand, the three ...
5k views

A short proof for $\dim(R[T])=\dim(R)+1$?

If $R$ is a commutative ring, it is easy to prove $\dim(R[T]) \geq \dim(R)+1$. For noetherian $R$, we have equality. Every proof I'm aware of uses quite a bit of commutative algebra and non-trivial ...
3k views

The Ring Game on $K[x,y,z]$

I recently read about the Ring Game on Mathoverflow, and have been trying to determine winning strategies for each player on various rings. The game has two players and begins with a commutative ...
2k views

How prove this matrix inequality $\det\left(6(A^3+B^3+C^3)+I_{n}\right)\ge 5^n\det(A^2+B^2+C^2)$?

Question: let matrices $A,B,C\in M_{n}(C)$ be Hermitian and Positive definite matrices, such that:$$A+B+C=I_{n}$$ Show that: $$\det\left(6(A^3+B^3+C^3)+I_{n}\right)\ge 5^n\det(A^2+B^2+C^2)$$ ...
3k views

Identification of a curious function

During computation of some Shapley values (details below), I encountered the following function: $$f\left(\sum_{k \geq 0} 2^{-p_k}\right) = \sum_{k \geq 0} \frac{1}{(p_k+1)\binom{p_k}{k}},$$ where ...
5k views

A variation of Fermat's little theorem

Fermat's little theorem states that for $n$ prime, $$a^n \equiv a \pmod{n}.$$ The values of $n$ for which this holds are the primes and the Carmichael numbers. If we modify the congruence ...
2k views

What properties of busy beaver numbers are computable?

The busy beaver function $\text{BB}(n)$ describes the maximum number of steps that an $n$-state Turing machine can execute before it halts (assuming it halts at all). It is not a computable function ...
748 views

Is There An Injective Cubic Polynomial $\mathbb Z^2 \rightarrow \mathbb Z$?

Earlier, I was curious about whether a polynomial mapping $\mathbb Z^2\rightarrow\mathbb Z$ could be injective, and if so, what the minimum degree of such a polynomial could be. I've managed to ...
3k views

Grothendieck 's question - any update?

I was reading Barry Mazur's biography and come across this part: Grothendieck was exceptionally patient with me, for when we first met I knew next to nothing about algebra. In one of his first ...
840 views

Is there a categorical definition of submetry?

(Updated to include effective epimorphism.) This question is prompted by the recent discussion of why analysts don't use category theory. It demonstrates what happens when an analyst tries to use ...
786 views

Are there infinite many $n\in\mathbb N$ such that $\pi(n)=\sum_{p\leq\sqrt n}p$?

Are there infinite many $n\in\mathbb N$ such that $$\pi(n)=\sum_{p\leq\sqrt n}p,\tag{1}$$ where $\pi(n)$ is the Prime-counting_function? For example, ...
2k views

Continuous projections in $\ell_1$ with norm $>1$

I was trying to find papers and articles about non-contractive continuous projections in $\ell_1(S)$ where $S$ is an arbitrary set. If it is not studied yet, I would like to know results for the case ...
936 views

Differential forms on fuzzy manifolds

This post will take a bit to set up properly, but it is an easy read (and most likely easy to answer); in any event, please bear with me. Question In the usual setting of open subsets of ...
Estimate for $n$th prime
A good approximation I have found for $p_{n}$ is \begin{align} \int_{2}^{n}\log (x \log (x \log (x)))\ dx\\ \end{align} and seems to be a better estimate than $n \log (n)$. The error term seems to ...
Mathematica knows that the logarithm of $n$ is: $$\log(n) = \lim\limits_{s \rightarrow 1} \zeta(s)\left(1 - \frac{1}{n^{(s - 1)}}\right)$$ The von Mangoldt function should then be: ...