Processing math: 100%

Sunday, November 3, 2013

Scratch Ideas (Research)

MathJax TeX Test Page Let R be a ring, I an indexing set for which each Mi is an R-module. We set M=iIMi. We say an element sM is condensed if all but one of the coordinates of s is zero (including s=0). We say a submodule NM is condensing if for every mM we have ¯m=¯sM/N for some condensed sM. N is further said to be halt-condensing if for condensed s1s2 we have ¯s1¯s2.

Let N be a condensing submodule. We have a homomorphism of the modules Mi into M/N, and the union of their images is all of M/N. Conversely, if there is such a homomorphism of the Mi into a module K with the union property, then we have a surjective homomorphism φ:MK given by evaluation of the sum of the nonzero components in K, giving rise to a condensing submodule as the kernel. The equivalence regarding halt-condensing submodules is modified by requiring the mapped modules to inject and be disjoint at nonzero values.
~~~~~

Let R be a UFD with group of units V. Choose a list of primes pi of cardinality |S|=c to represent the associativity classes of prime elements. Letting A=Aut(V) (group automorphisms), Sc be the symmetric group on c objects, and V be the group of maps SV where the operation is multiplication φ1φ2(s)=φ1(s)φ2(s), we claim A×Sc×V contains (a copy of) Aut(R) (ring automorphisms) where the former is under a custom operation elucidated below.

Let φAut(R). Since automorphisms map units to units, we must have φ|VAut(V). Now automorphisms also map primes to primes, and more generally associativity classes of primes to other associativity classes, so φ's action on pi might be completely represented by an element σ from Sc together with a map ψ:SV given by ψ(s)=φ(ps)/pσ(s) (i.e. so we may construct φ from ψ and σ by φ(ps)=ψ(s)pσ(s)). Now, φ is uniquely determined by this action on the units and primes, so we have an injection Aut(R) into A×Sc×V. In order to claim an algebraic embedding the structure imposed on the latter is not simply componentwise multiplication but is rather modified to imitate composition of automorphisms of R. The operation is defined as such:

Let x1,x2=(φ1,σ1,ψ1),(φ2,σ2,ψ2)A×Sc×V. Then x1x2=(φ1φ2,σ1σ2,(φ1ψ2)·(ψ1σ2)), where multiplication and composition of maps are here distinct.
~~~~~

Let A,B be groups. Consider AutA(A×B), the set of automorphisms of A×B mapping A×1 to A×1. This is seen to be a subgroup of Aut(A×B) which we shall now classify. Let ΦAutA(A×B). By definition Φ restricts to an automorphism φ on A×1, and by simultaneously defining (ψ(b),σ(b))=Φ(1,b) we obtain homomorphisms ψ:BA and σ:BB. Further, we see σ is injective because if σ(b)=1 then Φ(1,b)A×1 and the automorphism φ leads to an element Φ(a,1)=Φ(1,b) implying a,b=1. Further, σ is surjective seeing as Φ is surjective. Assume img ψZ(A); then aψ(b)ψ(b)a for some aA, bB. Then we have Φ((1,b)(φ1(a),1))=Φ(1,b)Φ(φ1(a),1)=(ψ(b),σ(b))(a,1)(a,1)(ψ(b),σ(b))=Φ((φ1(a),1)(1,b))a contradiction. Since φ,ψ,σ uniquely determine Φ, we have an injection of sets AutA(A×B)Aut(A)×Hom(B,Z(A))×Aut(B).

Conversely, let φAut(A), ψHom(B,Z(A)), and σAut(B). Define Φ:A×BA×B by Φ(a,b)=(φ(a)ψ(b),σ(b)). We observe Φ((a1,b1)(a2,b2))=Φ(a1,b1)Φ(a2,b2), so it is homomorphic. As well, it is injective as Φ(a,b)=(1,1) implies σ(b)=1 so b=ψ(b)=1 and consequently a=1. Finally, we observe surjectivity (a,b)=Φ(φ1(aψ(b)1),σ1(b)), so Φ is an automorphism. Thus we have a bijection of sets AutA(A×B)Aut(A)×Hom(B,Z(A))×Aut(B).

Suppose Φ1 associates to (φ1,ψ1,σ1) and Φ2 associates to (φ2,ψ2,σ2). Then we observe Φ1Φ2 associates to (φ1φ2,φ1ψ2+ψ1σ2,σ1σ2). Thus, defining such a binary operation on Aut(A)×Hom(B,Z(A))×Aut(B) induces a group isomorphism between the two.

