Question about an automorphism

  • Thread starter Oxymoron
  • Start date
In summary, Gelfand and Naimark's theorem states that there is a representation \pi on the Hilbert space \mathcal{H}_f and a vector h\in\mathcal{H} such that f(a) = (\pi(a)h\,|\,h) \quad\quad \forall\,A\in A.
  • #36
So, you are not forming the C* quotient after all, then, just the vector space quotient. N is not necessarily a two sided ideal. A/N is just a vector space (non-complete, otherwise it wouldn't make sense to take its completion). I should hve checked this before, but it seemed more important to get across what a quotient was in general. If N were an ideal, A/N would be a C* algebra and complete already, right? C* algebras are banach spaces are they not? (It is years since I did this, so do not take my word for it).

Yes, all C*-algebras are Banach algebras. C*-algebras just have the * law of composition, which makes them a little but more specific than Banach algebras.

Anyway, what part is troubling you? alpha maps N to N (you checked?)...

To be honest I don't know how I am meant to check such a thing. I mean it is one thing to say that I have such a map and another to show that it exists. Would I start by picking some element of N, n say, and show that alpha maps it to some element m in N?

...hence maps A/N to A/N...

and I am not going to ask you to show me this again, am I?!

L is isometric (you checked?), hence it extends to an isometry on the completion of A/N which I is H_f, right... U is invertible, again seems clear, so where is the problem?

I have not checked that L is isometric. To be honest once again, I am not sure how to. I would guess that I would need to use the norm somewhere in the proof - somehow show that the map L preserves the norm. In fact, this might be fairly easy to show, I seem to remember a corollary dealing with isometric mappings, Ill have to get back to you on that...

Now this is where I struggle: "...extends to an isometry on the completion H_f" What does "extends" mean in this context!? I have done no work on extension theorems so surely it has nothing to do with that. Ugh, I don't like all these "words", I think I am meant to know what all this stuff means but I dont.

I think I know what "completion" means though. When I did topology (I like topology) complete meant that every Cauchy sequence in the set converged within that set. Now, I keep getting told that complete, in the analytic sense means that it's "span is dense". I am not claiming to know what this means, but when I think of "dense" I think of "approximable" or "can be approximated to polynomials" or something like that.

The hint says show that if L is isometric then it "extends" to an isometry U on the completion H_f. I guess H_f is meant to be the completion of A/N. But in my language this means that H_f (being complete) contains A/N as a dense subspace! Does this sound right to you?

But what is pi exactly? Is it pi(a)[x]=[ax]? Or something else?

All I am told is that it is the GNS-representation associated to f. (I think GNS stands for Gelfand, Naimark, and...Segal? Not sure). It comes from this theorem in 1943:

Let f be a positive functional on a C*-algebra A with 1. Then there is a representation pi_f on a Hilbert space H_f and a vector h_f in H such that

[tex]\{\pi_f(a)h_f\,:\,a\in A\}[/tex]

is dense in H_f, and

[tex]f(a) = (\pi(a)h_f\,|\,h_f) \quad \forall\,a \in A[/tex].
 
Last edited:
Physics news on Phys.org
  • #37
Oxymoron said:
To be honest I don't know how I am meant to check such a thing.

yes you do, you've been doing this kind of thing for ages now (or you wouldn't be doing a course on C* algebras!).

You just need to show that if n is in N so is alpha(n). What is the characterisation of N? The n such that f(n*n)=0. So what is f(alpha(n)*alpha(n)), recalling that alpha is a (*-) automorphism and f(\alpha(x))=f(x) for all x?

I have not checked that L is isometric. To be honest once again, I am not sure how to. I would guess that I would need to use the norm somewhere in the proof - somehow show that the map L preserves the norm.

what is the definition of isometric? Use it.
Now this is where I struggle: "...extends to an isometry on the completion H_f" What does "extends" mean in this context!? I have done no work on extension theorems so surely it has nothing to do with that. Ugh, I don't like all these "words", I think I am meant to know what all this stuff means but I dont.
you must have done a course on analysis where they explain completions. The fundamental result about completions is that any continuous map f on X extends to a continuous map on the completion of X. The completion of X is defined purely in terms of cauchy sequences of elements of X so you can define f on the completion too because you can use it on the cauchy sequences.

You should definitely look up the GNS result and see how it works (the proof of it will show you what H_f is, and how the action is defined).
 
Last edited:
  • #38
[tex]f(\alpha(n)^*\alpha(n)) = f(\alpha(n)^*)f(\alpha(n))[/tex]
[tex]\quad\quad = f(\alpha(n))^*f(\alpha(n))[/tex]
[tex]\quad\quad = f(n)^*f(n)[/tex]
[tex]\quad\quad = f(n^*)f(n)[/tex]
[tex]\quad\quad = f(n^*n) =0[/tex]
 
  • #39
