Smolin video LQG online course

Physics news on Phys.org
Last edited:
Smolin says he will continue giving lectures in the course every Wednesay thru February, and then in March the day may change sometime to Thursday.

So far my favorites of what I have watched are Lectures #1 and #3.
I'm impressed with Smolin's ability as an explainer.
 
Last edited:
This is an excellent find, I will check it out soon
 
nice find...but waaaay too much topology for me.
want/need to learn this someday but its completely new to me and I've been doing physics for years.
 
Now as of today SIX lectures are available.

when there were just 4 then my favorites were #1 and #3

(they are the morning halves, parts #2 and #4 were given in afternoon, maybe the morning audience is better, or Smolin is fresher, or maybe it just worked out that way)

Actually I was surprized at how basic and understandable the geometry/topology stuff is.
when you quantize gravity you are quantizing the SHAPE OF SPACETIME, so naturally you need geometric/topological tools because the geometry of spacetime is not a fixed framework but a dynamic uncertain thing. You need a handle on all possible geometries so that you can have quantum states of geometry which are blurred, uncertain, fuzzy shapes of spacetime----geometry governed by probability instead of certainty.

And that is what spacetime really is. It is not some clear fixed thing AFAIK.

So nobody should be surprised if you encounter a few new math concepts. The remarkable thing is that they aren't all that bad---they seem quite natural, as Smolin presents them IMHO.

I'm going to try #5 now.
 
Parts 7 and 8 of the Smolin lectures on Quantum Gravity are now available online
 
We should have a study group to go over these lectures one by one and figure out what the main ideas of each one are.

these are good lectures IMO.

I think it would repay the effort of watching them and discussing them here at PF
 
Has anyone had trouble watching them? I was watching the first one today and my IE browser crashed. I'll try again with Firefox.

But if I succeed, I'll be up for a study group. Perhaps we could start a subforum like they did in Philosophy for A Place for Consciousness?

Update: Same thing with Firefox. "Firefox has encountered a problem and needs to close". And at the same point in the video; just about 30 seconds - certainly less than a minute - into his discussion of the volume operator. He has chalked the words "operator on Hilbert space" on the board and begun to talk when it happens. Drat!:mad:
 
Last edited:
  • #10
thanks for trying!
the only way we can assess what is possible and what isn't
is if people are willing to try it.

I have no trouble. But my wife and son forced me to get DSL last year. I would never have treated myself to it, unprodded, and now I see the point.
the whole thing is effortless and ordinarily runs without a hitch.
I have watched most of the 8 lectures so far---with some interruptions.

I would say that your being unable to participate more or less rules out having a study group here at PF----that is my guess, but we will see what happens.
 
  • #11
I noticed something else, my virus checker got turned off. Now I ran a virus scan just yesterday and found nothing, but this is very supicious. I'll try a couple of things to see if I have some intrusive software that is screwing things up.

Also do you have the hep-th number for the Intro to GR as a Gauge Theory paper that he chalked on the board? I couldn't interpret his handwriting even though I have now seen it twice.
 
  • #12
The paper he referred to for Intro to GR as a Gauge Theory
is http://arxiv.org/abs/hep-th/0209079

He said the relevant sections (for Lecture 1) were sections 2 and 3

I just looked at beginning of Lecture 1 video so I am sure about that.

At some point, according to Christine, he refers to one by Wipf
http://arxiv.org/abs/hep-th/9312078
but probably that is not in Lecture 1---some other in the series.

he says he will use Baez and Muniain. I don't have that book, regret to say.
 
Last edited:
  • #13
marcus said:
The paper he referred to for Intro to GR as a Gauge Theory
is http://arxiv.org/abs/hep-th/0209079

He said the relevant sections (for Lecture 1) were sections 2 and 3

I just looked at beginning of Lecture 1 video so I am sure about that.

Thank you very much Marcus. I had written it down as "...029" insted of "...079", which is why I couldn't find it.




...
he says he will use Baez and Muniain. I don't have that book, regret to say.


I don't either. It's out of print.

AND it's a http://dogbert.abebooks.com/servlet/SearchResults?an=Baez+and+Muniain&y=9&x=37"
 
Last edited by a moderator:
  • #14
selfAdjoint said:
AND it's a http://dogbert.abebooks.com/servlet/SearchResults?an=Baez+and+Muniain&y=9&x=37"

Wow!

Thinking that this result might be an anomaly, I also did a seach, with this http://www.bookfinder.com/search/?ac=sl&st=sl&qi=JlDfOJFh7JdFyFXvP.EEiMm0ZF0_9485734881_2:12:18".

I bought the book new shortly after it came out - I forget what I paid. Much of the book is a standard modern intro to differential geometry, so this material is easily found in other books. I'm (k)not sure what it does with knots though - I don't have it at hand.

Most university libraries probably have the book.

The idea for a study group is great, but, unfortunately, I won't be able to participate as much as I would like. I learn new things quite slowly, and I am swamped with work right now.

I will (at least) lurk, though.

Regards,
George
 
Last edited by a moderator:
  • #15
I heard a second edition of that book is in preparation. I wish Baez would add the lecture notes on quantum gravity from his website to it. Then I could imagine it would nicely complement Penrose last book.

(And finally all the motivated but lesser-smart laymen like myself could make more sense of this cool stuff called mathematical physics.)

And please start a study group.
 
  • #16
Lectures #9 and #10 are now available! I will start listening in a moment.

George Jones, glad to hear that you are interested and will watch----the important thing is to catch the lectures themselves whether or not you contribute comments here. But it would be nice if you did help out. It is actually a lot of work just to watch each lecture and say what it is about in one or two sentences! We need that kind of summary outline list for all 10 (so far) lectures.

Ratzinger said:
... laymen like myself could make more sense of this cool stuff called mathematical physics.)

