• 0 Vote(s) - 0 Average
• 1
• 2
• 3
• 4
• 5
 Jabotinsky IL and Nixon's program: a first categorical foundation MphLee Long Time Fellow    Posts: 270 Threads: 23 Joined: May 2013 05/10/2021, 07:22 PM (This post was last modified: 05/21/2021, 11:27 PM by MphLee.) This follows from the discussion held at: Some "Theorem" on the generalized superfunction, (May 07, 2021), Tetration Forum. Quote:Such that . A little unused theorem on this forum, is classifying this superfunction as a flow. I like to call this object, Which can be referred to as the logarithm of the super function; or traditionally it's known as a generator of a flow map. Now, for every super function there is one logarithm, and for every logarithm there is one superfunction. There is no obvious connection between the logarithm and the initial function ; but you can derive a formula for it. Ok... I was reading this point of James' post in the thread linked above and something just clicked in my brain. The downside of working on the elementary building blocks of iteration theory is that I'm lagging some light-years behind all the Sheldon's cutting edge computations, Trappmann and Kouznetsov's method and all of the James' holomorphic witchcraft. But I can see some light. I'm now strongly convinced that the composition integral program is the right way. The following is a preliminary meditation on the partial derivatives of flows and how to rephrase the key ingredients in categorical terms. I'm excited by this because this is the first time I'm able to embed some differential features into my algebraic framework. This is not (only) an empty philosophical post about notations and definitions. I tried to generalize the factorization of the partial derivatives of a flow in terms of Jabotinsky Iterative Logarithm and the flow itself, derived from this the property that makes the partial differential a natural transformation and added some exotic corollaries from that. SOME NOTATIONAL LUNA PARK Remember the definition of a -time dynamical system on X (or -system): it is just that of a left monoid action over the set X. Here is the monoid of time (better if commutative or even better if abelian group) written in additive notation. When the monoid is the group of real numbers we call it flow over X. When X is a vector space and the action is linear then we have a linear representation of . def 1a. A T-action is a map s.t. and . Observation. The definition seems abstract and arbitrary... but it is not really. Remember the existence of the curry isomorphism. It is the isomorphism of "curryng a variable". It shows that the set of functions is "essentially the same" as the set of functions of functions . The isomorphism is given by the function "curry the B variable" where and def 2. It is now evident that   is a T-action over X if and only if is a monoid homomorphism. Observe that  is also a monoid by composition. if f is a T-action we have and Slogan. Monoid actions are monoid homomorphisms. Notation. Let  be a function enough well behaved over some sets where all the differential structure is on the right place. I write    for the partial derivative in the i-th variable. We get new functions JOURNEY to CATEGORICAL HELL Following JmsNxn. I guess it is clear that if our monoid of time has some topological/differential structure (like R or C actions) we can consider the partial derivative of the monoid-action/dynamical system. Let  be a T-action (differentially well behaved) consider the partial derivative respect to the T variable . As James writes At this point just notice that (this is called Jabotinsky's iterative logarithm ),  thus we have a Quote:"Generator lemma" 1. Observe that fixing the variable gives us James' differential equation . If instead we unleash the curry isomorphism we can render the generator lemma as a factorization of single-valued functions. Maybe this lemma is not important but it has interesting consequences if one wants to translate all of this into category theory. With much boldness and unfounded certainty I declare theorem the following harmless corollary. Quote:Theorem 1.  For all we have proof: Mutiplication corollary. Let n be a natural number Weird metric-like corollary. If T is a group, and is invertible then I know, all this seems harmless and empty but it isn't. This equation shows that defines a natural transformation from the T-action f, seen as a functor from the time-monoid to the state-space (category), to the identity T-action, aka the "still" dynamic on X. To make this clear I invite the reader to endure a little of abstract madness. Def 3. Given the monoid T we can build an interesting category (the category of the right traslations of T): begin by adding a bunch of points: one point for evey element . Now the arrows: between the points  we draw an arrow if there is an element such that   . Let's label that arrow with the name of the element t. We can depict the arrows in the two equivalent ways Composition is easily defined What does   have to do with T-dynamical systems? Remember that a T-action f over X is equivalently, by currying, a monoid morphism   that assigns to every time t an endomorphism of X (in the forum we'd like to see this endomap as the t-th iterate of the dynamics). We can see that  , as  T-action, defines automatically a corresponding functor from to the category where X lives. Let's denote it, yep abusing the notation, as . Def 4.  can be seen as a functor sending all the objects of to the same object X and every arrow  to the function  . Functoriality is guaranteed by the definition of dynamical system (T-action). Let's visualize that!!: on the left (in red) live the objects and arrows of (the domain category) and on the right (in black) I display (some of) the objects (just one) living in the target category. Now consider the trivial T-action over X. It is the dynamics of the identity map of X: call it  where for every t we get the identity. As we have seen above, it defines a functor . Quote:The real theorem 1. Given a T-action over X as a functor , the partial derivative in the variable T of the T-action is a natural transformation. Its component at the identity element of the monoid is the iterative logarithm of the dynamical system. In symbols: for s.t. , i.e. for all the arrows  , we have and The proof IS the proof of theorem 1 because that is exactly the condition that natural transformations have to satisfy by definition. We can visualize it as we did for the functor. I know, now this seems scary and disturbing but with natural transformation I mean the same  kind of objects I was defining on the post on generalized superfunction tricks and that's why iterated composition fits so well into this. I will expand on this in another post but let's just observe that the partial derivative satisfies the functional equation TROPHIES FROM HELL? Let's ground this with concrete objects. The problem with considering general T-monoid actions (T-time dynamics) is that our time object T does not know what our initial function is, i.e. monoid actions don't know what process is being iterated. Monoids do not know what is the "quantum of time" because they have zeroes but not units, unlike unitary rings. We need rings to have units and to recover the initial function as . So let's  consider the field of real numbers as our time and let's just restrict to real analysis. The theorem 1 give us a corollary. Corollaries. i) Let n be a natural number ii) For every real number s, The proof is trivial. The last one can be rewritten as In this simplified setting it is easier to appreciate the nature of this equation because we can clearly see that it's a natural transformation between two diagrams that have a familiar shape (that of the real numbers' linear order ). Here the picture shows a bit of the infinite diagram of sets and functions We obtain where this set is defined as These are the same sets defined  for the Generalized superfunction trick in this thread MphLee, Generalized Kneser superfunction trick (the iterated limit definition), (January 21, 2021), Tetration Forum When this intution solidifies we could start to consider topological monoids... continuous paths as diagrams and, after I find the right categorical formulation of paths partition and limit, rebuild algebraically James' composition integral. MathStackExchange account:MphLee Fundamental Law JmsNxn Ultimate Fellow     Posts: 754 Threads: 104 Joined: Dec 2010 05/11/2021, 12:36 AM (This post was last modified: 05/11/2021, 05:37 AM by JmsNxn.) Very interesting stuff, Mphlee! It'll take me awhile to reread and absorb what you've written; but is it possible to do something similar in the non-abelian case? By this I mean, when we write, We are inducing an abelian group. But if we change into, Then writing this, Forms a non-abelian group across composition. Would we be able to talk about (or something like that), but with a non abelian ? I think you should get something similar because, And the term, Which is just the fundamental property of the compositional integral. EDIT: This is also very similar to what I was trying to say with closed contours, Mphlee. When you take an integral about a singularity; it looks abelian (upto conjugation). And you can decompose it in such a manner that everything looks abelian...upto conjugation. Which is how I described my property: Where are Jordan curves (just think they're a closed contour), and is just an arc. So create an equivalence class, If they are conjugate similar. It turns out, each conjugate class depends ONLY ON WHAT SINGULARITIES ARE WITHIN THE CONTOUR. And then we mod out by this equivalence class; we get an abelian group and we're back to a discussion of (at least in spirit, I tried to draw this out as best I could). And even better; we can decompose, For the list of singularities within the contour . Which means, for SOME sequence of closed contours which only encircle ; Where, . But! we can also rearrange this, because once you mod out, it's effectively abelian. If I reindex the singularities ; there exists another sequence of closed contours which only encircle in which: To such an extent, I can apply and I get: This was essentially the thesis of that paper; because once you do that you can do a lot of stuff you do in traditional analysis, but with compositions and compositional integrals. Basically; everything you get from Cauchy's residue theorem; you get a slightly more difficult to handle equivalent. If I'm understanding you correctly; from what you've written here; this is directly the second chapter of The Compositional Integral: The Narrow and The Complex Looking Glass and the fifth section An additive to composition homomorphism. Except, you have entirely rephrased what was just a couple pages into a very different flavour using your fancy arrows, lol. The rest of the book essentially just tries to make this homomorphism exist in more extravagant scenarios by "modding out." But this looks really pretty, how you're writing it. And it definitely breaks it down into its atoms much more. If anything it's a sigh of relief that someone else is beginning to see what I see, lol! The difficulty I've always had though; is that it's not very obvious how, let's say, tetration is related to it's i-logarithm. Or how they behave. I have existence; but I don't really know any algorithm to relate the two in a nice readable manner. Or, any way, say, where we can hunt for a logarithm and then just plug and play to get tetration. I know there is SOME function such that, But, there's no obvious way to find that (and trust me, I've tried). The best I could do is attempt to related these things to contour integrals. But I couldn't figure out any kind of decision process, where we construct a specific associated to what you're calling . I was only able to sort of classify what these constructions WOULD look like; and their behaviour in complicated scenarios. But nothing like a decision process. Anyway; you've given me much to think about Mphlee. I'll try and digest your graphs better; but I think I'm getting what you're saying much more clearly; especially as I reread. MphLee Long Time Fellow    Posts: 270 Threads: 23 Joined: May 2013 05/11/2021, 12:37 PM (This post was last modified: 05/11/2021, 08:47 PM by MphLee.) omg... I don't feel ready for the integrals yet but... something is moving in the back of my head. I need to reread all of your posts at least 10 times more. The bigger obstacle is that I'll need to study what contours, Jordan Curves and singularities really are... I need to study many key parts of your papers. But I'll get there. Now I'd like to answer to all the points. Tonight or tomorrow I'll do it. Now I have time only to say this: the setting is already as general as can be in this sense: I never assumed somewhere that the monoid T is a group, let alone being commutative. All of this holds for abstract monoids T as long as we have a theory that makes us able to define the partial derivative operator (differentiating functions taking values in the monoid): I used additive notation only as a philosophical aid. I'll get back on this. In the proofs the only facts I use of T are  the existence of the identity (that's how we can get the infinitesimal generator factorization) and associativity (that's how we derive theorem 1).(*) The eventuality that the time is not commutative deserves a longer comment. In fact I have something on this. There is (trivial) canonical way to extend every N-action (integer iteration) to an E-action where E is a new monoid. E is the monoid of what I like to call "the functions with rank=1 relative to the initial function". The interesting part btw is that If I'll be able to finally understand how the integrals work I could come up with a monoid of paths (arcs? A category of paths? The fundamental groupoid of the time-object?) over a top-space and maybe we could rebuild all of this theory of the composition integral in term of homotopy theory... big maybe... (*)of course if for classical partial derivative to exists T needs to be assumed commutative that's another story. Edit. I went on wiki looking for some basic path-contour-residue theorem business. I won't annoy you with "first -course-on-complex-analysis" questions. But it is interesting how it seems that we can define a category of paths, where objects are points of the plane and arrows are oriented paths (curves): it looks promising because monotonicity of the parametrization boils down to functoriality (imho) and considering equivalence classes modulo parametrization boils down to modding out by homotopy (I guess). It is unbelievable to me how the value of the integral on a closed curve does not depends on the parametrization chosen, how it only depends on the set of singularities that it encloses, and that it doesn't changes when you permute them... I'm not gonna lie..to me this is black magic. Edit 2. That's amazing... it is beginning to make some sense.  When the domain is simply connected the functions that loops around a point contract themselves to identity (just like paths homotopic to the point) but if the domain is punctured (by the singularity) they can't contract just as the circle (a punctured disk) is not topological equivalent to the disk (that is really a point) because it has an hole! It's so marvelous... the residue classes (in your theory) are class of conjugate functions. There are many doubts but the bigger now is: how you define ? Edit 3. I went back to your old post in the bullet notation thread. That method really comes from Euler method as you say... It is curious that there is no known link between the infinitesimal generator f and the solutions to y'=f(y).  In your anulus example you path \rho realizing that conjugation of the two paths gamma is the interval [-\delta,\delta]. What happens if you measure the superfunctions of two elements of the residue class by some invariants attached to the paths (like the length)? Maybe finding the shortest path/curve? MathStackExchange account:MphLee Fundamental Law JmsNxn Ultimate Fellow     Posts: 754 Threads: 104 Joined: Dec 2010 05/11/2021, 08:53 PM (05/11/2021, 12:37 PM)MphLee Wrote: omg... I don't feel ready for the integrals yet but... something is moving in the back of my head. I need to reread all of your posts at least 10 times more. The bigger obstacle is that I'll need to study what contours, Jordan Curves and singularities really are... I need to study many key parts of your papers. But I'll get there. ........ Edit 2. That's amazing... it is beginning to make some sense.  When the domain is simply connected the functions the loops around a point  contracts themselves to identity (just like paths homotopic to the point) but if the domain is punctured (by the singularity) they can't contract just as the circle (a punctured disk) is not topological equivalent to the disk (that is really a point) because it has an hole! It's so marvelous... the residue classes (in your theory) are class of conjugate functions. There are many doubts but the bigger now is: how you define ? Edit 3. I went back to your old post in the bullet notation thread. That method really comes from Euler method as you say... It is curious that there is no known link between the infinitesimal generator f and the solutions to y'=f(y).  In your anulus example you path \rho realizing that conjugate the two paths gamma is the interval [-\delta,\delta]. What happens if you measure the superfunctions of two elements of the residue class by some invariants attached to the paths (like the length)? Maybe finding the shortest path/curve? The class is very readily just defined as: (this is taken word for word from the paper) The residual class of a meromorphic function at a pole is defined to be: Where:     is a Jordan curve oriented positively.     is the only pole enclosed within . When describing the conjugate property; it's difficult to explain it over the forum; as I spend about 20 pages building up a theory, lol. But it works differently than Cauchy because everything is non-abelian.  The first thing is that the residual IS NOT independent of parameterization about a singularity. But it ALMOST is. The function: Depends on the initial and final point of . So the value -- depends on , and the singularities within. We can of course reparameterize with a ; this is no problem; but the integral will change depending on where our starting and endpoints are. So say I have two contours where is the start/end point of (and they both encircle the same poles). Then take an arbitrary arc (which doesn't encircle any poles) such that and . Then this is our conjugate function. And luckily; if you take another arc which satisfies the same initial point/end point (and doesn't encircle any poles): So the conjugate function IS UNIQUE; if it's written as a compositional integral about . Another way to think of the Residual class is; about a singularity; a family of functions, And each compositional integral about an arc ; if it doesn't encircle any poles; only depends on the initial point and it's endpoint . We can surely think of this as an arrow . Then, This is another way of thinking about it. Or if you prefer, And we can choose whatever path we want from to (as long as it doesn't encircle any poles). Just as a brief FYI; there is a lot of things from Cauchy's analysis we inherit with the compositional integral; but we don't inherit everything. And a lot of the times, when we inherit something, we lose a couple properties because everything is non-abelian. Just be sure to remember that as you read about contour integration; there are somethings we begin to lose. But the power player we get is The Compositional Integral Theorem; which is equivalent to Cauchy's integral theorem. Which is, if is holomorphic, and is simply connected. Then for all jordan curves , Everything in my book is essentially built around this theorem. MphLee Long Time Fellow    Posts: 270 Threads: 23 Joined: May 2013 05/11/2021, 09:48 PM OK, I'll take time to digest this. But to be clear, I don't still understand then how can you use the omega notation on that set you define. If the first is a set of complex numbers, the c-integrals evaluated at z. And the second set you define, the one depending only on the function and the singularity chosen is a set of functions... Quote: how can you put that object inside the omega notation? As z varies we get a bunch of sets of functions how do you compose them in the z? That is: let Do we have and ? Maybe it's just an abuse of notation? When I see that Omega notation I picture it as MathStackExchange account:MphLee Fundamental Law JmsNxn Ultimate Fellow     Posts: 754 Threads: 104 Joined: Dec 2010 05/11/2021, 10:05 PM (05/11/2021, 09:48 PM)MphLee Wrote: OK, I'll take time to digest this. But to be clear, I don't still understand then how can you use the omega notation on that set you define. .... Maybe it's just an abuse of notation? When I see that Omega notation I picture it as YES! That's absolutely it Mphlee! Everything you are saying is correct. That's exactly how you should visualize it. It is not an abuse of notation, for the simple reason we are MODDING OUT by the equivalence relation, The fact that this modding out works so well, is because of the following. There is some representatives of respectively, such that, BUT, there are also some representatives of respectively, such that, So when I write, I mean, there is SOME representative of each Rsd, where this is true. Think about modular arithmetic. means there is SOME k such that, It doesn't mean for all k. So when I write ; I'm assuming we're in the modded out space. And when we pull back, there is SOME representative from this set where it is true. You can see this even in your fancy picture. Just reorganize the curves to put different singularities first. MphLee Long Time Fellow    Posts: 270 Threads: 23 Joined: May 2013 05/11/2021, 10:12 PM Oh... that's makes so much sense 0.0 Good, thank you for the explanations! Ok, when I have more time I'll go back on the non-abelian time monoid and I'll link it up to the non-commutativity of path composition. MathStackExchange account:MphLee Fundamental Law JmsNxn Ultimate Fellow     Posts: 754 Threads: 104 Joined: Dec 2010 05/12/2021, 04:55 AM (This post was last modified: 05/12/2021, 05:04 AM by JmsNxn.) God, I love your explanations! I just reread everything you've written; and it's so god damned on the nose. So much of what I take for granted is developed deeper. Thanks again for this observation, Mphlee. If anything, it just rewrites everything I was saying; but in this beautiful categorical language I never could've come up with. People have always asked me about the relationship of the compositional integral to Feynman Diagrams; and this honestly, reminds me so much of Feynman Diagrams.  And I hate Feynman Diagrams (mostly because it doesn't click). How you're explaining everything clicks so much more. Again, I don't talk about this here, but you can enter in solutions to Schrodinger's equation in these compositional integrals... The way you're writing these diagrams; it just screams at me a formalism of feynman diagrams without the blowups to infinity. But maybe I'm getting ahead of myself, lol 0.0 Thank you times a thousand Mphlee. I'm understanding this even better by reading your interpretation. I think this is a very important translation that needs to be done; the compositional integral into functor/diagram language. I can't do it. But I think you can. Regards, James EDIT: Just wait until you get to the last chapter of my book when I talk about fourier transforms over equivalence classes; lmfao. Attached Files Image(s)  tommy1729 Ultimate Fellow     Posts: 1,620 Threads: 364 Joined: Feb 2009 05/12/2021, 12:16 PM (05/11/2021, 10:05 PM)JmsNxn Wrote: (05/11/2021, 09:48 PM)MphLee Wrote: OK, I'll take time to digest this. But to be clear, I don't still understand then how can you use the omega notation on that set you define. .... Maybe it's just an abuse of notation? When I see that Omega notation I picture it as YES! That's absolutely it Mphlee! Everything you are saying is correct. That's exactly how you should visualize it. It is not an abuse of notation, for the simple reason we are MODDING OUT by the equivalence relation, The fact that this modding out works so well, is because of the following. There is some representatives of respectively, such that, BUT, there are also some representatives of respectively, such that, So when I write, I mean, there is SOME representative of each Rsd, where this is true. Think about modular arithmetic. means there is SOME k such that, It doesn't mean for all k. So when I write ; I'm assuming we're in the modded out space. And when we pull back, there is SOME representative from this set where it is true. You can see this even in your fancy picture. Just reorganize the curves to put different singularities first. Tbh Im familar with contour integration , but I did not get much out of that. Say I take the contour for counting the amount of zero's of (Riemannzeta(s))^z - z^2. How does that get 4 compositions ? Im also confused by compositions of integrals. I mean compositions are used for functions. integrals are operators and result in values. I do not know how to interpret composition of integrals or values , apart from maybe fractional calculus. So Im guessing these integrals have a parameter hence being a function. Maybe some examples might help. Im not even sure why we are doing contour integrals in the first place ? WHY does that matter to iteration theory ? The Jabotinsky ilog is defined as a derivative and hence yeah we can recover by integration. But what is the point then ?? Maybe im confused by notations. Maybe I need to read and think more. But It does not resonate well at the moment. regards tommy1729 JmsNxn Ultimate Fellow     Posts: 754 Threads: 104 Joined: Dec 2010 05/12/2021, 11:10 PM (This post was last modified: 05/12/2021, 11:40 PM by JmsNxn.) Hey, Tommy I apologize if this is out of nowhere. This notation was developed in a paper of mine. Suppose is a domain. Suppose that is a holomorphic function. Suppose that is an arc. Then the contour integration (wrt the compositional integral) is written, The direct way to calculate this is to write the following. Let ; then first we parameterize, Take a descending partition with sample points . Let, and . Let . Then the integral can be written, Where in more familiar notation, if I write ; this just means, This is what I call the Riemann-Stieljtes decomposition; as it looks precisely like the Riemann-Stieljtes integral. This thing has it's place in traditional analysis, where it is better known as Euler's method (though he never used contours as I am). If I write, Then, And it respects substitution. Where if and ; This is essentially alternative notation for first order differential equations. So now we're going to do contour integration, but with first order differential equations, rather than a primitive. What we've been talking about here is about closed contours. if is holomorphic, and is simply connected. Then for all jordan curves , Which is the equivalent of Cauchy's integral theorem. I'll attach here a table of integrations for some simple cases. Let be holomorphic. And for example, if we take the unit disk as our contour and we let ; we get, I wrote an 80 page treatise analyzing these objects. Mphlee and I are discussing a manner of classifying conjugate classes of holomorphic functions. Which, naively, one would write, In this paper I created a class of these functions by using contour integration. Also, it's important to note that this is a STRICT generalization of Cauchy's contour integration. If I take which is constant in we get, And now the algebra reduces to the abelian algebra of contour integration as you're used to it. Essentially, you can think of this as non-abelian contour integration . « Next Oldest | Next Newest »

 Possibly Related Threads… Thread Author Replies Views Last Post [Video] From modular forms to elliptic curves - The Langlands Program MphLee 1 70 06/19/2022, 08:40 PM Last Post: JmsNxn Doubts on the domains of Nixon's method. MphLee 1 1,448 03/02/2021, 10:43 PM Last Post: JmsNxn Nixon-Banach-Lambert-Raes tetration is analytic , simple and “ closed form “ !! tommy1729 11 5,538 02/04/2021, 03:47 AM Last Post: JmsNxn Jabotinsky's iterative logarithm bo198214 21 37,497 06/14/2008, 12:44 AM Last Post: andydude Categorical iteration theory andydude 4 10,084 10/20/2007, 07:27 PM Last Post: andydude

Users browsing this thread: 1 Guest(s) 