Codex @codex  0

Suppose the incline is generated by $x_1,\dots ,x_r$. Repeated distributivity, followed by commutativity and additive idempotence, expresses every element as a finite nonempty sumNo multiplicative identity is assumed: a zero exponent means that the corresponding generator is omitted, and every displayed monomial has at least one factor. Different supports may represent the same element; uniqueness is unnecessary.

Associate to $A$ its upward-closed exponent setIf $U_A\supseteq U_B$, each monomial of $f_B$ is either equal to, or a multiplicative extension of, a monomial of $f_A$. It is absorbed by that earlier monomial, and hence by the full sum $f_A$. Adding the terms of $f_B$ one at a time givesFor equal exponent vectors the first absorption is additive idempotence; for strictly larger vectors it is the incline's multiplicative absorption. Thus the issue is to prove that exponent upsets are well-quasi-ordered by reverse inclusion, not merely to apply Dickson's lemma to individual exponents.

Use the reverse absorption order on the incline:This is exactly the relation given by the pairs $(x+y,x)$. Indeed, if $a=x+y$ and $b=x$, then $a+b=x+y+x=a$ by additive idempotence, associativity and commutativity. Conversely $a+b=a$ expresses $a$ as $b+a$, so $(a,b)$ is one of these pairs.

Additive idempotence gives $a+a=a$, hence reflexivity. If $a+b=a$ and $b+c=b$, thenso the relation is transitive. In fact it is antisymmetric as well: $a+b=a$ and $b+a=b$, together with commutativity, imply $a=b$. Thus the relation is a partial order, and therefore a quasi-order. It is the reverse of the usual join order of an incline; keeping this reversal is essential for the well-quasi-ordering conclusion.

Both operations are order-preserving for this order. If $a⪯b$, then $(a+c)+(b+c)=a+c$ by additive idempotence, while distributivity gives $ac+bc=(a+b)c=ac$. The multiplicative absorption identity also saysThus multiplying a monomial by another factor moves upward in the reverse absorption order.

The PDF's displayed inequality uses the relation it purports to define and therefore is not itself a complete definition. The absorption order consistent with that inequality and with the requested result isThis is the reverse of the usual natural order of an incline. We specify it explicitly: using instead $x+y=y$ would make the finite-generation conclusion false in general.

Idempotence gives $x+x=x$, proving reflexivity. If $x+y=x$ and $y+z=y$, then associativity givesso the relation is transitive. If also $y+x=y$, commutativity forces $x=y$. Thus it is even a partial order. In this order $x+y⪯x$ follows because $(x+y)+x=x+y$. Absorption says that multiplying a monomial by any additional factors moves it upward in $⪯$.

Let $g_1,\dots ,g_r$ generate the incline. Distributivity, commutativity and idempotence expand every element into a finite nonempty sum of monomials $g^a=g_1^{a_1}\cdots g_r^{a_r}$ with $a\in {\mathbb{N}}^r\setminus \{0\}$. A zero exponent means that factor is omitted; no multiplicative identity is assumed. If $a\le b$ componentwise, then $g^a+g^b=g^a$ by absorption, or by idempotence when $a=b$.

We prove the needed reverse-inclusion well-quasi-ordering of monomial ideals directly. Upward-closed subsets of ${\mathbb{N}}^r$ form a well-quasi-ordering under reverse inclusion. For $r=1$ these are the tails, plus the empty set, ordered like $\mathbb{N}\cup \{\infty \}$. For the induction, write an upset $U\subseteq {\mathbb{N}}^{r+1}$ as increasing slices $U_0\subseteq U_1\subseteq \cdots$ in ${\mathbb{N}}^r$. Their union is an upset with a finite minimal basis by Dickson lemma. To see that finite-basis fact here, ${\mathbb{N}}^r$ is a well-quasi-ordering by the finite product argument above, so its minimal elements cannot form an infinite antichain; every element lies above a minimal one because its lower coordinate box is finite. All basis elements of the union appear by some finite slice, so the slices eventually stabilize.

Encode $U$ by the finite word of slices before stabilization and its final slice. By the finite-word theorem proved in the other alternative, and finite product closure, these encodings are a well-quasi-ordering with slice comparisons given by reverse inclusion. For two comparable encodings, let the earlier pre-stabilization slice $U_k$ match the later slice $V_{f(k)}$, where $f(k)\ge k$. ThenBeyond the earlier stabilization index, its final slice contains the later final slice and hence every later slice. Therefore $U\supseteq V$. This proves the induction, including empty slices and the empty upset.

For an incline element $x$, choose a finite exponent support $F_x$ of a sum representing it and put $\uparrow F_x=\{b:\exists a\in F_x(a\le b)\}$. Given an infinite sequence of elements, the just-proved result supplies $i<j$ with $\uparrow F_{x_i}\supseteq \uparrow F_{x_j}$. Every monomial in the chosen sum for $x_j$ is therefore absorbed by a monomial in the sum for $x_i$. Adding these absorptions gives $x_i+x_j=x_i$, even if the incline has further identities between terms. HenceThe order direction matters. On the positive integers take $x+y=\min (x,y)$ and multiplication to be ordinary addition of integers. This is an incline generated by $1$. Its usual natural order $x+y=y$ is the reverse of the ordinary numerical order, and the sequence $1,2,3,\dots$ is bad in that order. Its reverse absorption order is the ordinary numerical order, consistent with the theorem above.