And please start a study group.

I expect we will have a study group if two things
A. selfAdjoint turns out to be able to get the lectures with his internet connection. If we do it, we should all be able to participate---or a fair chunk of us anyway, not just a small splinter.

B. someone starts posting a list of the topics of each lecture, little by little. I think that would clearly be helpful (I can't remember what the general outline is) and I think it is all it takes to get started.

BTW Christine Dantas has posted a list of the SYSTEM REQUIREMENTS for watching the Smolin Lectures.
 
Last edited:
  • #17
My browser only gives me a few minutes of viewing time before crashing, but by stepping through the video from one crash point to the next I have now succeeded in viewing the whole first video. Needless to say this is tedious and I am not going to try the second one till tomorrow! Nevertheless I did take notes and am ready to discuss on the first.
 
  • #18
If you can disable the video plugin and manage to click through the slides on your own I can put up a passworded copy of videos. I don't really know what their usage rules are but since I use linux I started stripping and saving the videos.

Also, a study group would be great.
 
  • #19
CD said:
If you can disable the video plugin and manage to click through the slides on your own I can put up a passworded copy of videos. I don't really know what their usage rules are but since I use linux I started stripping and saving the videos.

Also, a study group would be great.

I don't quite know how to do this. I wouldn't want the slides apart from the videos. But let me see how session two goes and we'll talk. At this point I am up for a study session.


Did you see that Christine Dantas had some questions about the poset structure of the moves and how they related to Causal Sets and to GR causality? Of course causality in GR does force a poset structure on events. Two events have a causal relation if they are timelike related, in each other's light cones. But causality isn't even defined for spacelike related events; different coordinates will have them in different orders.

Smolin is saying that his moves satisfy the axioms for causal sets. I don't recall exactly what they are. Can anybody copy them to this thread?
 
  • #20
Well I have the first 5 available to download. Just pm me if anyone needs them and I'll send you an address and password. You'd just have to click through the slides manually instead of letting the javascript or whatever it is that is doing it automatically while watching the videos.

Causal set C

Transitivity
\forall{x,y,z}\epsilon{C}(x\prec{y}\prec{z}\Rightarrow{x}\prec{z} )
Irreflexivity
\forall{x}\epsilon{C}(x!\prec{x})
Locally Finite
\forall{x,z}\epsilon{C}(cardinality ( y \epsilon C | x \prec y \prec z ) < \infty)
 
Last edited:
  • #21
CD said:
Well I have the first 5 available to download. Just pm me if anyone needs them and I'll send you an address and password. You'd just have to click through the slides manually instead of letting the javascript or whatever it is that is doing it automatically while watching the videos.

Causal set C

Transitivity
\forall{x,y,z}\epsilon{C}(x\prec{y}\prec{z}\Rightarrow{x}\prec{z} )
Irreflexivity
\forall{x}\epsilon{C}(x!\prec{x})
Locally Finite
\forall{x,z}\epsilon{C}(cardinality ( y \epsilon C | x \prec y \prec z ) < \infty)

CD that is awesome
now maybe people that don't receive the PI streaming media version
can get copies of the Lectures from you
 
  • #22
selfAdjoint said:
My browser only gives me a few minutes of viewing time before crashing, but by stepping through the video from one crash point to the next I have now succeeded in viewing the whole first video. Needless to say this is tedious and I am not going to try the second one till tomorrow! Nevertheless I did take notes and am ready to discuss on the first.
I didn't quite get what he meant by "embedding" the "graphs" into his manifold. The manifold already has a number of dimensions, and then if you embed the graph, are you assiging the additional dimensionality of the graph to the already pre-existing dimensions of the manifold? Or are you defining the "graphs" with some subset of the manifold's points? Thanks.
 
  • #23
The way I took it was just that we keep the connectivity and relationships of the original graph upon an embedding. That it just establishes a relationship between points in the manifold where the graph embedding occurs.
 
  • #24
Yes, initially he speciified the embedding to by "up to topology", so the embedding is just a one-to-one continious map from the graph into the manifold. Being continuous it preserves the vertex/edge relationships and he later remarks that the map is non-singlular too, so it doesn't run any edges into each other. If they should intersect that would be a different graph.

But the graph is just a subset of points in \Sigma, or better, an equivalence class under topological homeomorphism. Any twisting or warping that preseves the edge/vertex connectivity is OK.
 
  • #25
I just watched Lecture 1 again and I think the only main homework or thing to check is the fact about a certain set of moves being ergodic (in this case meaning that you can get from any trivalent graph to any other by repeatedly applying just those moves)

should we try the homework?
did anyone already think about it?

do we have a workable venue for it? I think it requires sketching pictures on scratchpaper, or a blackboard, to see. And if we do that then we have to describe it in words to communicate. It is not worth a lot of bother---it's not a big deal. But it might be nice to have done at least one of Smolin homeworks.
 
  • #26
I'm hearing two things.

selfAdjoint said:
...so the embedding is just a one-to-one continious map from the graph into the manifold.
This sounds like a "graph" is an appendage to each point of the manifold, thus adding points/dimensionality/degrees of freedom to the already existing points of the manifold - like Calabi-Yau manifold appended to the 4D spacetime of GR.

But the graph is just a subset of points in \Sigma, or better, an equivalence class under topological homeomorphism. Any twisting or warping that preseves the edge/vertex connectivity is OK.
This sounds like some points of the manifold are used to for the graph, thus only the dimensionality of the original manifold are considered.

I could use some clarification. Thanks.
 
  • #27
Mike2 said:
I'm hearing two things.


This sounds like a "graph" is an appendage to each point of the manifold, thus adding points/dimensionality/degrees of freedom to the already existing points of the manifold - like Calabi-Yau manifold appended to the 4D spacetime of GR.


This sounds like some points of the manifold are used to for the graph, thus only the dimensionality of the original manifold are considered.

I could use some clarification. Thanks.

Notice that \Sigma is a three dimensional manifold, and a graph is just a one dimensional object, so we can just model what happens in our old familiar 3-space.

Imagine that you have a roll of magic string. The magic is this: when you want it to be limp and flexible, it is, but if you command it to stiffen up it will hold any shape you have got it into. It is also weightless so it doesn't sag on you while you're playing with it.

Now cut off a bunch of pieces of this string, which will be the edges of your graph, and knot them together at the ends, any way you want, to make the nodes. Now you have a graph, and it's "embedded in 3-space". Play with it, twist it, without changing the knots, and then command it to stiffen. Obiously you can get all sorts of configurations, and there are even more that you can't get this way (what you are doing are called "isotopies"). For example the graph that looks like reflection of your graph in a mirror is again topologically equivalent to it.

I emphasize that nothing more outre than this is going on. No extra dimensions are involved.
 
  • #28
about the ergodicity the set of moves is {expand, contract, exchange}

expansion move just replaces a single trivalent vertex with a triangle of 3 trivalent vertices in the obvous way

a contraction is the opposite and it contracts 3 trivalent vertices down to one.

an exchange move deals with two adjacent trivalent vertices and reconnects them in the obvious way------he shows all this clearly on the blackboard and gives plenty of examples

TO PROVE THE HOMEWORK one would have to show that one can take an arbitary finite trivalent graph and shrink it down to a THETA.
the theta is the simplest trivalent graph. It looks like one lens of a somebody's bifocal spectacles------a round disk with a diameter.

So a theta is TWO VERTICES, each of which is trivalent.

FOR PRACTICE, convince yourself that the TETRAHEDRON GRAPH can be reduced to a theta in ONE MOVE, namely a contraction

the tetrahedron graph has 4 vertices and is completely connected and each of the 4 vertices is trivalent. doing a contraction move on it collapses 3 of the vertices to one------so there are now two vertices----and it is a theta.
===================

what we have to show, if we want to act like Smolin students, is that not just a tetrahedron but ANY trivalent graph can be reduced down to a theta.

===============

everybody, when they were a kid, had a glass prism as a toy. to make rainbows.

the edges of this glass prism are a trivalent graph

how do you reduce the prism graph down to a theta?

================

can anyone explain in words why ANY trivalent graph will collapse down to a theta?
 
  • #29
Hmm well any n-prism can be contracted n-1 times into a theta, correct?
 
  • #30
CD said:
Hmm well any n-prism can be contracted n-1 times into a theta, correct?

I am not the teacher, you may be smarter. please go slow. I don't know what an n-prism is. But basically, yeah, you are probably right.But CD, how do you show that ANY finite trivalent graph can be collapsed down?

==============
like take two circles side by side joined by a bar

like a pair of spectacles (ordinary glass, not bifocal :-) )

