Poll: How to call elements of [f,g]
You do not have permission to vote in this poll.
Superfunctions
0%
0 0%
Conjugations
33.33%
1 33.33%
Equivariant maps
33.33%
1 33.33%
Change of base (?)
0%
0 0%
None of the above
33.33%
1 33.33%
Total 3 vote(s) 100%
* You voted for this item. [Show Results]

New terminological standard for superfunctions.
#3
Thank you for the time James. I apologize for some grammar errors.

(05/14/2021, 03:36 PM)JmsNxn Wrote: Personally, I'm a fan of conjugate classes; but you're right; technically that's incorrect. I would usually always consider invertible (at least, locally) maps. So, in that frame work it's correct.

I'm sorry but here you lose me. In which local framework  elements of [f,g] can be thought as part of a conjugacy class in the literal meaning of the term?

I call two elements f,g related by conjugation (conjugated) if exists, at least, a third object x s.t. xf=gx. In the case of \( {\rm Rsd}(f,\zeta) \) we have that each pair is conjugated by a path, or more then one, (by your compositional-Cauchy thm (CCT)). Now, if there exists more objects x,y,z that conjugate f and g, i.e.

xf=gx,  yf=gy  adn zf=gz

we can say that x,y,z are three different ways in which f and g are in relation (conjugated). We can see x,y,z as modes of being conjugated of f and g.  Using the geometric intuition of curves and your CCT we can see x,y,z as oriented paths joining f to g.

If we want to retain the conceptual connection with conjugacy, which is fine to me, I find appropriate to call [f,g] the set of modes of f to being conjugated to g.
Some alternatives:
  • [f,g] is the set of oriented paths from f to g
  • [f,g] is the set of transformations of f into g
  • [f,g] is the set of f-iterations of g or of f-superfunctions of g
  • [f,g] is the set of g-logarithms of f or of g-abel functions of f
Sadly, the relation of being conjugated, i.e. conjugation, is an equivalence relation only if we are in a group. Only in that case it defines a partition into equivalence classes of the ambient. 

Are the sets [f,g] equivalence classes of some equivalence relation?
Nope, because they are never disjoint as far as gorups, monoids and semigroups are concerned. If we collect all the [f,g] they do not form a partition of the total set of functions (to prove this just consider [id,id] everything commutes with the identity).
It is an open problem if elements of [f,g] are conjugated and how to classify them. Let x,y such that xf=gx and yf=gy... When is there an object s such that sx=ys?


Quote: I do like equivariant, but that seems a tad restrictive when we're just considering one variable.

What do you mean?

Quote:Change of base honestly sounds like the best one, if you could only make this a better term than just change of base. It also fits more at home with this forum, where it is an equivalent to what we typically call change of base.

I'm not sure. Change of coordinates system?
I was thinking of change of time: because an element x conjugating f to g  changes the frame of reference in some sense... (that's the case of linear algebra) but since we are talking about two iterations maybe we could force the analogy by claiming that x is translating the time of f to the time of g.
This can be confusing if we think of changing time as changing our monoid of time, e.g. when we extend from N to Z, or from integer iteration (Z) to complex iteration ©.
But I've a proof (that has to do with rank=1 functions) that the change of time monoid is related to some extent to the idea that \( \chi \in [f,g] \) is really changing the time from f to the time g.

Quote:I wonder if there is a term for conjugate classes in monoids? Or at least an equivalent for monoids?

Yes. As I was saying, the relation of conjugacy, as I defined it, is an equivalence only for groups. In monoids and semigroups the possible definitions of conjugacy become dependent on orientation and on other technical difficulties. In other words the concept fragments in a couple of variants. In "the literature", as far as I know and remember that I'm just a nobody that didn't get past the first semester of university, they still call them conjugacy classes. Usually, all the different possible definitions are equivalent when we restrict ourselves to groups.

The two most striking ones, that hold universally in semigroups and monoids (i.e semigroups with identity element), are the relations of isomorphism and of connectedness. These two relations define classes that are called isomorphism classes and, respectively, connected components. (note: this is not fringe math but very well know. See Tom Leinster on MO.)

As a side note: I'd love to hear opinions of historical heavyweights of the forum like Trappmann, Robbins, Sheldonison, Tommy, Gottfried and Mick

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: New terminological standard for superfunctions. - by MphLee - 05/14/2021, 06:42 PM

Possibly Related Threads…
Thread Author Replies Views Last Post
  fractals and superfunctions for f(x,y) ? tommy1729 4 5,934 09/16/2022, 12:24 PM
Last Post: tommy1729
  [question] Local to global and superfunctions MphLee 8 10,916 07/17/2022, 06:46 AM
Last Post: JmsNxn
  elementary superfunctions bo198214 39 105,396 06/15/2022, 11:48 PM
Last Post: tommy1729
  Superfunctions in continu sum equations tommy1729 0 6,583 01/03/2013, 12:02 AM
Last Post: tommy1729
  superfunctions of eta converge towards each other sheldonison 13 45,072 12/05/2012, 12:22 AM
Last Post: sheldonison
  how many superfunctions? [was superfunctions of eta converge towards each other] tommy1729 8 30,307 05/31/2011, 07:38 PM
Last Post: sheldonison
  Non-Standard Analysis Approach JungleJesus 5 17,769 01/07/2011, 09:26 PM
Last Post: bo198214
  Elliptic Superfunctions BenStandeven 2 11,151 08/20/2010, 11:56 AM
Last Post: bo198214



Users browsing this thread: 1 Guest(s)