Ziele Untersuchung
mit Columbo Integrität von
Datenbanken Interaktion und
Portierbarkeit Ergonomie der
Schnittstellen

Angebot Produkte Projekt Beratung

Mittel Analytik Modellierung Sprachen Algebra Logik Hardware Denken Kreativität

Zusammenhänge Gesellschaft Wirtschaft Branche Firma


products/Sources/formale Sprachen/GAP/pkg/xmod/doc/ (Algebra von RWTH Aachen Version 4.15.1^©) Datei vom 10.6.2025 mit Größe 10 kB

Quelle chap12_mj.html Sprache: HTML

products/Sources/formale Sprachen/GAP/pkg/xmod/doc/chap12_mj.html

<?xml version="1.0" encoding="UTF-8"?>

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
 "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">

<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en">
<head>
<script type="text/javascript"
 src="https://cdn.jsdelivr.net/npm/mathjax@2/MathJax.js?config=TeX-AMS-MML_HTMLorMML">
</script>
<title>GAP (XMod) - Chapter 12: Applications</title>
<meta http-equiv="content-type" content="text/html; charset=UTF-8" />
<meta name="generator" content="GAPDoc2HTML" />
<link rel="stylesheet" type="text/css" href="manual.css" />
<script src="manual.js" type="text/javascript"></script>
<script type="text/javascript">overwriteStyle();</script>
</head>
<body class="chap12" onload="jscontent()">

<div class="chlinktop">Goto Chapter: <a href="chap0_mj.html">Top</a> <a href="chap1_mj.html">1</a> <a href="chap2_mj.html">2</a> <a href="chap3_mj.html">3</a> <a href="chap4_mj.html">4</a> <a href="chap5_mj.html">5</a> <a href="chap6_mj.html">6</a> <a href="chap7_mj.html">7</a> <a href="chap8_mj.html">8</a> <a href="chap9_mj.html">9</a> <a href="chap10_mj.html">10</a> <a href="chap11_mj.html">11</a> <a href="chap12_mj.html">12</a> <a href="chap13_mj.html">13</a> <a href="chap14_mj.html">14</a> <a href="chap15_mj.html">15</a> <a href="chapBib_mj.html">Bib</a> <a href="chapInd_mj.html">Ind</a> </div>

<div class="chlinkprevnexttop"> <a href="chap0_mj.html">[Top of Book]</a> <a href="chap0_mj.html#contents">[Contents]</a> <a href="chap11_mj.html">[Previous Chapter]</a> <a href="chap13_mj.html">[Next Chapter]</a> </div>

<a href="chap12.html">[MathJax off]</a>
<a id="X7DD7F0847FF2B96C" name="X7DD7F0847FF2B96C"></a>
<div class="ChapSects"><a href="chap12_mj.html#X7DD7F0847FF2B96C">12 Applications</a>
<div class="ContSect"> <a href="chap12_mj.html#X8575260A80F735BD">12.1 Free Loop Spaces</a>

<div class="ContSSBlock">
 <a href="chap12_mj.html#X87781C76804E783E">12.1-1 LoopClasses</a>
</div></div>
</div>

<h3>12 Applications</h3>

This chapter was added in April 2018 for version 2.66 of XMod. Initially it describes crossed modules for free loop spaces. Further applications may arise in due course.

<a id="X8575260A80F735BD" name="X8575260A80F735BD"></a>

<h4>12.1 Free Loop Spaces</h4>

These functions have been used to produce examples for Ronald Brown's paper Crossed modules, and the homotopy \(2\)-type of a free loop space [Bro18]. The relevant theorem in that paper is as follows.

Theorem 2.1 Let \(\calM = (\partial : M \to P)\) be a crossed module of groups and let \(X = B\calM\) be the classifying space of \(\calM\). Then the components of \(LX\), the free loop space on \(X\), are determined by equivalence classes of elements \(a \in P\) where \(a,a'\) are equivalent if and only if there are elements \(m \in M,\, p \in P\) such that \(a'= p + a - \partial m - p\). 

 Further the homotopy \(2\)-type of a component of \(LX\) given by \(a \in P\) is determined by the crossed module of groups \(L\calM[a] = (\partial_a : M \to P(a))\) where: 

<ul>
<li> \(P(a)\) is the subgroup of the cat\(^1\)-group \(G = P \ltimes M\) such that \(\partial m = [p,a] = -p-a+p+a\); 

</li>
<li> \(\partial_a(m) = (\partial m, m^{-1}m^a)\) for \(m \in M\); 

</li>
<li> the action of \(P(a)\) on \(M\) is given by \(n^{(p,m)} = n^p\) for \(n \in M,\, (p,m) \in P(a)\). 

</li>
</ul>
 In particular \(\pi_1(LX,a)\) is isomorphic to \(\mathrm{cokernel}(\partial_a)\), and \(\pi_2(LX,a) \cong \pi_2(X,*)^{\bar{a}}\), the elements of \(\pi_2(X,*)\) fixed under the action of \(\bar{a}\), the class of \(a\) in \(\pi_1(X,*)\). 

 There is an exact sequence \( \pi \stackrel{\,\phi\,}{\to} \pi \to \pi_1(LX,a) \to C_{\bar{a}}(\pi_1(X,*)) \to 1\), in which \(\pi = \pi_2(X,*)\), and \(\phi\) is the morphism \(m \mapsto m^{-1}m^a\). 