so it consists of two vertices side by side, joined by one edge, and each one joined to itself

O-O

there is a trivalent graph, so how does it collapse to a theta? or maybe the word is not collapse but simply change, how does it change to a theta?

(damn, CD probably sees immediately so this is not even fun for CD, does anyone else want to answer?)
 
Last edited:
  • #31
Anything I come up with is for closed graphs - no open ended vertices. In this case any finite trivalent graph will have an even number of nodes. Two representing a theta. In this case an even n node graph can be reduced to theta with (n-2)/2 contractions.
 
  • #32
selfAdjoint said:
Notice that \Sigma is a three dimensional manifold, and a graph is just a one dimensional object, so we can just model what happens in our old familiar 3-space.

Imagine that you have a roll of magic string. The magic is this: when you want it to be limp and flexible, it is, but if you command it to stiffen up it will hold any shape you have got it into. It is also weightless so it doesn't sag on you while you're playing with it.

Now cut off a bunch of pieces of this string, which will be the edges of your graph, and knot them together at the ends, any way you want, to make the nodes. Now you have a graph, and it's "embedded in 3-space". Play with it, twist it, without changing the knots, and then command it to stiffen. Obiously you can get all sorts of configurations, and there are even more that you can't get this way (what you are doing are called "isotopies"). For example the graph that looks like reflection of your graph in a mirror is again topologically equivalent to it.

