Universal Kernel

description

What is a map between theories that is not a seam?

A surjective equivariant map between sets on which one group acts: it goes one way and may forget something, and it forgets nothing exactly when it is a seam.

168184C256C324C742C41G28S3anchored observers14A4b7S4bvantage lines7S4aclocks14A4a21D842V4b42V4a87:3the sky
Plate 3.4The descriptions between the fifteen objects: one goes from G/HG/H onto G/KG/K exactly when HH lies in a conjugate of KK. Onto the object of size 28 they come from the objects of sizes 168, 84 and 56; from it they go onto the two objects of size 7 and the point.
Definition(Description, kernel)

Let Γ\Gamma be a group. A description is a surjective Γ\Gamma-map d ⁣:X→Yd\colon X\to Y between Γ\Gamma-sets; when a quotient φ ⁣:Γ→G\varphi\colon\Gamma\to G acts on YY, Γ\Gamma acts on YY through φ\varphi. The kernel of dd at a point x0x_0 is Kd(x0)={γ∈Γ: d(γx0)=d(x0)}=Γd(x0)K_d(x_0)=\{\gamma\in\Gamma:\ d(\gamma x_0)=d(x_0)\}=\Gamma_{d(x_0)}, the stabilizer of the image of x0x_0. What dd forgets at x0x_0 is the fibre d−1(d(x0))d^{-1}(d(x_0)); if XX is transitive, it is the orbit Kd(x0) x0K_d(x_0)\,x_0.

A seam identifies two incarnations and forgets nothing. Most maps between theories are not seams: they go one way and forget something. Reduction modulo a prime, the passage from a double cover to its quotient, and the passage from a group to one of its orbits all lose information, and in each case the loss is a subgroup. Here the group may be infinite and the sets need not be transitive.

Proposition

The kernel contains Γx0\Gamma_{x_0}, and it changes by conjugation when x0x_0 moves in its orbit. A description forgets nothing exactly when Kd(x)=ΓxK_d(x)=\Gamma_x for every xx, that is, when dd is a bijection: a description that forgets nothing is a seam.

Proposition(Statuses)

For transitive GG-sets XX and YY with fixed markings, a description X→YX\to Y exists if and only if a stabilizer of XX is contained in a stabilizer of YY. The bridge between XX and YY is built if and only if some description X→YX\to Y forgets nothing; if ∣X∣=∣Y∣|X|=|Y|, it is refuted if and only if there is no description from XX to YY at all.

Proof

A GG-map G/H→G/LG/H\to G/L sending HH to gLgL exists exactly when H≤gLg−1H\le gLg^{-1}, and it is surjective; it forgets a copy of gLg−1/HgLg^{-1}/H at the base point. A surjection between finite sets of equal size is a bijection.

Examplecomputed

The reduction PSL⁡(2,Z[ω])→PSL⁡(2,7)\PSL(2,\Z[\omega])\to\PSL(2,7), with ω\omega a primitive cube root of unity, is a description with kernel the congruence subgroup Γ(p)\Gamma(\mathfrak p), p=(3+ω)\mathfrak p=(3+\omega). The double cover SL⁡(2,7)→PSL⁡(2,7)\SL(2,7)\to\PSL(2,7) is one with kernel {±I}\{\pm I\}. In SL⁡(2,7)\SL(2,7), the description of the 48 nonzero vectors of F72\F_7^2 by the 24 vectors up to sign has, at (1,0)(1,0), a kernel of order 14, and it forgets the fibre {±(1,0)}\{\pm(1,0)\}.

Built from
objectseam
Builds
kernel
The volume’s word
kernel