Footnotes: This machinery works especially well when Z(B) is manageable, and in particular when Z(B)=1 and A is abelian we have AutA(A×B)=Aut(A×B), as then Z(A×B)=A×1 and so A×1 is characteristic. Otherwise, one may possibly discover A×1 char A×Z(B) char A×B and thus A×1 char A×B to the same effect.
~~~~~

For groups ABG let AutG(A) be the subgroup of automorphisms of A extending to automorphisms of G. Let AutGA(B) be the subgroup of automorphisms of B mapping A to A and extending to automorphisms of G.

Let HN char G. Then we have a bijection ψ of coset representatives [Aut(G) : AutH(G)]=[AutG(N) : AutGH(N)] given by restriction ψ(σ)=σ|N. This is injective as σ1|NAutGH(N)=σ2|NAutGH(N) implies σ12|Nσ1|NAutGH(N) so σ12σ1AutH(G), and surjective seeing as the representative σ|N by definition has an extension σ and letting σ represent σ we see σ|NAutGH(N)=σ|NAutGH(N).
~~~~~

Let (X,d) be a metric space, and let C be the set of all nonempty compact subspaces of X. Let AC. Then given xX, define d(x,A)=d(A,x)=minaAd(x,a). Note that since A is compact this is well defined. Note also that fixing A this function is continuous X. Hence given A,BC D(A,B)=max{maxaAd(a,B),maxbBd(b,A)} is well defined. It is clear D(A,A)=0, and D(A,B)=0 quickly implies AB and BA. As well, D(A,B)=D(B,A). Now, we show it satisfies the triangle inequality.

Let A,B,CC and assume D(A,C)>D(A,B)+D(B,C). We may assume maxaAd(a,C)maxcCd(c,A), for otherwise interchanging A,C would result in such a situation.

Let aA and βB be such that d(a,β)=d(a,B)d(x,B) for all xA, let bB and γC be such that d(b,γ)=d(b,C)d(x,C) for all xB, and let aA and γC be such that d(a,γ)=d(a,C)d(x,C) for all xA. Since d(a,B)d(a,B), let xB be such that d(a,x)d(a,β). Since d(x,C)d(b,C), let yC be such that d(x,y)d(b,γ). Now we exhibit D(A,C)=d(a,γ)d(a,y)d(a,x)+d(x,y)d(a,β)+d(b,γ)D(A,B)+D(B,C) Hence (C,D) is a metric space. We garner some facts about this metric space.

Let AX, and for each aA let fa be a path from fa(0)=a to fa(1). The family {fa} is said to be uniform if for each ε>0 and r[0,1] there exists a neighborhood U of r in [0,1] such that fa(U)Bd(fa(r),ε) for each aA. In other words, when XA is given the uniform topology, if the map f:[0,1]XA given by f(r)=fa(r) is continuous. When B=fa(1), we say {fa} is a uniform path from A to B.
~~~~~

Let σ:I2 be such that ¯σ()=I2. Given ε>0 and a function g:{0,1}, we may define hg:I2I hg(x)=limNNσ(i)B(x,ε)g(i)N when the above limit exists for all xI2 (also: consider weighting the sum for guaranteed convergence). When σ and ε are fixed, which continuous functions f:I2I are constructible as hg for some g{0,1}?

Let p:II2 be a path with only finitely many self-intersection points, i.e. |p1(x)|=1 for all but finitely many xI2. Choose a countable dense subset Q[0,1] ordered by φ:Q with the property that, for all open U[0,1], the sequence|{φ(1),φ(2),...,φ(N)}U|Nconverges as N (the dyadic rationals under the usual ordering suffice). Let V[0,1] be a countable dense subset disjoint from p(I) with ordering ψ:V. When σ:I2 is defined σ(1)=pφ(1), σ(2)=ψ(1), σ(3)=ψ(2), σ(4)=pφ(2), ... (alternating between primes and non-primes), then σ is an ordering of the countable dense subset QV (with the exception of finitely many points; modify without loss). Define g:{0,1} by g(i)=1 if σ(i)Q, and g(i)=0 otherwise. Then hg(x) denotes a well-defined function, which when the dyadic rationals as above are chosen and the limit of|{φ(1),φ(2),...,φ(N)}U|Nas N thus coincides with the Lebesgue measure, and measures the "length" of the segment contained the ε-ball about x. For example, when ε=1/2 and p(x)=0×x, we observe hg(x,y)=min {1,y+14x2/2}max {0,y14x2/2} for x1/2 and hg(x,y)=0 elsewhere.

No comments:

Post a Comment