I emphasize that nothing more outre than this is going on. No extra dimensions are involved.
Thanks, that's starting to help. What you are describing seems to be the simplicial complexes of differential geometry, is it?
 
  • #33
Mike2 said:
Thanks, that's starting to help. What you are describing seems to be the simplicial complexes of differential geometry, is it?


Yes, the graph could be used to define two-dimension simplices ("singular chains"), but I don't think Smolin is going to use them for that. I could be wrong though.

BTW I have now watched half of the second video, up to the point where he says he wants to build a real field theory, and notes that he needs fewer field equations, and after discussing counting of degrees of freedom asks the "class", "How can we get fewer field equations?" I'll watch the rest tomorrow. I think my crashing problem is a shaky cable service. Out here in the Wisconsin boonies the cables are not buried but strung on poles, and frequently there are small glitches, some big enough that even the service provider notices them, but others fleeting and no problem as long as I'm not using some streaming source. Last night was our big blizzard with howling winds, and I could hardly get 3 or 4 minutes at a pop. Tonight was much quieter and I got 20 minutes.

On the "spectacles problem" I tried enlarging each of the nodes to a triangle and then exchanging the bar to a vertical one, But to get further I think I need to show that any three connected nodes, not just a triangle, can be shrunk to one. Has anybody looked into that?
 