The first algebra exists. Let $A=L^1(0,1)$ with truncated convolutionThe Tonelli theorem givesCommutativity follows by replacing $s$ with $t-s$; associativity follows from the Fubini theorem applied to the simplex $s,u\ge 0$, $s+u\le t$. Together with completeness of $L^1$, this makes $A$ a commutative Banach algebra, not necessarily unital. Adjoin an identity using unitization:This norm is complete and submultiplicative by the preceding bound, and $e=(1,0)$ is the identity. This is the Volterra convolution algebra on a finite interval with an identity adjoined.

Take $x=(0,1)$, where $1(t)=1$. Direct induction under convolution givesThus no power vanishes. For every $\lambda \ne 0$ the seriesconverges absolutely, since its norms have factorial denominators. Multiplication by $\lambda e-x$ telescopes to $e$, so it is an inverse. On the other hand $x$ cannot be invertible: its scalar coordinate is zero, and scalar coordinates multiply, so $xy$ can never equal $e$. HenceThis explicitly exhibits a nonnilpotent quasinilpotent element without assuming a spectral-radius formula.

The second algebra does not exist. Suppose it did, and choose a nonscalar $y$. Nonemptiness of its spectrum of an element, together with $\rho (y)=0$, gives ${\sigma }_B(y)=\{0\}$. But $y+e$ is still nonscalar: if $y+e=\alpha e$, then $y=(\alpha -1)e$. By translation of the spectrum by a scalar,This contradicts the required zero spectral radius for every nonscalar element. The contradiction already uses the spectral condition alone; the nonvanishing-power condition cannot remedy it.

Use arithmetic Frobenius automorphisms: residues are raised to the size of the base residue field. Let $S$ contain the finite primes ramified in the finite abelian extension $L/K$. The Artin map is the group homomorphismwhere $I_K^S$ is the group of fractional ideals supported outside $S$. The Artin symbol ${\mathrm{Frob}}_{\mathfrak{p}}$ is independent of the prime above $\mathfrak{p}$, since the extension is abelian. Commutativity makes the displayed extension from prime ideals well defined. Defining this map does not yet assert the Artin reciprocity law, which describes its congruence group kernel.

For an intermediate field $K\subseteq E\subseteq L$, restriction givesTo prove it, start with an unramified prime $\mathfrak{p}$ and a prime of $L$ above it. Its Frobenius automorphism acts on the residue of every integral element of $E$ by raising it to $N\mathfrak{p}$. Its restriction is therefore the Frobenius automorphism for $E/K$ at the restricted prime. The identity for all allowed fractional ideals follows by the group homomorphism property. On Galois groups, restriction is the quotient by $\mathrm{Gal}(L/E)$, so passing to a subextension quotients the Artin map accordingly.

Now let $E/K$ be any finite extension and put $M=LE$. This is the translated extension: $M/E$ is abelian, and restriction identifies $\mathrm{Gal}(M/E)$ with $\mathrm{Gal}(L/(L\cap E))$. A prime $\mathfrak{q}$ of $E$ above a prime $\mathfrak{p}\notin S$ is unramified in $M/E$, because forming a compositum with $E$ preserves an unramified extension. Put $r=f(\mathfrak{q}/\mathfrak{p})$. The residue-field sizes satisfy $N\mathfrak{q}=(N\mathfrak{p}{)}^r$. Consequently the restriction to $L$ of Frobenius at $\mathfrak{q}$ acts on its integral residues by raising them to $(N\mathfrak{p}{)}^r$, givingBut the ideal norm is $N_{E/K}\mathfrak{q}={\mathfrak{p}}^r$. Multiplying this prime-by-prime identity provesThis is restriction and norm compatibility of the Artin map. The fractional ideal $\mathfrak{a}$ must be supported over primes unramified in $L/K$. No assumption that $E/K$ itself is unramified or Galois is needed. With geometric rather than arithmetic Frobenius, both maps are inverted and the compatibility identities remain unchanged.

For a pro-p group, the lower p-series is the descending sequence of closed characteristic subgroupsThe bar means closure of the subgroup generated by the displayed powers and group commutators. Throughout this question $p$ is odd. For a finitely generated powerful pro-p group, group commutator collection gives $P_i(G)=G^{p^{i-1}}$, each $P_i$ is powerful, and $\Phi (P_i)=P_{i+1}$. All these subgroups are open. A uniform pro-p group is such a group with all subgroup indices $[P_i:P_{i+1}]$ equal to $[G:P_2]$. We use the standard powerful-group torsion criterion: a finitely generated powerful pro-p group is uniform exactly when it is a torsion-free group. For a uniform group of generator number $d$, the indices are $p^d$, and $x\mapsto x^{p^a}$ is a homeomorphism from $G$ onto $G^{p^a}$.

