Generalized Kneser superfunction trick (the iterated limit definition)
#17
Ok, but I'm sure more insight into a concrete model always improves the abstract one. Until now I only played with finite models (small finite sets of permutation/functions) or with monoid of functions over N.

I'm not on it seriously yet, I'm busy with some work. But I have few quick questions.
1- With closure you mean: let \( M \) be a monoid and \( B\subseteq M \) be a subset (a simple subset not a submonoid). With \( \overline{B} \) you mean the smaller submonoid of \( M \) that contains \( B \) right? In other words it is the submonoid generated by the set \( B \). In this case \( M={\mathcal C}^1({\mathbb R}) \).

2- Is your second condition \( \lim_{x\to+ \infty}f'(x)\in (1,+\infty] \)? Intuitively can I see this like the graph of f being "convex" in a neighborhood

of +infinity? Except for the +infinite case this seems a kind o "linearity at infinity".

3- the third condition seems to impose that the dynamics of our maps is very simple: it means that "all orbits come from the same source" and the source is external to our domain. Why do we need this? Is this to avoid fixed points and to avoid that superfunction gets a lower bound, thus non surjectivity?


Excuse me, always trivial things. I know.

Addendum 1: I guess the right contruction should be \( {\mathbb B}= \overline{B\cup B^{-1}} \). Given \( \psi\in {\mathbb B} \) then, by definition, \( \psi={\Omega_{i=0}^n}f_i \) for a finite n and \( f_i\in B\cup B^{-1} \). We have by anticommutativity of inversion \( \psi^{-1}={\Omega_{i=0}^n}f_{n-i}^{-1} \). This expression has meaning because by definition each \( f_i \) is invertible and \( f_i^{-1}\in B\cup B^{-1} \). We conclude that \( \psi^{-1}\in {\mathbb B} \) QED


Addendum 2: if \( B \) is a subset of \( {\mathcal C}^1({\mathbb R}) \) then \( B^{-1} \) is a subset of \( {\mathcal C}^1({\mathbb R}) \) iff elements of \( B \) are diffeomorphisms. I think the proof is trivial (but I should write it down). In that case \( {\mathbb B}= \overline{B\cup B^{-1}} \) is a subgroup of the group \( {\rm Diff}({\mathbb R}) \).

ps: Your pdf seems very excititng. I need to read it carefully.

Mother Law \(\sigma^+\circ 0=\sigma \circ \sigma^+ \)

\({\rm Grp}_{\rm pt} ({\rm RK}J,G)\cong \mathbb N{\rm Set}_{\rm pt} (J, \Sigma^G)\)
Reply


Messages In This Thread
RE: Generalized Kneser superfunction trick (the iterated limit definition) - by MphLee - 03/21/2021, 12:22 PM

Possibly Related Threads…
Thread Author Replies Views Last Post
  i have a seemingly reasonable definition for tetration Alex Zuma 2025 0 891 10/19/2025, 04:00 PM
Last Post: Alex Zuma 2025
  Limit when x approaches 0 saudinho 2 7,348 10/12/2023, 09:51 PM
Last Post: saudinho
  Real tetration as a limit of complex tetration Daniel 5 9,519 06/20/2023, 07:52 PM
Last Post: tommy1729
  Simple limit approximation to exp(x) tommy1729 0 2,786 05/16/2023, 11:13 PM
Last Post: tommy1729
  4 hypothesis about iterated functions Shanghai46 11 13,128 04/22/2023, 08:22 PM
Last Post: Shanghai46
  Question about the properties of iterated functions Shanghai46 9 11,449 04/21/2023, 09:07 PM
Last Post: Shanghai46
  Pictures of some generalized analytical continuations Caleb 18 19,143 03/17/2023, 12:56 AM
Last Post: tommy1729
  Artificial Neural Networks vs. Kneser Ember Edison 5 6,841 02/22/2023, 08:52 PM
Last Post: tommy1729
  Semi-group iso , tommy's limit fix method and alternative limit for 2sinh method tommy1729 1 4,619 12/30/2022, 11:27 PM
Last Post: tommy1729
  [MSE] iterated sin using Besselfunction 1st kind Gottfried 7 8,886 12/18/2022, 02:06 PM
Last Post: Gottfried



Users browsing this thread: 1 Guest(s)