Last edited:
  • #34
here is a trivalent graph with two vertices

O-O

it is not a theta graph
using our set of approved moves, how do you change it to a theta?

what is the magic word?
I want to know explicitly how to change it
CD, or anybody?
 
  • #35
I just saw selfAdjoint response to this "spectacle" problem.

It is probably OK but not the quickest way.
You can do it in ONE MOVE

selfAdjoint, you say to start off by applying expansion moves to each vertex first which makes a bigger graph, now with 6 vertices, and then you have to collapse that down. so that might work but would take several more moves.

one exchange move changes spectacles to theta

=====================

but, like you say, we still have to prove that these moves will take down an arbitrary finite trivalent graph

how would you handle spectacles for a 3-eyed man?

O-O-O
 
  • #36
AH! O-O -> "PHI" with one circle with the bar going vertically, which is of course the original graph. Neat! Now the three-specs. On the left two lenses reduce them to a "PHI" using your method. Now we have a PHI linked to a circle by a horizontal bar, The two nodes of the PHI plus the node at its end of the bar make a triangle so do a compression, which reduces the left PHI to just a circle joined to the bar. Now you have two-specs as before. So you have an induction for n-specs; given n=2 the problem is solved, and giving that it is solved for n=k-1, this shows it is also solved for n=k. So it is solved for all n \ge 2.
 
  • #37
excellent
I just got back to the computer, didn't see your reply 'til now
 
  • #38
selfAdjoint said:
AH! O-O -> "PHI" with one circle with the bar going vertically, which is of course the original graph. Neat! Now the three-specs. ...

I understand your word-pictures. So far we are getting along OK without a blackboard.

what you mean by the PHI graph I understand to be the THETA rotated 90 degrees. (it helps intuition to have it aligned up and down like phi.)

we have two things to think about, then maybe we can move on to Lecture #3 and #4 (or whatever people want)

A. why are moves important, what is this toy model showing us?

Moves have amplitudes. The dynamics of the theory is with path integrals.
A HISTORY is a sequence of moves (a history can be pictured as a foam looking like a spinfoam without labels, in this toy case) that get you from an initial graph to a final graph.
The AMPLITUDE of a particular history is the product of all the amplitudes of all the moves that make it up.
A PATH INTEGRAL is an amplitude-weighted sum of all the histories that get from some initial to some final.

So moves are basic to dynamics. Also Renate Loll uses moves of a different sort called Monte Carlo moves to randomize triangulated spacetimes and to approximate the CDT path integral. Another reason to get a feel for dynamics based on moves---some of it carries over.

B. Before we move on, if people want to move on and talk more about Smolin Lectures, we could wrap up the homework. I will talk about that in the next post.
 
  • #39
Ah just now saw this. I just worked out the other half of the problem (reducing everything down to n-specs) on Christine's blog:

Let's pick an arbitrary loop in the spinnetwork with 3 or more links, if it has more then 3 shrink it down to 3 links by exchange moves (which with respect to the loop we picked reduces a link to a node), then eliminate it using a contraction. This strategy eliminates a loop, thus by iteration we can eliminate all loops with 3 or more links, but the n-specs are the only trivalent spinnetworks without loops with 3 links. qed.
 
  • #40
CD said:
Anything I come up with is for closed graphs - no open ended vertices. In this case any finite trivalent graph will have an even number of nodes. Two representing a theta. In this case an even n node graph can be reduced to theta with (n-2)/2 contractions.

Nonclosed graphs are not trivalent, furthermore ergodicity is not true for them ;)

Counterexample to your above strategy: The cube. You can not apply a contraction there. You need to apply exchange moves first.