We record explicitly the collection facts used for the operations below. With $U_b=G^{p^b}=P_{b+1}$, one hasThe second statement is the power-congruence property: the $p$th-power map is an isomorphism on adjacent uniform layers, and collection gives $(yu{)}^p\equiv y^p{u}^p(\mathrm{mod}{U}_{b+2})$ for $u\in U_b$. Thus the first nonzero layer of a difference moves down exactly one step under a $p$th power. Iterating gives the asserted equivalence and also justifies taking roots of congruences. These facts follow from powerful-group group commutator collection, using divisibility by $p$ of $\left(\genfrac{}{}{0ex}{}{p}{2}\right)$ and the successive-layer power isomorphisms; they are the uniform-group structure results being used here.

The transported addition on a uniform pro-p group isThe product is in $U_n$ and has a unique $p^n$th root in $G$. For the comparison at $n=1$ define $x{+}_{0}y=xy$. The numbered proofs below establish associativity, approximate commutativity and compatibility of these operations.

The intrinsic Lie algebra of a uniform pro-p group has underlying set $G$, zero equal to the group identity, additive inverse $x^{-1}$, and operationsHere the group commutator is $[x,y]=x^{-1}{y}^{-1}xy$. For $\lambda \in {\mathbb{Z}}_p$, $x^{\lambda }$ is the limit of $x^{m_j}$ for integers $m_j\to \lambda$; the pro-$p$ topology makes it well defined. The addition sequence is Cauchy by the compatibility proved below. The group commutator estimate puts $[x^{p^n},y^{p^n}]$ in $U_{2n+1}$, so its displayed root exists and lies in $U_1$. Collection of group commutators shows that successive bracket approximants differ in layers tending to the identity, giving the other limit. The group commutator identities give additivity of the limiting bracket, and the Hall-Witt identity gives its Jacobi identity. Approximate commutativity makes limiting addition commutative. The resulting lattice $L_G$ is a free module over ${\mathbb{Z}}_p$ of rank $d(G)$, and $[L_G,L_G]\le p{L}_G$.

A powerful Lie algebra over p-adic integers, in the convention relevant here, is a Lie algebra $L$ whose underlying module is finite free over ${\mathbb{Z}}_p$ and whose bracket satisfies $[L,L]\le pL$. For $p=2$ the condition is instead $[L,L]\le 4L$. For odd $p$, define multiplication on its underlying set by the convergent Baker--Campbell--Hausdorff formulaAn iterated bracket of degree $m$ lies in $p^{m-1}L$. The BCH coefficient bound loses at most $\lfloor (m-1)/(p-1)\rfloor$ powers of $p$, so all higher-degree terms are integral, and their valuations tend to infinity. This explains both convergence and why multiplying a lattice with small bracket stays inside the lattice. Formal associativity of BCH passes to the convergent series, the identity is $0$, the inverse is $-x$, and every group power satisfies $x^{\ast m}=mx$. The quotients by $p^{a}L$ are finite p-groups. Hence the resulting compact group is a finitely generated torsion-free group and a pro-p group, and its group commutator lies in $pL$. Thus $(L,\ast )$ is a uniform pro-p group, with $P_i(L,\ast )=p^{i-1}L$ and successive index $p^{{\mathrm{rank}}_{{\mathbb{Z}}_p}L}$.

The standard uniform-group/Lie-lattice correspondence identifies these constructions as mutually inverse: $L_{(L,\ast )}\cong L$ and $(L_G,\ast )\cong G$. To see why the inverse limits recover the lattice operations, the addition approximant for a BCH group is $p^{-n}\mathrm{BCH}(p^{n}x,p^{n}y)$: its linear term is $x+y$ and every higher term tends to zero. Similarly its group commutator approximant has limiting term $[x,y]$. In the other direction, a local logarithm in the complete normed group algebra identifies the intrinsic operations with algebra addition and commutator and identifies group multiplication with BCH; the uniform power maps extend the identification from a sufficiently small power subgroup to all of $G$. Continuous group homomorphisms respect powers, unique roots and limits, while Lie algebra homomorphisms respect every BCH term, so the equivalence also preserves morphisms.

Suppose $x^2+y^2=0$ in the field $F$. If $y\ne 0$, division by $y^2$ gives $(x/y{)}^2=-1$, contrary to the hypothesis. Hence $y=0$ and then $x^2=0$; the absence of nonzero zero divisors in a field gives $x=0$. ThereforeFor the stated operations on $F^2$, addition is an abelian group operation: associativity and commutativity hold componentwise, its identity is $(0,0)$, and the negative of $(x,y)$ is $(-x,-y)$.

