## Return to Answer

2 added strengthening

Let $\vec{a} \in A^{<\omega}$. There are uncountably many automorphisms $f$ and only countably many possible values for $f(\vec{a})$, so there must be two different automorphisms $f_1$ and $f_2$ with $f_1(\vec{a}) = f_2(\vec{a})$. Then $f_2^{-1} \circ f_1$ is a nontrivial automorphism fixing $\vec{a}$.

In fact, there are uncountably many automorphisms moving $\vec{a}$ the same way, so fixing one and composing the others with its inverse gives uncountably many nontrivial automorphisms fixing $\vec{a}$.

1

Let $\vec{a} \in A^{<\omega}$. There are uncountably many automorphisms $f$ and only countably many possible values for $f(\vec{a})$, so there must be two different automorphisms $f_1$ and $f_2$ with $f_1(\vec{a}) = f_2(\vec{a})$. Then $f_2^{-1} \circ f_1$ is a nontrivial automorphism fixing $\vec{a}$.
{"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": 18, "mathjax_display_tex": 0, "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": true, "boilerplate_config": {"ratio_threshold": 0.3, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9202134013175964, "perplexity_flag": "head"}