Message Boards

GROUPS:

Staff Picks Wolfram Science Physics Graphs and Networks Wolfram Summer School Wolfram Function Repository Wolfram Fundamental Physics Project

Marcelo Amaral

[WSS21] On charge -spin networks from multiway systems branchial graphs

Marcelo Amaral, Quantum Gravity Research

Posted 2 months ago

700 Views

1 Reply

6 Total Likes

Follow this post

On charge -spin networks from multiway systems branchial graphs by Marcelo Amaral Quantum Gravity Research Abstract: We find spin networks with support on multiway branchial graphs, then we solve as a constraint for SU(3) representations that have support on the same base spin network. The interpretation of SU(3) representations network respecting their respective intertwiners at nodes is that of a charge network over the spin quantum number one. We implemented new functions to compute N-valent intertwiner for both SU(3) and SU(2) or SO(3) as well as a natural way to assign labels to branchial graphs from the causal structure in line with its quantum mechanics interpretation suggesting good asymptotics in the large spin/charge quantum number limit - here the large graph updating limit. 1 From Branchial Graphs to Spin Network Structure in a Simple Way The Wolfram physics project suggested the Wolfram model as being a significant generalization of the concept of a spin network or spin foam in loop quantum gravity [1].However, with the crucial distinction that all salient algebraic and geometrical features of Wolfram model systems are purely emergent [1]. One idea to address the emergence of spin foam from Wolfram multiway systems recently proposed was to find a rule that generates a hypergraph as desired (tetrahedral populated edge to edge) and then attach the associated group and algebraic structures to compute quantum gravity amplitudes. But to find such a rule was a major difficulty in the implementation [2]. We implement a general N-valent intertwiner spin network on non-regular graphs, which allows us to address more general structures. Spin networks are about coupling and decomposition of tensorial representations of compact Lie groups and Lie algebras, which are direct related to quantum mechanics states.The place to look for connection of those states on multiway systems is with the branchial graphs where the connection with quantum mechanics is proposed to happen [3,4]. One of the mathematical roots of quantum mechanics is on the root system of Lie algebras [5], which generalize the SU(2) representation theory. In this spirit we generalize SU(2) spin networks to SU(3) ones, which could be more appropriated called charge network. But we implement a constraint that the spin network need to have support on branchial graph and the charge network must have support on the spin network, which is possible by solving one constraint equation for SU(3) labels over a SU(2) sub-group basis [6,7]. To give some more motivation, from loop quantum gravity results, a quantum state of geometry can be given by tri- or four-valent spin network states Γ Ψ j,k , where the notation is to assign spin j's to edges and additional number k, for the four-valent ones, to nodes of a graph Γ . The full state is given by the superposition of all allowed combinations of j's and k's in SU(2) representation theory constrained by the triangular inequality and some other constraints on the nodes, Γ Ψ ( U l ) ∑ j,{k} C j,{k} Γ Ψ j,{k} . Γ Ψ j,k is given explicitly by associating Wigner matrices to edges and Wigner 3j-symbol to nodes. For the four valent node there are two 3j-symbols coupled with a common internal indices k. We explore a generalization to arbitrary valence nodes on non-regular graphs: Γ Ψ j,{k} ( U l ) 1 { m i } ι k 1 1 .. k 1 q1 ... l { m i } ι k l 1 .. k N ql j 1 D {m ′ m } 1 ( U 1 )... j L D {m ′ m } L ( U L ) (1)where the indices q indexes the internal indices of the node space (for four-valent is 2, for five-valent is 3 and so on), the indices l is for the edges, where the notation l { m i } is to specify the specific m's for the correct valence, having L edges with U l group elements and N nodes in the graph. The question about the minimum spin configurations for a general graph that give a valid spin network can be addressed by different algorithm but we are interested in connections with multiway systems. The multiway systems as an underlying pre-physical abstract substrate is a kind of system where the representations and the things that should be represented must be the same to be part of the reality engine. In this spirit we are looking for an additional constraint on the quantum gravity spin network states and in the multiway system. The constraint is that the spin number labeling configuration need to have support on the underlying causal and branchial structure. We call a multiway branchial graph from a causal multiway system by w Γ and a valid edge weight configuration from the causal and branchial structure by W( w Γ ) . A more elaborated problem is to find W( w Γ ) that gives a minimum spin network covering and then to find rules that evolve the graph such that W( w Γ ) always correspond to valid spin networks. The general problem we leave for future investigations and here we provide a simple example where we can implement the constraint and have explicitly examples of states Γ Ψ j,{k} ( U l ) ~ w Γ Ψ W{j,{k}} ( U l ) . (2)Let us start, for simplicity, choosing a integer label decoration of a branchial graph from multiway substitutions systems (considering SO(3) instead of the full SU(2) for simplicity). The decoration will be given from the states graph. The magnitude on edges will be given by the number of ancestors in common at first backwards level. And we will choose rules that is already known to be causal invariant because any possible interpretation of branchial graphs in terms of common ancestors depends on having causal invariance. In[]:= BranchialEdgeLabelsFromCausalGraph[gbranchial_,gcausal_]:=With[{vertexCausalIncidentsAdjacents=Map[AdjacencyList[gcausal,#]&,AdjacencyList[gbranchial,#]&/@VertexList[gbranchial],{2}],vertexCausalIncidentsCentral=AdjacencyList[gcausal,#]&/@VertexList[gbranchial]},Table[Table[Length[Intersection[vertexCausalIncidentsCentral[[i]],vertexCausalIncidentsAdjacents[[i]][[j]]]],{j,1,Length[vertexCausalIncidentsAdjacents[[i]]]}],{i,1,Length[vertexCausalIncidentsCentral]}]] 1.1 Branchial Graph Labeling for Fibonacci Golden Rule The Fibonacci Golden Rule is given below and the causal state graph and branchial graph computed to certain level in the update multiway system: In[]:= rule={"A""AB","B""A"};initialCondition="A";levelBranchial=5;gcausalFGR=ResourceFunction["MultiwaySystem"][rule,initialCondition,levelBranchial,"StatesGraph"];gbranchialFGR=ResourceFunction["MultiwaySystem"][rule,initialCondition,levelBranchial,"BranchialGraph"] Out[]= Now we use BranchialEdgeLabelsFromCausalGraph function to get the labeling: In[]:= branchialSpinLabels=BranchialEdgeLabelsFromCausalGraph[gbranchialFGR,gcausalFGR] Out[]= {{2,1,2,2,1},{2,1,2,1,1,1},{1,1,2,1,1,1},{2,2,1,2,1},{2,1,2,1,2,1,1},{1,1,1,2,2,2,1},{1,1,1,1,2,1},{1,1,1,1}} branchialSpinLabels gives a list with the labels organized by intertwiner nodes. 1.2 Branchial Graph Labeling for wm148 Below a labeling for a Wolfram model rule, the rule wm148. We first compute the causal state graph and the branchial one: In[]:= gcausalWM148=ResourceFunction["MultiwaySystem"]["WolframModel"{{{x,y}}{{x,y},{y,z}}},{{{0,0}}},4,"StatesGraph"];gbranchialWM148=ResourceFunction["MultiwaySystem"]["WolframModel"{{{x,y}}{{x,y},{y,z}}},{{{0,0}}},4,"BranchialGraph"] Out[]= And then the assignment: In[]:= branchialSpinLabels2=BranchialEdgeLabelsFromCausalGraph[gbranchialWM148,gcausalWM148] Out[]= {{1},{1,1,1,1},{1,1,1,1,1},{1,1,1},{1,1,1,1,1,1},{1,1},{1,1,1,1,1},{1,1,1},{1,1,1}} 1.3 SU(2) Spin Networks on Non-Regular N-Valent Branchial Graphs The explicit computations will be done in a specific basis but general procedures for bases transformations is well known in the recoupling theory literature. The coefficients are not normalized. To check if the labels generated above correspond to valid spin network we implement some functions. We can check that they give valid spin network states by recursively checking that three valent nodes respect usual threeJsymbol selection rules. Let's first check the three-valent one: In[]:= su2ThreeValentIntertwinerQ[intertwinerThreeValent_]:=Module[{return=False},(Todo:needtoincludem'sindicestoworktheconditionwithmi={0,0,0})If[IntegerQ[Total[intertwinerThreeValent]]&&intertwinerThreeValent[[3]]≥Abs[intertwinerThreeValent[[2]]-intertwinerThreeValent[[1]]]&&intertwinerThreeValent[[3]]≤(intertwinerThreeValent[[2]]+intertwinerThreeValent[[1]]),return=True;];Return[return];] For a general N-valence one we can decompose in a three-valent network, which correspond to choose a specific base: In[]:= su2NValentIntertwinerQ[intertwinerNValent_]:=Module[{return=False,kList},If[Length[intertwinerNValent]1,return=True];If[Length[intertwinerNValent]2,return=su2ThreeValentIntertwinerQ[Insert[intertwinerNValent,0,1]]];If[Length[intertwinerNValent]3,return=su2ThreeValentIntertwinerQ[intertwinerNValent]];If[Length[intertwinerNValent]3,return=su2ThreeValentIntertwinerQ[intertwinerNValent]];If[Length[intertwinerNValent]4,(getlistofintermediaryallowedspins)kList=Range[Abs[intertwinerNValent[[1]]-intertwinerNValent[[2]]],intertwinerNValent[[1]]+intertwinerNValent[[2]]];Do[If[su2ThreeValentIntertwinerQ[{intertwinerNValent[[1]],intertwinerNValent[[2]],kList[[i]]}]&&returnFalse,return=su2ThreeValentIntertwinerQ[{kList[[i]],intertwinerNValent[[3]],intertwinerNValent[[4]]}]],{i,1,Length[kList]}];];If[Length[intertwinerNValent]>4,kList=Range[Abs[intertwinerNValent[[1]]-intertwinerNValent[[2]]],intertwinerNValent[[1]]+intertwinerNValent[[2]]];Do[If[su2ThreeValentIntertwinerQ[{intertwinerNValent[[1]],intertwinerNValent[[2]],kList[[i]]}]&&returnFalse,return=su2NValentIntertwinerQ[Insert[Delete[intertwinerNValent,{{1},{2}}],kList[[i]],1]];],{i,1,Length[kList]}];];Return[return];] To finish we need to go over all the nodes: In[]:= su2SpinNetworkQ[intertwinersNValent_]:=AllTrue[intertwinersNValent,su2NValentIntertwinerQ]; Now we can check if the decorations we have chosen are good: In[]:= su2SpinNetworkQ[branchialSpinLabels]su2SpinNetworkQ[branchialSpinLabels2] Out[]= True Out[]= True We compute the coefficients l { m i } ι k l 1 .. k N ql from equation (1) for non-regular graphs by decomposing in three-valent ones and checking if each combination with internal spins are valid. Therefore we end having only the valid ones. We use a recursive function that in the end uses the Mathematica ThreeJSymbol function. So we start with a function for computing for three-valent nodes: In[]:= su2ThreeValentIntertwinerEvaluation[intertwinerThreeValent_]:=Module[{coefficients={},miList,mList,threeJTemp},If[su2ThreeValentIntertwinerQ[intertwinerThreeValent],miList=Range[-#,#]&/@intertwinerThreeValent;mList=Select[Tuples[{miList[[1]],miList[[2]],miList[[3]]}],Total[#]0&];Do[If[Not[OddQ[Total[intertwinerThreeValent]]&&mList[[mi]]{0,0,0}],threeJTemp=Quiet[ThreeJSymbol[{intertwinerThreeValent[[1]],mList[[mi,1]]},{intertwinerThreeValent[[2]],mList[[mi,2]]},{intertwinerThreeValent[[3]],mList[[mi,3]]}]];coefficients=AppendTo[coefficients,{intertwinerThreeValent,mList[[mi]],threeJTemp}];(Todo:threeJTempWithContractedFactor=threeJTemp(-1)^(jk-mList[[mi,3]]);)],{mi,1,Length[mList]}];];Return[coefficients];] For the evaluation will be useful to have a four-valent intertwiner, which evaluate independently the 2 three-valent ones with the intermediary spins (this function is not really necessary): In[]:= su2FourValentIntertwinerEvaluation[intertwinerFourValent_]:=Module[{coefficients={},kList,coefficientsTemp1,coefficientsTemp2},If[Length[intertwinerFourValent]4,(Herewegetalistofintermediaryallowedspins)kList=Range[Abs[intertwinerFourValent[[1]]-intertwinerFourValent[[2]]],intertwinerFourValent[[1]]+intertwinerFourValent[[2]]];Do[If[su2ThreeValentIntertwinerQ[{intertwinerFourValent[[1]],intertwinerFourValent[[2]],kList[[i]]}],coefficientsTemp1=su2ThreeValentIntertwinerEvaluation[{intertwinerFourValent[[1]],intertwinerFourValent[[2]],kList[[i]]}];If[su2ThreeValentIntertwinerQ[{kList[[i]],intertwinerFourValent[[3]],intertwinerFourValent[[4]]}],coefficientsTemp2=su2ThreeValentIntertwinerEvaluation[{kList[[i]],intertwinerFourValent[[3]],intertwinerFourValent[[4]]}];coefficients=AppendTo[coefficients,Join[coefficientsTemp1,coefficientsTemp2]](Herewewillneedtoimplementthemissing(-1)^(kList[[i]]-mk)thatsumovercommomm's-probablyitwillbebettertorewritethisfunctionwiththeexplitdependenceoninternalk)]],{i,1,Length[kList]}];];Return[coefficients];] Now we can use the two functions above to implement a recursive function to compute the coefficients for nodes of general valence: In[]:= su2NValentIntertwinerEvaluation[intertwinerNValent_]:=Module[{coefficients={},coefficientsTemp1,kList,mlist},If[Length[intertwinerNValent]1,mlist=Range[-intertwinerNValent[[1]],intertwinerNValent[[1]]];coefficients=Table[{Insert[intertwinerNValent,0,{{1},{1}}],{0,0,mlist[[i]]},(-1)^(intertwinerNValent[[1]]+mlist[[i]])},{i,1,Length[mlist]}];];If[Length[intertwinerNValent]2,coefficients=su2ThreeValentIntertwinerEvaluation[Insert[intertwinerNValent,0,1]]];If[Length[intertwinerNValent]3,coefficients=su2ThreeValentIntertwinerEvaluation[intertwinerNValent]];If[Length[intertwinerNValent]4,coefficients=su2FourValentIntertwinerEvaluation[intertwinerNValent]];If[Length[intertwinerNValent]>4,kList=Range[Abs[intertwinerNValent[[1]]-intertwinerNValent[[2]]],intertwinerNValent[[1]]+intertwinerNValent[[2]]];Do[coefficientsTemp1=su2ThreeValentIntertwinerEvaluation[{intertwinerNValent[[1]],intertwinerNValent[[2]],kList[[i]]}];If[su2ThreeValentIntertwinerQ[{intertwinerNValent[[1]],intertwinerNValent[[2]],kList[[i]]}]&&coefficientsTemp1!={},coefficients=AppendTo[coefficients,Join[coefficientsTemp1,su2NValentIntertwinerEvaluation[Insert[Delete[intertwinerNValent,{{1},{2}}],kList[[i]],1]]]];],{i,1,Length[kList]}];];Return[coefficients];] And then to evaluate a set of intertwiners: In[]:= su2SpinNetworkEvaluation[intertwinersNValent_]:=Module[{coefficients={}},If[su2SpinNetworkQ[intertwinersNValent],coefficients=su2NValentIntertwinerEvaluation/@intertwinersNValent;];Return[coefficients];] Let us apply the functions above to calculate the coefficients for the Fibonacci golden rule: In[]:= su2SpinNetworkStateCoefficients=su2SpinNetworkEvaluation[branchialSpinLabels];({{js},{ms},threeJs}*)su2SpinNetworkStateCoefficients//DimensionsTable[su2SpinNetworkStateCoefficients[[i]]//Dimensions,{i,1,Length[su2SpinNetworkStateCoefficients]}] Out[]= {8} Out[]= {{3},{3},{3},{5},{3},{3},{3},{3}} In[]:= RandomChoice[su2SpinNetworkStateCoefficients[[1,1]]] Out[]= {1,2,3},{-1,-2,3}, 1 7 ,{1,2,3},{-1,-1,2},- 2 21 ,{1,2,3},{-1,0,1}, 2 35 ,{1,2,3},{-1,1,0},- 1 35 ,{1,2,3},{-1,2,-1}, 1 105 ,{1,2,3},{0,-2,2},- 1 21 ,{1,2,3},{0,-1,1},2 2 105 ,{1,2,3},{0,0,0},- 3 35 ,{1,2,3},{0,1,-1},2 2 105 ,{1,2,3},{0,2,-2},- 1 21 ,{1,2,3},{1,-2,1}, 1 105 ,{1,2,3},{1,-1,0},- 1 35 ,{1,2,3},{1,0,-1}, 2 35 ,{1,2,3},{1,1,-2},- 2 21 ,{1,2,3},{1,2,-3}, 1 7 ,{3,2,1},{-3,2,1}, 1 7 ,{3,2,1},{-2,1,1},- 2 21 ,{3,2,1},{-2,2,0},- 1

[WSS21] On charge -spin networks from multiway systems branchial graphs

1 From Branchial Graphs to Spin Network Structure in a Simple Way

1.1 Branchial Graph Labeling for Fibonacci Golden Rule

1.2 Branchial Graph Labeling for wm148

1.3 SU(2) Spin Networks on Non-Regular N-Valent Branchial Graphs