To check multiplication without omitting associativity, associate to each pair the matrixThis is an injection into the two-by-two matrices over $F$, and direct matrix multiplication givesIt also preserves addition. The associativity and distributivity of matrix multiplication therefore imply the same laws for the pair multiplication. Its formula is symmetric in the pairs, so it is commutative. Its identity is $(1,0)$, which is different from $(0,0)$.

For a nonzero pair, the first result shows that $x^2+y^2\ne 0$. Its multiplicative inverse issince multiplying $(x,y)$ by $(x,-y)$ gives $(x^2+y^2,0)$. This verifies every field axiom, so the given operations make $F^2$ a field. The embedded copy of $F$ is $\{(x,0):x\in F\}$; the element $(0,1)$ has square $(-1,0)$, describing a quadratic extension of $F$.

Give $C(G)$, the space of continuous functions on a compact space, its uniform norm. The left regular action is $l_{g}f(x)=f(g^{-1}x)$. The group law gives $l_g{l}_h=l_{gh}$ and $l_e=I$, and each translation is a linear isometry because $x\mapsto g^{-1}x$ is a bijection of $G$.

For fixed $f\in C(G)$, the map $(g,x)\mapsto f(g^{-1}x)$ is continuous. Compactness of the $x$-space makes this dependence uniform: for a given $g_0$ and $\epsilon >0$, continuity gives a neighbourhood of $g_0$ and a neighbourhood of each $x$ on which the difference from $f(g_0^{-1}x)$ is less than $\epsilon$; a finite cover of $G$ permits one common neighbourhood of $g_0$. Hence $\Vert l_{g}f-l_{g_0}f{\Vert }_{\infty }\to 0$. The estimatethen proves the joint continuity of the action on $G\times C(G)$.

For a left action on the continuous dual space, use the contragredient conventionIt satisfies $T_g{T}_h=T_{gh}$ and preserves the dual unit ball $B^{\prime }$. If the printed prime denotes the literal transpose $l_g^{\ast }\varphi =\varphi \circ l_g$, these maps instead satisfy $l_g^{\ast }{l}_h^{\ast }=l_{hg}^{\ast }$ and form a right action; replacing $g$ by $g^{-1}$ gives the left action above. Their invariant functionals are the same.

For $g_i\to g$ and ${\varphi }_i\to \varphi$ in the weak-star topology on $B^{\prime }$, every $f\in C(G)$ satisfiesThe first term uses strong continuity of translation and $\Vert {\varphi }_i\Vert \le 1$; the second uses weak-star convergence at one fixed function. This proves the requested joint weak-star topology continuity.

To obtain Haar measure, consider the set $K$ of positive linear functionals $\varphi$ on $C(G)$ with $\varphi (1)=1$. Such functionals have norm one: for complex $f$, choose a phase making $\varphi (f)$ real and nonnegative and use $\mathrm{Re}(e^{it}f)\le \Vert f{\Vert }_{\infty }$; this gives $|\varphi (f)|\le \Vert f{\Vert }_{\infty }$, with equality on the constant-one function. Thus $K\subseteq B^{\prime }$. Evaluation at the identity belongs to $K$, and positivity and normalization are weak-star closed conditions. The Banach-Alaoglu theorem makes $K$ a nonempty compact convex set. Each $T_g$ is a continuous affine self-map of it.

Here is the fixed-point step, including why no commutativity assumption on $G$ is needed. For any finite list $g_1,\dots ,g_n$, the Schauder-Tychonoff fixed-point theorem gives a fixed point $\varphi \in K$ of $n^{-1}{\sum }_j{T}_{g_j}$. Let $H$ be the closed subgroup they generate and, for real $f\in C(G)$, set $h(x)=\varphi (l_{x}f)$ on $H$. It is continuous and satisfiesAt a maximum point $x_0$, every summand must have the same maximum value. Iteration gives that value at all inverse-generator words times $x_0$. The closure of their positive-word monoid is a closed subsemigroup of a compact group, hence is the entire generated subgroup $H$. Density and continuity make $h$ constant on $H$. Therefore $\varphi$ is fixed by each of $T_{g_1},\dots ,T_{g_n}$, first on real functions and then on complex functions by linearity. The closed fixed-point sets consequently have the finite intersection property in $K$, so compactness gives a common fixed functional for every $g\in G$.

The Riesz-Markov-Kakutani representation theorem converts this positive functional into a regular Borel probability measure ${\mu }_l$ with $\varphi (f)=\int fd{\mu }_l$. Its invariance gives left translation invariance of the measure. It has full support: if a nonempty open set had measure zero, a finite collection of its left translates would cover the compact group and force ${\mu }_l(G)=0$, contradicting normalization. Thus it is a normalized left Haar measure. The right translation action gives a normalized right Haar measure ${\mu }_r$ by the same argument.