f is only a linear functional, it is not a (*)-homomorphism so f(xy) is not in general f(x)f(y). To see why, if f is a linar functional so is 2f, and then yo'ure claiming that 2=4. alpha is a *-homomorphism, though.
 
  • #40
You should definitely look up the GNS result and see how it works (the proof of it will show you what H_f is, and how the action is defined).

I did, and it goes on and on about cyclic vectors (which, incidentally I need to know about for the next question!) The proof for the GNS theorem is absolutely huge. It's split up into 4 sections and requires 3 lemmas! (and ends with "...so this is easy". Which means "It really took me two days and 40 blank pages and 2 pens to come to this complication proof which I present to you now severly compressed and lacking any indication of how I came up with my ideas).
 
  • #41
But you do not necessarily need to understand all of the proof, you just need to know what H_f is and how A acts on it.
 
  • #42
f is only a linear functional, it is not a (*)-homomorphism so f(xy) is not in general f(x)f(y). To see why, if f is a linar functional so is 2f, and then yo'ure claiming that 2=4. alpha is a *-homomorphism, though.

Ah, but surely I can say that

[tex]f(\alpha(n)^*\alpha(n)) = f(\alpha(n^*)\alpha(n))[/tex]

since alpha is a*-automorphism. Then

[tex]= f(\alpha(n^*n)) = f(n^*n)[/tex]

since f(a(n)) = f(n). Then we have it equal zero.
 
  • #43
http://www.math.psu.edu/roe/520/home.html [Broken]

read these notes, they're very good.
 
Last edited by a moderator:
  • #44
But you do not necessarily need to understand all of the proof, you just need to know what H_f is and how A acts on it.

Ok, I read the proof again and got some ideas from it:

* N is a vector subspace of A (which we already knew).
* We define a pairing on A/N by (a+N|b+N):=[a|b] = f(b*a) which is a well-defined inner product - which I easily show, just went through that proof. (inner products! That's Hilbert space territory! Oh oh)
* I found that the operator [itex]\pi(a)[/itex] is linear and bounded.
* A/N is a subspace of H
* pi_f (a*) = pi_f(a)*

*The vector space quotient is [tex]A/N := \{a+N\,:\,a\in A\}[/tex] which we already know, but could have been handy for me a lot earlier.
 
Last edited:
  • #45
What is the operator pi(a), precisely? (To satisfy my own curiosity. I would guess pi(a)[x]=[ax] as the obvious candidate). It should be clear that L (the thing alpha induces) is an isometry now.
 
  • #46
What is the operator pi(a), precisely? (To satisfy my own curiosity. I would guess pi(a)[x]=[ax] as the obvious candidate).

Im not 100% sure either. This is the first time I've ever encountered such operators (representations). I am not sure what pi(a)[x] means. pi is a linear operator acting on a. Then "multiplied" by [x]? I don't know.
 
Last edited:
  • #47
It should be clear that L (the thing alpha induces) is an isometry now.

This is all I know about L at the moment:

1) [tex]L\,:\,A/N\rightarrow A/N[/tex]

2) L is induced by a *-isomorphism [itex]\alpha\,:\,A\rightarrow A[/itex].

Oh wow. I think that maybe L is a representation! Since it satisfies

[tex]L(a)(b+N) = \alpha(a)(b)+N = ab+N[/tex]

So if I can show that L is bounded and linear then it must be an isometry.
 
  • #48
Also L(ab) = L(a)L(b) on A/N.
 
  • #49
Uh? Why are you defining L(a) like that? L is the map of A/N to A/N, it sends cosets to cosets L[a]=[alpha(a)], and is obviously an isometry:

(L([a],L)= f(alpha(a)*alpha(b)) = f(a*b) hence is an isometry.
 
  • #50
Oxymoron said:
Im not 100% sure either. This is the first time I've ever encountered such operators (representations). I am not sure what pi(a)[x] means. pi is a linear operator acting on a.[\quote]

Just to clarify, you do realize (you've said it more than once) pi is a *-homomorphism from A to B(H_f), i.e. pi(a) is an element of B(H_f), thus pi(a) is a linear map on H_f (whcih is the completion of A/N).
 
  • #51
If [itex]n\in N[/itex] then [itex]\alpha(a)(n) \in N[/itex] for all [itex]a \in A[/itex]. But we have

[tex]f((an)^*(an)) = f(n^*a^*an) = 0[/tex]

which is in N. So [itex]\alpha\,:\,N\rightarrow N[/itex] gives [itex]L\,:\,A/N\rightarrow A/N[/itex] such that

[tex]L(a)(b+N) = \alpha(a)(b) + N = ab+N[/tex]

Then, L is linear because alpha is. To show that it is bounded we have

[tex]\|L(a)(b+N)\|^2 = (ab+N\,|\,ab+N) = f(b^*a^*ab) = f((cb)^*cb) \geq 0[/tex]

Thus

[tex]\|a\|^2(b+N\,|\,b+N) = \|a\|^2f(b^*b) \geq f(b^*a^*ab) = \|L(a)(b+N)\|^2[/tex]

and L(a) is bounded with [itex]\|L(a)\|\leq \|a\|[/itex]. Therefore L is an isometry.
 
  • #52
Oxymoron said:
If [itex]n\in N[/itex] then [itex]\alpha(a)(n) \in N[/itex] for all [itex]a \in A[/itex].

Why? I see no reason for N to be an ideal.
But we have

[tex]f((an)^*(an)) = f(n^*a^*an) = 0[/tex]

again, why would that be true? N is not an ideal, f is not multiplicative.

which is in N. So [itex]\alpha\,:\,N\rightarrow N[/itex] gives [itex]L\,:\,A/N\rightarrow A/N[/itex] such that

[tex]L(a)(b+N) = \alpha(a)(b) + N = ab+N[/tex]
again, this doesn't make sense. What are you doing?

Then, L is linear because alpha is. To show that it is bounded we have

[tex]\|L(a)(b+N)\|^2 = (ab+N\,|\,ab+N) = f(b^*a^*ab) = f((cb)^*cb) \geq 0[/tex]

Thus

[tex]\|a\|^2(b+N\,|\,b+N) = \|a\|^2f(b^*b) \geq f(b^*a^*ab) = \|L(a)(b+N)\|^2[/tex]

and L(a) is bounded with [itex]\|L(a)\|\leq \|a\|[/itex]. Therefore L is an isometry.

What has multiplication by L(a) got to do with anything? I don't understand what you're trying to accomplish by looking at this.

f is just a linear functional, it does not have any of these properties you are assigning to it.

I already explained why L is an isometry, and this isn't it.L maps A/N to A/N. So, take b+N in A/N, what does L map it to? Lb+N, that is all. It does not require you to pick and a and work out L(a)(b+N).
 
Last edited:
<h2>1. What is an automorphism?</h2><p>An automorphism is a mathematical concept that refers to a function or transformation that preserves the structure of a mathematical object. In other words, it is a mapping that maintains the same relationships and properties of the object it is applied to.</p><h2>2. What types of mathematical objects can have automorphisms?</h2><p>Automorphisms can be applied to a wide range of mathematical objects, including groups, rings, fields, vector spaces, graphs, and more. Essentially, any mathematical structure that has defined operations and properties can have automorphisms.</p><h2>3. How is an automorphism different from an isomorphism?</h2><p>An automorphism is a specific type of isomorphism, which is a bijective mapping between two mathematical objects that preserves their structure. The main difference is that an automorphism is a mapping from an object to itself, while an isomorphism is a mapping between two different objects.</p><h2>4. What is the importance of automorphisms in mathematics?</h2><p>Automorphisms play a crucial role in many areas of mathematics, particularly in abstract algebra and geometry. They allow us to study the properties and symmetries of mathematical objects, and can also help us classify and identify different objects that have similar structures.</p><h2>5. Can automorphisms be applied to real-world systems?</h2><p>Yes, automorphisms have applications in various real-world systems, such as computer networks and chemical compounds. In these systems, automorphisms can help identify patterns and symmetries, which can be useful in understanding their behavior and making predictions.</p>

1. What is an automorphism?

An automorphism is a mathematical concept that refers to a function or transformation that preserves the structure of a mathematical object. In other words, it is a mapping that maintains the same relationships and properties of the object it is applied to.

2. What types of mathematical objects can have automorphisms?

Automorphisms can be applied to a wide range of mathematical objects, including groups, rings, fields, vector spaces, graphs, and more. Essentially, any mathematical structure that has defined operations and properties can have automorphisms.

3. How is an automorphism different from an isomorphism?

An automorphism is a specific type of isomorphism, which is a bijective mapping between two mathematical objects that preserves their structure. The main difference is that an automorphism is a mapping from an object to itself, while an isomorphism is a mapping between two different objects.

4. What is the importance of automorphisms in mathematics?

Automorphisms play a crucial role in many areas of mathematics, particularly in abstract algebra and geometry. They allow us to study the properties and symmetries of mathematical objects, and can also help us classify and identify different objects that have similar structures.

5. Can automorphisms be applied to real-world systems?

Yes, automorphisms have applications in various real-world systems, such as computer networks and chemical compounds. In these systems, automorphisms can help identify patterns and symmetries, which can be useful in understanding their behavior and making predictions.

Similar threads

Replies
2
Views
845
  • Linear and Abstract Algebra
Replies
4
Views
944
  • Linear and Abstract Algebra
2
Replies
52
Views
2K
  • Linear and Abstract Algebra
Replies
4
Views
1K
  • Linear and Abstract Algebra
Replies
4
Views
1K
  • Linear and Abstract Algebra
Replies
12
Views
1K
Replies
9
Views
1K
  • Linear and Abstract Algebra
Replies
6
Views
757
  • Linear and Abstract Algebra
Replies
15
Views
4K
  • Linear and Abstract Algebra
Replies
4
Views
1K
Back
Top