<a id="X87781C76804E783E" name="X87781C76804E783E"></a>

<h5>12.1-1 LoopClasses</h5>

<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ LoopClasses</code>( <var class="Arg">M</var> )</td><td class="tdright">( operation )</td></tr></table></div>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ LoopsXMod</code>( <var class="Arg">M</var>, <var class="Arg">a</var> )</td><td class="tdright">( operation )</td></tr></table></div>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ AllLoopsXMod</code>( <var class="Arg">M</var> )</td><td class="tdright">( operation )</td></tr></table></div>
The operation <code class="code">LoopClasses</code> computes the equivalence classes \([a]\) described above. These are all unions of conjugacy classes.

The operation <code class="code">LoopsXMod(M,a)</code> calculates the crossed module \(L\calM[a]\) described in the theorem.

The operation <code class="code">AllLoopsXMod(M)</code> returns a list of crossed modules, one for each equivalence class of elements \([a] \subseteq P\).

In the example below the automorphism crossed module <code class="code">X8</code> has \(M \cong C_2^3\) and \(P = PSL(3,2)\) is the automorphism group of \(M\). There are \(6\) equivalence classes which, in this case, are identical with the conjugacy classes. For each \(LX\) calculated, the <code class="func">IdGroup</code> (<a href="chap2_mj.html#X7831DB527CF9DD57">2.8-1</a>) is printed out.

<div class="example"><pre>

gap> SetName( k8, "k8" ); 
gap> Y8 := XModByAutomorphismGroup( k8 );; 
gap> X8 := Image( IsomorphismPerm2DimensionalGroup( Y8 ) );;
gap> SetName( X8, "X8" );
gap> Print( "X8: ", Size( X8 ), " : ", StructureDescription( X8 ), "\n" ); 
X8: [ 8, 168 ] : [ "C2 x C2 x C2", "PSL(3,2)" ]
gap> classes := LoopClasses( X8 );;
gap> List( classes, c -> Length(c) );
[ 1, 21, 56, 42, 24, 24 ]
gap> LX := LoopsXMod( X8, (1,2)(5,6) );;
gap> Size2d( LX ); 
[ 8, 64 ]
gap> IdGroup( LX );
[ [ 8, 5 ], [ 64, 138 ] ]
gap> SetInfoLevel( InfoXMod, 1 );
gap> LX8 := AllLoopsXMod( X8 );;
#I LoopsXMod with a = (), IdGroup = [ [ 8, 5 ], [ 1344, 11686 ] ]
#I LoopsXMod with a = (4,5)(6,7), IdGroup = [ [ 8, 5 ], [ 64, 138 ] ]
#I LoopsXMod with a = (2,3)(4,6,5,7), IdGroup = [ [ 8, 5 ], [ 32, 6 ] ]
#I LoopsXMod with a = (2,4,6)(3,5,7), IdGroup = [ [ 8, 5 ], [ 24, 13 ] ]
#I LoopsXMod with a = (1,2,4,3,6,7,5), IdGroup = [ [ 8, 5 ], [ 56, 11 ] ]
#I LoopsXMod with a = (1,2,4,5,7,3,6), IdGroup = [ [ 8, 5 ], [ 56, 11 ] ]
gap> iso := IsomorphismGroups( Range( LX ), Range( LX8[2] ) );;
gap> iso = fail;
false

</pre></div>

<div class="chlinkprevnextbot"> <a href="chap0_mj.html">[Top of Book]</a> <a href="chap0_mj.html#contents">[Contents]</a> <a href="chap11_mj.html">[Previous Chapter]</a> <a href="chap13_mj.html">[Next Chapter]</a> </div>

<div class="chlinkbot">Goto Chapter: <a href="chap0_mj.html">Top</a> <a href="chap1_mj.html">1</a> <a href="chap2_mj.html">2</a> <a href="chap3_mj.html">3</a> <a href="chap4_mj.html">4</a> <a href="chap5_mj.html">5</a> <a href="chap6_mj.html">6</a> <a href="chap7_mj.html">7</a> <a href="chap8_mj.html">8</a> <a href="chap9_mj.html">9</a> <a href="chap10_mj.html">10</a> <a href="chap11_mj.html">11</a> <a href="chap12_mj.html">12</a> <a href="chap13_mj.html">13</a> <a href="chap14_mj.html">14</a> <a href="chap15_mj.html">15</a> <a href="chapBib_mj.html">Bib</a> <a href="chapInd_mj.html">Ind</a> </div>

<hr />
generated by <a href="https://www.math.rwth-aachen.de/~Frank.Luebeck/GAPDoc">GAPDoc2HTML</a>
</body>
</html>

quality99%

¤ Dauer der Verarbeitung: 0.16 Sekunden (vorverarbeitet) ¤

Wurzel

Suchen

Beweissystem der NASA

Beweissystem Isabelle

NIST Cobol Testsuite

Cephes Mathematical Library

Wiener Entwicklungsmethode

Haftungshinweis

Die Informationen auf dieser Webseite wurden nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit, noch Qualität der bereit gestellten Informationen zugesichert.