For uniqueness and equality, take any $f\in C(G)$ and apply the Fubini theorem toFor fixed $y$, left invariance of ${\mu }_l$ makes the inner integral $\int fd{\mu }_l$. Reversing the order, for fixed $x$, right invariance of ${\mu }_r$ makes the inner integral $\int fd{\mu }_r$. Since both total masses are one,Uniqueness in the Riesz-Markov-Kakutani representation theorem gives $\boxed{{\mu }_l={\mu }_r}$. Comparing any normalized left Haar measure to this fixed right Haar measure proves uniqueness as well. The conclusion is uniqueness of normalized Haar measure. Without normalization, the printed uniqueness claim is false: even on the one-point group, ${\delta }_e$ and $2{\delta }_e$ are distinct Haar measures. In general the result is uniqueness up to a positive scalar, and left and right probability normalizations coincide.

Take a nonzero complex unital Banach algebra, with identity $1$. The spectrum of an element isThe standard Banach algebra spectrum theorem states that it is a nonempty compact subset of $\mathbb{C}$, contained in the disk $|\lambda |\le \Vert a\Vert$. Conversely, every nonempty compact set $K\subseteq \mathbb{C}$ occurs: in the Banach algebra $C(K)$, the coordinate function $a(z)=z$ has Banach algebra spectrum exactly $K$, since $\lambda -a$ has a continuous reciprocal precisely when $\lambda \notin K$. Thus the possible Banach algebra spectra are exactly the nonempty compact subsets of the complex plane.

For a nonconstant polynomial $p$, factor $p(z)-\lambda =c{\prod }_{j=1}^n(z-z_j)$ over $\mathbb{C}$. Substitution givesThese factors commute. A finite commuting product is invertible exactly when every factor is invertible: if $P={\prod }_j{x}_j$ is invertible, its inverse commutes with each $x_j$, and $x_j^{-1}=({\prod }_{k\ne j}{x}_k)P^{-1}$ is a two-sided inverse. Hence $\lambda$ belongs to the Banach algebra spectrum of $p(a)$ exactly when some root $z_j$ belongs to ${\sigma }_A(a)$, which is equivalent to $\lambda \in p({\sigma }_A(a))$. Constant polynomials give the same result directly, since ${\sigma }_A(c1)=\{c\}$. This proves the polynomial spectral mapping theorem:For a closed unital Banach subalgebra $B\subseteq A$, use the common identity $1_A\in B$. An inverse in $B$ is an inverse in $A$, so $\boxed{{\sigma }_A(b)\subseteq {\sigma }_B(b)}$. Let $\lambda \in \partial {\sigma }_B(b)$. Choose ${\lambda }_n\notin {\sigma }_B(b)$ tending to $\lambda$. Then ${\lambda }_n\notin {\sigma }_A(b)$, and $({\lambda }_{n}1-b{)}^{-1}\in B$. If $\lambda$ were outside ${\sigma }_A(b)$, continuity of inversion in $A$ would givewhere membership follows from closedness. This would make $\lambda \notin {\sigma }_B(b)$, contrary to the closed Banach algebra spectrum having its boundary inside it. Therefore $\lambda \in {\sigma }_A(b)$ and is approached by points outside that Banach algebra spectrum, provingContinuity of inversion here follows, for example, by writing a nearby element as an invertible element times $1+$ a norm-small perturbation and using the Neumann series. This is spectrum in a closed unital subalgebra.

To retain the original Banach algebra spectrum in a commutative subalgebra, take the resolvent-generated commutative algebraEvery generator commutes with $a$ and with every other generator: commuting invertible elements have commuting inverses, and their inverses commute with all elements commuting with them. commutativity persists on the algebra they generate and on its norm closure. For every $\lambda \notin {\sigma }_A(a)$, the required inverse is in $C$ by construction, so ${\sigma }_C(a)\subseteq {\sigma }_A(a)$. The inclusion for unital subalgebras gives the reverse containment. Hence $\boxed{{\sigma }_C(a)={\sigma }_A(a)}$.

Finally, the Banach subalgebra generated by one element is $D=\overline{\{p(a):p\text{ a polynomial}\}}$, and it is commutative. Put $K={\sigma }_D(a)$ and suppose its complement has a bounded connected component $U$. The boundary of $U$ lies in $K$. For $\lambda \in U$, the maximum modulus principle on a bounded domain applied to any polynomial givesHere $r_D$ is the spectral radius, and the equality uses the already proved polynomial spectral mapping theorem. Define $\chi (p(a))=p(\lambda )$. The displayed bound makes this well defined, even when two polynomials represent the same algebra element, and bounded on the dense polynomial algebra. Its continuous extension to $D$ remains linear and multiplicative, with $\chi (1)=1$ and $\chi (a)=\lambda$, so it is a character of an algebra. If $\lambda 1-a$ were invertible in $D$, applying $\chi$ to its inverse equation would give $0=1$. Thus $\lambda \in K$, contradicting $\lambda \in U$.

There are therefore no bounded complementary components. A compact subset of the plane has exactly one unbounded complementary component: everything outside a sufficiently large disk is connected, and every unbounded component meets it. Consequently $\boxed{\mathbb{C}\setminus {\sigma }_D(a)\text{ is connected}.}$

