Blog Archive

Wednesday, March 20, 2024

Introduction to involution

The aim of a this blog:

Introduce the concept involution via the representation of Z/2Z

Talking about the examples in various branches.

Generalise the proposition that every function over R could be uniquely written by sum of odd function and even function.

Let C be a category, and X∈Ob(C).

Definition. An involution on X is an endomorphism ∗, satisfies the property ∗∗=idX.

Easy to see that ∗ is an automorphism. The inverse is itself.

If η:(Z/2Z,+)⟶AutC(X) is a monomorphism (injection)

Then

(1)η(1)∈AutC(X)

Gives us a non-trivial involution.

Example. Boolean Algebra and Lattice with complement.

Let X∈Ob(Set) and its power set the P(X).

(2)η:(Z/2Z,+)⟶AutSet(P(X))1↦(−)c

Here (−)c is complement. It could be generalised to any lattice with a complement. You can find lots of examples in my blog.

This idea could connect with this blog.

Remark For people farmilar with Boolean Ring.

A more natural description is

Notice that P(−) is a representable functor, it is natural isomorphic to 2(−):=HomSet(−,Z/2Z).

Hence

(3)η:(Z/2Z,+)⟶AutSet(2X)1↦1X

Moreover, we could define a local complement for S⊂X by

(4)η:(Z/2Z,+)⟶AutSet(2X)1↦1S

Example. Group object.

Let G∈Ob(C) be a group object (for example, topological group/ abelian group)

Then the inverse morphism μ:G→G,μ∈AutC(G) is an automorphism.

(5)η:(Z/2Z,+)⟶AutC(G)1↦μ

Example. Galois Group.

Consider the field extension such as R⊂C,Q⊆Q(d)...

(6)Gal(L/K)≅Z/2Z

The conjugate is a nontrivial involution.

(7)a+bd↦a−d

Example in matrix.

Let M∈GL(V)

(8)M2=I

Example. C∗ Algebra in Linear Algebra.

Let V be an inner product vector space over C.

For T∈EndC(V), define its adjoint be

(9)⟨Tv,w⟩=⟨v,T∗w⟩

Easy to verify that T∗∗=T by the axiom of inner product.

Moreover

(10)(T+S)∗=T∗+S∗,(T∘S)∗=T∗∘opS∗=S∗∘T∗

Hence

(11)∗:EndC(V)→EndCop(V)

gives a ring isomorphism.

If we focus on the abelian group structure, (EndC(V),+)

Then

(12)η:(Z/2Z,+)⟶AutC(V)1↦∗

If we consider the real vector space, then ∗:A↦AT.

Example. Involution on function over C.

Let f∈C(C).

(13)f∗(z)=f(−z)

gives us an involution.

Let f∈C[a,b].

(14)f∗(x)=f(a+b−x)

Give us an involution.

Proposition.

Let M be a R−module, and 2∈R∗

Consider the R−module HomSet(S,M) and the involution

(15)η:(Z/2Z,+)⟶AutR(HomSet(S,M))

Definition.

Let Odd⊆HomSet(S,M) be the submodule satisfies that f∗=−f,

Even⊆HomSet(S,M) be the submodule satisfies that f∗=f.

The reason that Odd and Even is submodule follows from ∗ is a R− module homomorphism.

The reader could think that Odd and Even is a kind of eigenspace concerning −1,1. Especially when R is a field.

Proposition.

(16)HomSet(S,M)=Odd⨁Even

Proof.

Firstly we should prove that Odd∩Even={0}.

That is, f=f∗=−f⟹f+f=0. By the condition 2∈R∗, f=0.

For any f∈HomSet(S,M), g=f−f∗∈Odd,g′f+f∗∈Even.

Hence g+g′=2f. By the condition 2∈R∗, we get that f=g+g′2◻

The reader can see that this is a generalisation of odd functions and even functions.

Corollary.

Every function on C could be uniquely written as the sum of an odd function and an even function.

Every matrix could be written as the sum of a self-adjoint matrix and a matrix satisfies T∗=−T.

For C(C) and the conjugate as involution,

the Odd is the module of the imaginary function, and the Even is the module of the real function.

...

In the case

(17)f∗(x)=f(a+b−x)

If we let [a,b]=[0,π]

Then

(18)(cos⁡x+isin⁡x)∗=cos⁡(π−x)+isin⁡(π−x)=i2(cos⁡x−isin⁡x)=−cos⁡x+isin⁡x

In this case, cos⁡x∈Odd and sin⁡x∈Even!

Proposition.

For f∈Odd,

(19)f(a+b2)=0

Proof.

(20)f(a+b−x)=−f(x)⟹f(a+b2)=−f(a+b2)◻

Hence

(21)f∈Odd⟹∫abf(x)dx=0

As you can see, this involution is just an generalization of odd function and even function.

Proposition.

(22)(∫abf(x)dx)∗:=∫baf(a+b−x)d(a+b−x)=∫abf(x)dx

Proof.

(23)(∫abf(x)dx)∗=∫baf(a+b−x)d(a+b−x)=−∫baf(x)dx=∫abf(x)dx◻

 

 

1 comment:

Popular Posts