Skip to main content

group theory - What is the command to find function invariant?


What is the command to find function invariant?


http://demonstrations.wolfram.com/AFunctionInvariantUnderAGroupOfTransformations/


what is algorithm it use to calculate this?


Edit


there is a book do it in this way


Hope this book give you an idea on how to do multivariate case




Answer



The Wolfram Demonstration in its original version was wrong. The demo has since been corrected (updated March 2013). The first five functions called $H$ there (which were originally the only functions listed) do not form a group. You need a sixth element to make the set closed under multiplication!


This can be checked by defining the six functions as follows, with the missing element as the last function. I call the table of functions h, and then construct the multiplication table:


h = {# &, 1/# &, 1 - # &, 1/(1 - #) &, (# - 1)/# &, #/(# - 1) &};

TableForm[multiplicationTable = Table[
Simplify[
h[[i]][h[[j]][x]]
],
{i, 1, 6}, {j, 1, 6}

]
]


$\left( \begin{array}{cccccc} x & \frac{1}{x} & 1-x & \frac{1}{1-x} & \frac{x-1}{x} & \frac{x}{x-1} \\ \frac{1}{x} & x & \frac{1}{1-x} & 1-x & \frac{x}{x-1} & \frac{x-1}{x} \\ 1-x & \frac{x-1}{x} & x & \frac{x}{x-1} & \frac{1}{x} & \frac{1}{1-x} \\ \frac{1}{1-x} & \frac{x}{x-1} & \frac{1}{x} & \frac{x-1}{x} & x & 1-x \\ \frac{x-1}{x} & 1-x & \frac{x}{x-1} & x & \frac{1}{1-x} & \frac{1}{x} \\ \frac{x}{x-1} & \frac{1}{1-x} & \frac{x-1}{x} & \frac{1}{x} & 1-x & x \\ \end{array} \right)$



To see that this table would be incomplete without the last function $x/(x-1)$, look at the element {2, 5} in the table: it is not equal to any of the first five functions.


Now to answer the question of how to construct a function that is invariant under this (corrected) group.


This is done in group theory using projection operators. Here we're only interested in the simplest (identity) representation of the group, for which the projector consists of adding all the group actions on an arbitrary trial function and dividing by the order n of the group $\mathcal{G}$. Here is the formula in mathematical notation and then as a Mathematica definition:


$$f_\text{sym}(x)\equiv \frac{1}{n}\sum_{H\in \mathcal{G}} f(H(x)) $$



symmetrize[f_] :=
With[{n = Length[h]},
Function[{x},
1/n Total@Map[Composition[f, #][x] &, h]
]
]

Here f is the trial function, and the simplest choice is


f[x_] := x;
fSym = symmetrize[f];

fSym[x]


$\frac{1}{6} \left(\frac{x-1}{x}+\frac{1}{1-x}+\frac{1}{x}+\frac{x} {x-1}+1\right)$



Check that this is indeed an invariant function:


Table[
Simplify[fSym[h[[i]][x]] == fSym[h[[j]][x]]],
{i, 1, 6}, {j, 1, 6}] // TableForm



$\left( \begin{array}{cccccc} \text{True} & \text{True} & \text{True} & \text{True} & \text{True} & \text{True} \\ \text{True} & \text{True} & \text{True} & \text{True} & \text{True} & \text{True} \\ \text{True} & \text{True} & \text{True} & \text{True} & \text{True} & \text{True} \\ \text{True} & \text{True} & \text{True} & \text{True} & \text{True} & \text{True} \\ \text{True} & \text{True} & \text{True} & \text{True} & \text{True} & \text{True} \\ \text{True} & \text{True} & \text{True} & \text{True} & \text{True} & \text{True} \\ \end{array} \right)$



Now the real fun starts if you choose different trial functions f.


f[x_] := Exp[x - x^2]
fSym = symmetrize[f];
Simplify[fSym[x]]


$\frac{1}{3} \left(e^{\frac{x-1}{x^2}}+e^{x-x^2}+e^{-\frac{x}{(x-1) ^2}}\right)$




And believe it or not, this is also an invariant function. To verify, repeat the check I did above.


Edit: check the given invariant function


We can also verify that the function that is given in the Wolfram demonstration is indeed one of the possible invariant functions, by showing that it is mapped onto itself by the projection operator symmetrize:


invariant1[x_] := (x^2 - x + 1)^3/(x^2 (x - 1)^2)

Simplify[symmetrize[invariant1][x] == invariant1[x]]

(* ==> True *)

Comments

Popular posts from this blog

plotting - How to draw lines between specified dots on ListPlot?

I would like to create a plot where I have unconnected dots and some connected. So far, I have figured out how to draw the dots. My code is the following: ListPlot[{{1, 1}, {2, 2}, {3, 3}, {4, 4}, {1, 4}, {2, 5}, {3, 6}, {4, 7}, {1, 7}, {2, 8}, {3, 9}, {4, 10}, {1, 10}, {2, 11}, {3, 12}, {4,13}, {2.5, 7}}, Ticks -> {{1, 2, 3, 4}, None}, AxesStyle -> Thin, TicksStyle -> Directive[Black, Bold, 12], Mesh -> Full] I have thought using ListLinePlot command, but I don't know how to specify to the command to draw only selected lines between the dots. Do have any suggestions/hints on how to do that? Thank you. Answer One possibility would be to use Epilog with Line : ListPlot[ {{1, 1}, {2, 2}, {3, 3}, {4, 4}, {1, 4}, {2, 5}, {3, 6}, {4, 7}, {1, 7}, {2, 8}, {3, 9}, {4, 10}, {1, 10}, {2, 11}, {3, 12}, {4, 13}, {2.5, 7}}, Ticks -> {{1, 2, 3, 4}, None}, AxesStyle -> Thin, TicksStyle -> Directive[Black, Bold, 12], Mesh -> Full, Epilog -> { Line[ ...

dynamic - How can I make a clickable ArrayPlot that returns input?

I would like to create a dynamic ArrayPlot so that the rectangles, when clicked, provide the input. Can I use ArrayPlot for this? Or is there something else I should have to use? Answer ArrayPlot is much more than just a simple array like Grid : it represents a ranged 2D dataset, and its visualization can be finetuned by options like DataReversed and DataRange . These features make it quite complicated to reproduce the same layout and order with Grid . Here I offer AnnotatedArrayPlot which comes in handy when your dataset is more than just a flat 2D array. The dynamic interface allows highlighting individual cells and possibly interacting with them. AnnotatedArrayPlot works the same way as ArrayPlot and accepts the same options plus Enabled , HighlightCoordinates , HighlightStyle and HighlightElementFunction . data = {{Missing["HasSomeMoreData"], GrayLevel[ 1], {RGBColor[0, 1, 1], RGBColor[0, 0, 1], GrayLevel[1]}, RGBColor[0, 1, 0]}, {GrayLevel[0], GrayLevel...

Is there a way to do conditional matrix loop using 'continue'

I have the following: n = 3; m = 5; ww = RandomReal[{0, 0.1}, {n, n}]; uu = RandomReal[{0, 1}, {m, n}]; pp = RandomReal[{0, 1}, {n, n}]; ss = RandomInteger[{0, 5}, {m, n}]; Grid[{{"ww", "uu", "pp", "ss"}, {ww // TableForm, uu // TableForm, pp // TableForm, ss // TableForm}}, Spacings -> {5, 2}, Dividers -> All] where I would like to look at every element of matrix ss and produce a matrix tt , with zeroes at the locations in ss which have zeroes, and in all other positions do the following: tt = (-1/Subscript[ww, m]) Log[(1 - uu)/(Subscript[pp, m - 1])], where Subscript[ww, m] is the value at index of ww matrix and where Subscript[pp, m - 1] is the value at index-1 of pp matrix. So for example if the first value ever read from matrix ss happens to be 2, then value taken from matrix ww would be from the row 2, but from pp would be from row 1. Also how to tell difference between a 0 as a valid value from within the matrix elemen...