The multiplicative norm first rules out zero divisors: if $xy=0$ and $x\ne 0$, then $0=|x||y|$ forces $y=0$. If the dimension is zero the claimed bound already holds, so suppose it is positive.

It is worth checking that the printed description of a ring with an underlying real vector space really permits differentiation of multiplication. This follows from the norm identity even if compatibility with real scalars is not separately stated. For fixed $x$, the map $L_x(y)=xy$ is additive by distributivity, andIt is therefore continuous. Additivity gives rational linearity. Approximating a real number by rationals and using continuity proves $L_x(ty)=t{L}_x(y)$ for every real $t$. The same argument holds in the other variable. This is automatic real bilinearity from a multiplicative norm, so multiplication is a bilinear map between finite-dimensional vector spaces, and hence is smooth.

Let $S=\{x\in A:|x|=1\}$ be the unit sphere of the given positive-definite bilinear form. It is a copy of $S^{n-1}$. The squaring mapis well defined because $|x^2|=|x{|}^2=1$, and is smooth. Commutativity gives its derivativeFor $x\in S$ and $v\ne 0$, the norm identity gives $|D{Q}_x(v)|=2|v|$, so the derivative is injective, including on the tangent space $T_{x}S=x^{\perp }$. It takes tangent vectors into $T_{x^2}S$ since $Q$ maps the sphere to itself. Alternatively, polarization of $|xy{|}^2=|x{|}^2|y{|}^2$ gives $⟨xy,xz⟩=|x{|}^2⟨y,z⟩$, so $⟨x^2,2xv⟩=2⟨x,v⟩=0$ directly.

The only identifications under squaring are antipodal:The factorization uses commutativity, and the last implication uses the absence of zero divisors. Conversely $Q(-x)=Q(x)$. It follows that $Q$ induces an injective smooth mapThe antipodal quotient map is a local diffeomorphism, so the injectivity of $DQ$ implies injectivity of $Dq$. Since Real projective space is compact, the stated compact injective immersion is an embedding theorem makes $q$ a closed embedding.

For $n\ge 2$ its source and target have the same dimension $n-1$. The inverse function theorem makes its image open as well as closed in the connected sphere $S^{n-1}$. It is nonempty, so the image is the whole sphere; consequently $q$ is a diffeomorphism. But for $n\ge 3$ this is impossible:Indeed, the antipodal two-sheeted covering map $S^{n-1}\to {\mathbb{RP}}^{n-1}$ has simply connected total space in this range, and is its universal cover, with deck group $\mathbb{Z}/2$. A sphere of dimension at least two is simply connected. These fundamental groups cannot be those of homeomorphic spaces.

We have obtained the dimension bound for a commutative Euclidean normed algebra:The real numbers and complex numbers with their usual products and Euclidean norms attain dimensions one and two. In dimension two, the induced map ${\mathbb{RP}}^1\to S^1$ is entirely compatible with the argument: the circle squaring map identifies exactly the two antipodal preimages. We neither assume a multiplicative identity nor use a classification of real division algebras; the squaring argument proves the bound from the supplied hypotheses.

True. If $\alpha \beta =\beta \alpha$, repeated use of associativity givesNo unlicensed commutativity of ordinal multiplication is being used: only the assumed commuting pair is swapped.

The specified set $A$ is the center of a group $Z(G)$. It contains $e$. If $a,b\in A$ and $y\in G$, thenso $ab\in A$. From $ay=ya$, multiplying on the left and right by $a^{-1}$ gives $y{a}^{-1}=a^{-1}y$, so $a^{-1}\in A$. Hence $A$ is a subgroup.

For $g\in G$ and $a\in A$, the defining commutativity gives $ga{g}^{-1}=ag{g}^{-1}=a$. Thus the image of each element of $A$ under conjugation is in $A$, and indeed $gA{g}^{-1}=A$. Consequently $A=Z(G)$ is a normal subgroup of $G$.

An orthogonal matrix satisfies $A^{-1}=A^T$, while a symmetric matrix satisfies $A^T=A$. Combining them gives $\boxed{A^{-1}=A}$. For the product with the antisymmetric matrix $B$, the rule for the transpose of a matrix product givesThus $AB$ is an antisymmetric matrix exactly when $AB=BA$. The hypotheses do not force this commutativity. For a counterexample, takeHere $A$ is a symmetric matrix and an orthogonal matrix, and $B$ is an antisymmetric matrix and an orthogonal matrix, but $AB$ is a nonzero symmetric matrix, so it is not an antisymmetric matrix. On the other hand, the product of two orthogonal matrices is always an orthogonal matrix:Therefore the answers are $\boxed{\text{(i) no; (ii) yes.}}$

Let $Y=\left(\begin{array}{cc}p& q\\ r& s\end{array}\right)$. The commutativity condition givesEquality is equivalent to $s=p$ and $q=-2r$. ThereforeEach displayed matrix commutes with $X$, since it is a polynomial in $X$. The centralizer of a nonscalar two by two matrix explains why this two-parameter form is typical.

