Intereting Posts

prove : if $G$ is a finite group of order $n$ and $p$ is the smallest prime dividing $|G|$ then any subgroup of index $p$ is normal
About the strictly convexity of log-sum-exp function
Details about Cayley's Group Theorem
How to show that $\lim \frac{1}{n} \sum_{i=1}^n \frac{1}{i}=0 $?
A triangle determinant that is always zero
Real-world applications of prime numbers?
More than 99% of groups of order less than 2000 are of order 1024?
Is the dualizing functor $\mathcal{Hom}( \cdot, \mathcal{O}_{X})$ exact?
Find the trace of the matrix?
Does a Fourier transformation on a (pseudo-)Riemannian manifold make sense?
Is there an algorithm for writing an integer as a difference of squares?
Does $\sin(x+iy) = x+iy$ have infinitely many solutions?
A counter example of best approximation
Differentiable function, not constant, $f(x+y)=f(x)f(y)$, $f'(0)=2$
How to approximate simple function using step function?

Let $f$ and $g$ be non-constant complex polynomials in one variable. Let $a\neq b$ be complex numbers and suppose $f^{-1}(a)=g^{-1}(a)$ and $f^{-1}(b)=g^{-1}(b)$. Does this imply $f=g$?

If we think of entire functions instead of polynomials, the answer is negative: take $e^{-z}$ and $e^{z}$ and they share the same level sets for 0 and 1. More generally, Nevanlinna’s 5-values theorem says that 5 level sets completely determine a non-constant meromorphic function. Can we lower this number when dealing with polynomials?

- Is my proof correct? (a generalization of the Laurent expansion in an annulus)
- Evaluate these infinite products $\prod_{n\geq 2}(1-\frac{1}{n^3})$ and $\prod_{n\geq 1}(1+\frac{1}{n^3})$
- Picard's Little Theorem Proofs
- Computing $\int_{\gamma} {dz \over (z-3)(z)}$
- an analytic function from unit disk to unit disk with two fixed point
- To compute $\frac{1}{2\pi i}\int_\mathcal{C} |1+z+z^2|^2 dz$ where $\mathcal{C}$ is the unit circle in $\mathbb{C}$

- Quadratic equation, find $1/x_1^3+1/x_2^3$
- Growth estimate of an entire function
- Show an infinite family of polynomials is irreducible
- $|e^a-e^b| \leq |a-b|$
- Evaluating definite integrals
- Units of polynomial rings over a field
- Evaluate integral: $ \int_{-1}^{1} \frac{\log|z-x|}{\pi\sqrt{1-x^2}}dx$
- Quadratic Polynomial factorization
- $f$ is entire without any zeros then there is an entire function $g$ such that $f=e^g$
- Fact about polynomials

**HINT:** How many zeroes does the polynomial $f-g$ have?

**EDIT:** Suppose $\deg(f)\ge \deg(g)$. Consider how many roots $f’$ has. Account for how many distinct roots $f-g$ can have.

**FURTHER EDIT:** OK, let’s say $\deg f = n \ge \deg g$. Say there are $k$ elements in $f^{-1}(a)=g^{-1}(a)$ and $\ell$ elements in $f^{-1}(b)=g^{-1}(b)$. Assuming $f\ne g$, $f-g$ has degree $n$. Since $f-g$ has at least $k+\ell$ roots (with various multiplicities), we infer that $k+\ell\le n$.

On the other hand, each solution of $f=a$ or $f=b$ with multiplicity $\mu>1$ contributes a zero of order $\mu-1$ for $f’$. Therefore, we have

$$\deg f’ = n-1\ge (n-k)+(n-\ell), \tag{$\star$}$$

and so $n\le k+\ell-1$. This contradiction gives us the conclusion that $f=g$.

To justify ($\star$), write, for example, $f(z)-a = \prod\limits_{j=1}^k (z-\alpha_j)^{\mu_j}$. Then $\sum\limits_{j=1}^k \mu_j = n$ and $\sum\limits_{j=1}^k (\mu_j-1) = n-k$.

A polynomial of degree $n \geqslant 1$ attains each complex value exactly $n$ times, counting multiplicities. So if neither $a$ nor $b$ is attained with multiplicity $> 1$ in any point, the set $f^{-1}(a) \cup f^{-1}(b)$ has $2\deg f$ elements. How many fewer can it have if $a$ or $b$ is attained with multiplicity $> 1$ in some point(s)?

There is a very nice and short proof. Without loss of generality, let’s assume that $\deg f \ge \deg g$, $a = 0$, $b = 1$. The expression

$$\frac{f’ (f-g)}{f(f-1)}$$

is a polynomial (!), but because degree of numerator is strictly smaller than degree of denominator. Thus numerator is (identically) zero and $f’ = 0 \implies f$ is constant or $f \equiv g$.

- Proving a property of a Logic Formal Language
- Find the asymptotic tight bound for $T(n) = 4T(n/2) + n^{2}\log n$
- If $X$ is a metric space with infinitely many connected components, is $X$ compact?
- How to evaluate limiting value of sums of a specific type
- If $a,b,c$ are integers such that $4a^3+2b^3+c^3=6abc$, is $a=b=c=0$?
- Sum of these quotient can not be integer
- A very easy probability problem but opinions diverge greatly. Need some help.
- Non surjectivity of the exponential map to GL(2,R)
- How to calculate generalized Puiseux series?
- what is the name of this number? is it transcendental?
- Countable closed sets
- Weak convergence and strong convergence
- Is $\mathbb{Z}= \{\dots -3, -2, -1, 0 ,1 ,2 , 3, \dots \}$ countable?
- Words built from $\{0,1,2\}$ with restrictions which are not so easy to accomodate.
- Classification of Euclidean plane isometries