Take the 2-minute tour ×
MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

Let $p$ and $\ell$ be distinct rational primes. Note that the unit group of the finite field $\mathbb{F}_\ell$

is of order $\ell-1$, hence there is the probability of finding a $p$-quotient from $\mathbb{F}_\ell^\times$.

When taking the infinite product $\prod_{\ell\neq p}\mathbb{F}_\ell^\times$, how large could its maximal pro-p quotient be? And do we have a comuptable bound for the p-valuation of $\ell -1$ when $\ell$ tends to infinity?

(My original question was about pro-p quotient of the tame inertia group of a p-adic local field, which didn't make sense for obvious reason (pointed out as below), and I propose the replace it with this one)

share|improve this question
4  
Tame inertia is prime-to-$p$ by definition, and is isomorphic to $\prod_{\ell \neq p} \mathbb Z_{\ell}$. –  Emerton Mar 3 '11 at 8:33
    
And do we have a comuptable bound... As there is an $l$ which is $\equiv1\pmod{p^n}$ for every $n>0$, how can there be such a bound ? –  Chandan Singh Dalawat Mar 3 '11 at 11:55
1  
The answer to your new first question is "infinite". An easy computable upper bound for your second question is $\log \ell/\log p$. Standard conjectures about the asymptotic behavior of primes suggest that this bound is sharp up to subtraction by a constant. I am thinking of closing this question. –  S. Carnahan Mar 3 '11 at 13:45

1 Answer 1

I think the tame ramification group is isomorphic to $\prod_{\ell\neq p}\mathbb{Z}_\ell$, not $\prod_{\ell\neq p}\mathbb{Z}_\ell^\times$. See for example, pp.12 of the book "Gauss sums, Kloosterman sums, and Monodromy Groups" by N. Katz.

.

share|improve this answer
4  
The structure of the maximal tamely ramified extension of a local field was determined before N. Katz was born. See for example Hasse's Number Theory (Chapter 16) or jstor.org/stable/1992998 –  Chandan Singh Dalawat Mar 3 '11 at 12:05

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.