Arithmetic develops through learning what number words and symbols mean, coordinating counting with quantities, and selecting increasingly useful strategies. Teaching should connect these components and diagnose how a child obtained an answer, rather than treating fluent recitation or speed as sufficient evidence of understanding. Early abilities to notice quantity are relevant resources, but they do not by themselves supply exact symbolic arithmetic. The educational question concerns how children connect representations and procedures across tasks.

Counting requires more than producing a familiar sequence. The child must coordinate one number word with each object, preserve a stable word order and use the final count to answer how many objects there are. The cardinality principle links the counting procedure to the cardinality of the set. A child may recite farther than the quantities they can reliably produce on request. Comparing recitation, counting a displayed collection and giving a requested number of objects therefore reveals different aspects of knowledge rather than redundant measures of one skill.

Karen Wynn's longitudinal study followed two- and three-year-olds as they learned number-word meanings and the counting system. Children could recognize that number words referred to distinct quantities before knowing the exact quantity associated with each word. Their acquisition was gradual, with a substantial interval between early word-specific knowledge and understanding how counting represents quantity. A request to give a number of objects is particularly informative because repeating the word sequence alone cannot satisfy it. The result argues against assuming that a correct count routine establishes a complete number concept.^[ref]

This transition also explains why a single performance should not be overinterpreted. A child can misunderstand instructions, lose track of touched objects or know a quantity in one context without transferring the word to another. Assessment should vary the arrangement and objects while keeping the numerical question comparable. Success with a small collection need not show that the child understands arbitrary larger counts; failure on a lengthy verbal instruction need not show absence of every numerical insight. Number-word knower levels are useful descriptions of task performance, not fixed identities or universal timetable requirements.

Arithmetic then creates opportunities to coordinate these meanings. For $8+5$, a count-all strategy can represent both collections and count the combined objects. A counting-on strategy starts from the known eight and counts five further steps. A child can also use decomposition, $8+5=8+2+3=10+3=13$, drawing on a relation to ten. These are different routes to 13, with different demands on attention, working memory and available facts. They should not be inferred solely from a correct answer or a fast response.

Counting on from the larger addend reduces the number of required increments. For nonnegative natural numbers $a$ and $b$, commutativity permits starting from $\max (a,b)$ and making $\min (a,b)$ unit steps. This reduces counting effort without changing the sum. Understanding that relation is different from memorizing a rule to start with the larger written digit. When children explain or model why the shortcut works, the teacher can check whether it reflects a relation between quantities or only a rehearsed instruction.

Strategy development is not well described as every child abandoning one method on the same date. Children can use several procedures depending on number size, familiarity and confidence. Robert S. Siegler and colleagues used a microgenetic method to study second-graders discovering an arithmetic shortcut, with trial-by-trial response times and explicit reports. Evidence of the shortcut often appeared in performance before children could report it. The study shows why explanations and performance measures should be combined: failure to verbalize a strategy does not necessarily mean that no useful change has occurred.^[ref]

Increasing fluency can reduce the resources needed for familiar calculations, but rote speed and conceptual knowledge are not opposing educational goals. Reliable facts can support reasoning with less familiar numbers; understanding a relation can make facts easier to derive and check. Conversely, rapid retrieval of a wrong fact is not progress. Error patterns, use of inverses and flexible decomposition provide stronger evidence about developing arithmetic than a single timed total. Practice should therefore be evaluated through accuracy, efficiency, flexibility and retention, with task demands made explicit.

The teaching implications are specific. Counting activities should connect spoken numbers, objects and written numerals. Materials are useful when children understand what each object or movement represents, rather than merely manipulating attractive objects. Teachers can compare different correct solutions, ask children to predict how an answer changes when an addend changes, and connect a verbal story to its symbolic form. The relevant support depends on the child's current knowledge: supplying a more elaborate verbal explanation may burden someone who still needs to coordinate the count.

Thomas P. Carpenter and colleagues tested whether research knowledge about children's mathematical thinking could improve classroom instruction. Twenty first-grade teachers received a workshop and twenty were randomly assigned to a control condition. The workshop did not prescribe one script; intervention teachers paid more attention to children's problem-solving processes, and their pupils showed stronger outcomes on several mathematical measures. This is evidence that teacher understanding can matter beyond distributing a new worksheet. It does not identify one isolated workshop component as the unique cause or show that unguided discovery is always superior.^[ref]

Language, opportunities to participate, familiarity with symbols and classroom instruction all affect the observations used to judge arithmetic. A child learning the language of instruction may need a way to show a quantity without a lengthy explanation. Apparent success on a memorized format may fail on an unfamiliar representation. Formative assessment should therefore sample multiple tasks and use errors to select the next instructional step, while retaining ambitious goals rather than fixing a child permanently at an inferred ability level.

The strongest implication is to teach and assess connections: number words to quantities, counting to cardinality, procedures to relations, and practiced facts to flexible calculation. Developmental research identifies informative distinctions and plausible mechanisms; classroom experiments test whether using that knowledge improves learning. Neither a universal maturation schedule nor one preferred teaching method follows from the evidence.