You also clearly can not replace the exchange move by a number of expansion/contractions since these can only add to the number of links around each face, but not reduce them below 4 basically everything you do with these moves is confined to the corners of the cube without changing it's overall shape.

So exchange moves are really quite important for the overall graph structure and not just once you get down to n-specs.
 
  • #41
selfAdjoint, you and I may be the only folks interested in this but just for completeness

[EDIT: i just now saw F-H post #39 and 40. So F-H also proved it! But more elegantly it looks like (havent read his yet). I will still leave this what I wrote and not erase it, so we have two people doing the same thing different ways and styles.]

I think the rough idea is this (you may have pointed this out in an earlier post already)

it is going to be a proof by induction on the size of the graph and one will imagine the SMALLEST graph that cannot be reduced to a theta---or something like that.

and one can see that it is connected, otherwise one of the components would be a smaller uncollapsible.

I think WLOG one can say that the uncollapsible graph has no vertex that is connected to only one other vertex (and to itself) in this kind of situation

...-O

or one could do an exchange move and have an uncollapsible graph of the same size that makes the vertex be connected to more than one other.

This graph will not have any place where there are THREE vertices adjacent to each other----there are no little "triangles" made of a triplet of vertices. Otherwise one could do a contraction move and have a new graph with two less vertices.

This graph will not have any place that looks like this

...-O-...

(this is 4 vertices with the two in the middle joined by two edges)
or you could do an exchange move and have a "triangle" of 3 adjacent vertices.

so there are no double connections between vertices---it is a very vanilla unimaginative graph. sort of like a TREE but because it is finite and has to end somewhere it has to have connections among the branches

so we know there are no triangles in the graph, and we ask "are there any four-gons? or pentagons? or hexagons?" and we ask what is the SMALLEST gon that there can be in this uncollapsible graph.

How many links can you go before you come round to where you started? What is the smallest cycle?

This is the kicker question that my earlier handwaving considering various cases leads up to. Because if the smallest cycle is N, then you can do an exchange move and get a (still uncollapsible) graph where the smallest cycle is N-1.

I think that is QED, or would be if I could just make pictures illustrate and be very careful and rigorous. I think that is the idea of the proof. If anyone has a better plan, or a clearer way of describing it, please show us.
 
Last edited:
  • #42
Oh hey f-h, so glad to see you! I was just writing my post trying to prove that thing for selfAdjoint, and I did not see your posts. I guess you proved it some simpler way, I haven't read yours yet. Great!
 
  • #43
Ah, nice way of getting a contradiction there! We have the same basic observation: n-Loops get turned into n-1 loops by exchange moves for n>2.

Shrink n-loops to n-1 loops using exchange moves. Eliminate 3-loops using contraction, and 1-loops using exchange moves.
You are left with a graph containing only 2-loops. There is only one such graph: Theta.
 
  • #44
Very good! Thank you both. Marcus I liked your "infinite descent" approach, and f-h that's so neat and complete. Congratulations.
 
  • #45
Fine, we seem to have settled the homework problem.
I am wondering about moving on.

Question to f-h and selfAdjoint: have you watched Lecture #2?

the last time we discussed practical matters, selfAdjoint system was crashing and it sounded painful to watch anything

then CD said he had files that could be downloaded, but i am not sure that would work for selfAdjoint or that he wants to go that route

Has anything happened in the meantime? Have you found a way to get around the problem?

Unless someone has another suggestion, let's all watch Lecture #2 and try to summarize what it is about.

=================
I EDITED THIS---EARLIER I MISREMEMBERED SOMETHING AND THOUGHT #2 WAS A REVIEW and suggested skipping it, but it isn't the review. IMO is a good one to watch!
(It is lecture #4 which is a review, and which we might skip.)
 
Last edited:
  • #46
f-h said:
Nonclosed graphs are not trivalent, furthermore ergodicity is not true for them ;)

Counterexample to your above strategy: The cube. You can not apply a contraction there. You need to apply exchange moves first.

You also clearly can not replace the exchange move by a number of expansion/contractions since these can only add to the number of links around each face, but not reduce them below 4 basically everything you do with these moves is confined to the corners of the cube without changing it's overall shape.

So exchange moves are really quite important for the overall graph structure and not just once you get down to n-specs.
Yes you are correct, thank you. I think I may be missing something here. So, these are just the pachner moves 1-3, 3-1 and exchange?
 
  • #47
CD said:
Yes you are correct, thank you. I think I may be missing something here. So, these are just the pachner moves 1-3, 3-1 and exchange?

Yep. Precisely. Thanks for pointing that out.

I am up to lecture 7 or so, so whatever you want to look at next is fine by me. I might not have much time to contribute over the next week anyways unfortunately.
 
  • #48
while we are deciding what to do and whether to move on, I will tie up a loose end where there was some disagreement about terminology at Christine's blog. Yesterday I posted this where I used the word "ergodic"

marcus said:
I just watched Lecture 1 again and I think the only main homework or thing to check is the fact about a certain set of moves being ergodic (in this case meaning that you can get from any trivalent graph to any other by repeatedly applying just those moves)
...

In this situation that is simply what ergodic means. that you can get from any graph to any other graph by doing enough of these. We just showed that in the homework. Because if you can reduce any graph to a particular one, say theta, then you can get back from theta TO that graph by reversing the moves.

So you can get from A to B by collapsing A down to theta and then expanding theta out to B. There will certainly be OTHER ways to do it but that shows there is at least one.

The mental image I have of ergodic transformations is shuffling a deck of cards---which you do by repeating elementary moves. If the elementary shuffle moves are really ERGODIC then that means that if you do elementary shuffle moves enough times you can get ANY ordering of the deck.

Sorry, have to go, be back to finish later
=================
my wife is reading a book about Medieval monks and the relics they had at their monasteries. and the book is about other things too, but Chapter 8 is about things like
FURTA SACRA which is adventure stories about how bold and crafty monks from monastery A were sent to steal the relics at monastery B. quite a lot of that happened. there were spies and moles, sometimes a heist operation took years to prepare and put into effect.
and she tells me that at one point they were confronted with the problem that there were two heads of John the Baptist, at two different competing monasteries, and they resolved the logical dilemma by declaring that both heads were authentic, simply that one was his head when he was a young man and the other was when he was older. Of course we all know the story of how Salome danced for Herod and got him to have John the Baptist's head chopped off and given her as a present---which would have been the origin of the second of the two relics. this book is "Off the Road" by an editor of Harper's magazine, named Jack Hitt.
====================

Well we still have to draw the connection between THIS kind of ergodic----moves which effectively mix things around by getting from any configuration to any other configuration---and the OTHER kind of ergodic that people are used to where there is a probability measure on a set of points and a transformation of the set.

http://www.cscs.umich.edu/~crshalizi/notebooks/ergodic-theory.html

According to that defintion the transformation is ergodic, for that probability measure, if any invariant sets have either probability 1 or zero. In effect that means that the only way a nontrivial set can be invariant is that (up to sets of measure zero) it is the WHOLE THING.

But if you think about it that just means the transformation thoroughly moves things around because you can start at any point and applying the transformation over and over will eventually get you anywhere else. If it didnt, you could have an invariant set which was only a part of the whole. an ergodic transformation, if you keep repeating it, explores the whole set.

==========
those University of Michigan notes say that it was Ludwig Boltzmann who coined the term ergodic and what he originally meant by it was what SMOLIN means---our meaning here! Boltzmann thought ergodic meant that it will take you from any point to any other point if you do it enough times.

funny, going by the Greek root ergos, work energy, ergodic should mean energetic, vigorous, hard-working. I wonder if that was what the mighty Ludwig meant---I would call it THOROUGHLY MIXING.
 
Last edited:
  • #49
Three was just classical dynamics. Developing the dynamics of a time reparameterization invariant system. I haven't watched four yet but it sounds like its just a review of various topics.
 
  • #50
CD said:
Three was just classical dynamics. Developing the dynamics of a time reparameterization invariant system. I haven't watched four yet but it sounds like its just a review of various topics.

You are right, it is FOUR that is the review.
I misremembered and thought that TWO was the inessential one that could be skipped.
Sorry sorry sorry.

I will go back and correct my post, and propose (we don't have to do it but this is just my suggestion) that we just move on to Lecture #2.

(the skipping idea was based on misremembering, I take it back)
 
Back
Top