# Surjectivity of projective maps from an inverse limit to an element of the direct product

I'm doing some self-study and I'm stuck on a problem involving inverse/projective limits. Although this is NOT a homework problem, I'd really appreciate some hints rather than a completely worked out solution.

The problem is from Dummit & Foote:

I'm having a rather difficult time figuring out how to prove part (b).

I think I need to establish that for every $a_{i}\in A_{i}$, there exists some

$$\alpha=(\,\alpha_{1},\alpha_{2},\ldots,\alpha_{j},\ldots)\in\prod_{i\in I}A_{i}$$

such that $\alpha\in P$ and $\mu_{i}(\alpha)=a_{i}$. I'm just not really sure how to do that.

-

## 1 Answer

Let $a_m \in A_m$. To get what you want, you need to extend this to a sequence $(a_1, a_2, a_3, \ldots)$ such that $a_i = \mu_{j,i} (a_j)$ for all $i \le j$. Given the hypotheses, there's really only one way to proceed: by induction. If you're worried about set-theoretic details, then I will also point out that you will need the axiom of dependent choice.

-
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 7, "mathjax_display_tex": 1, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": false, "boilerplate_config": {"ratio_threshold": 0.3, "absolute_threshold": 10, "end_threshold": 15, "enable": false}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9662254452705383, "perplexity_flag": "head"}