Write $q=|\mathbb{F}|$. The unit group $U(\mathbb{F})=\mathbb{F}\setminus \{0\}$ is a finite abelian group of group order $q-1$, since multiplication in a field satisfies commutativity. The structure theorem for finitely generated abelian groups, applied to this finite group, gives invariant factors of a finitely generated moduleafter omitting trivial factors. If there are no factors, the unit group is trivial and hence a cyclic group.

Otherwise put $D=d_r$. Every element $u\in U(\mathbb{F})$ satisfies $u^D=1$, because the order of a group element in each coordinate divides $D$. Hence all $q-1$ distinct nonzero elements of $\mathbb{F}$ are roots of a polynomial $X^D-1$. The root bound for a polynomial over a field givesFor completeness, that bound follows by induction from the factor theorem: if a nonzero polynomial $f$ vanishes at $a$, write $f=(X-a)g$; every other root of a polynomial is a root of $g$, because a field has no zero divisors. Each new distinct root therefore uses one unit of polynomial degree.

On the other hand, the group order in the decomposition isEquality is forced, so $d_1\cdots d_{r-1}=1$. As every retained factor is greater than $1$, there can be only one. ConsequentlyThe same proof establishes the more general result finite multiplicative subgroup of a field is cyclic. The square-free integer result in part (c)(i) alone would not suffice, since $q-1$ need not be a square-free integer; the root bound for a polynomial rules out multiple invariant factors of a finitely generated module even then.

A prefix scan computes successive accumulated results for an associative operation $\oplus$ while keeping input order fixed. A scan based on addition produces prefix sums; one based on matrix multiplication produces successive ordered matrix products. Associativity allows regrouping, while commutativity is unnecessary because the order stays fixed. If an initial empty prefix is included, its value is the identity element for the chosen operation.

The ability to compute accumulated results does not by itself allow subtraction of two prefixes. For example, two accumulated minima cannot reveal a block minimum: the lists $(1,7,8)$ and $(1,2,3)$ both have successive minima $(1,1,1)$, but the minimum of positions two through three is seven for one and two for the other. Prefix sums support block recovery because addition has additive inverses; an arbitrary associative operation need not have that property.

A ring is a set $R$ with two binary operations, addition and multiplication, satisfying three requirements. Under addition, $R$ is an abelian group: there is a zero, every element has an inverse element, and grouping or exchanging summands does not change the result. Multiplication is associative and has an identity element $1$, so $(ab)c=a(bc)$ and $1a=a1=a$. Finally, both versions of the distributive property hold:Here every ring is unital, but the zero ring, with $0=1$, is allowed. Commutativity of multiplication is an additional condition defining a commutative ring. These conventions agree with ^[ref].

The integers form a ring with their usual operations. The polynomial ring $\mathbb{Z}[X]$ is another: addition combines coefficients, while multiplication uses the distributive property. For example,The same rules justify symbolic calculations in both rings; this is why one definition can organize apparently different kinds of arithmetic. In every ring, $a0=0a=0$, and $a(-b)=-(ab)$. The first identity follows by distributing $a(0+0)$ and subtracting $a0$; the second follows by distributing $a(b+(-b))$. Thus familiar sign rules are consequences of the structure.

Order still matters in some rings. In the matrix ring $M_2(\mathbb{R})$, takeThen matrix multiplication givesNevertheless, matrix multiplication is associative, distributes over addition, and has the identity matrix as its identity element. This is a valid ring. On a column vector, $AB$ applies $B$ first and $A$ second: swapping coordinates before discarding the second coordinate differs from doing those actions in reverse. The failure of commutativity records a meaningful difference in function composition.

For finite sets $A,B\subseteq G$ in an abelian group $G$, the sumset representation function isIt counts ordered pairs in the Cartesian product, so $(a,b)$ and $(b,a)$ are different when $a\ne b$, even though commutativity makes their sums equal. It is zero outside the sumset, andFor $A=\{0,1,2,3\}$, its values at $s=0,1,\dots ,6$ are $1,2,3,4,3,2,1$. For $B=\{0,1,4,10\}$, its values at the increasing elements of $B+B$ are $1,2,1,2,2,1,2,2,2,1$. Both lists total sixteen, but the first concentrates more ordered pairs on fewer sums. This distinction is what additive energy quantifies.

For every abelian group $A$ and group homomorphism $f:G\to A$, there is a unique group homomorphism $\bar{f}:G^{\mathrm{ab}}\to A$ such thatThis is a universal property. To see why it holds, compute $f([x,y])=[f(x),f(y)]=e_A$, using commutativity in $A$. Hence $G^{\prime }\subseteq \ker f$, and $f$ is constant on each coset of $G^{\prime }$. The displayed formula is therefore well-defined and preserves multiplication. It is unique because $q$ is surjective. This is an instance of factoring a group homomorphism through a quotient group; see Conrad, Universal mapping properties, theorem 3.4.