[To Do] Basics of Iterating Relations
#1
I want to outline some elementary construction that can start a possible systematic theory of iterated (non-functional) relations. Some basic examples of monoids of relations come naturally from the theory of metric spaces and the "apartness up to some \(\epsilon\in \mathbb R\)" relation or by physical measurements
[*]. Other more complex examples may be, I hope, relevant in the iteration of multivalued functions and of iterated (non-integer) solutions of functional equations, i.e. fractional calculus and non-integer ranks.

Definition (relational action) Let \(R:{\bf B} M\to {\rm Rel} \) a functor. It defines a monoid of relations under relations composition.
$$R_1=\Delta_X$$
$$xR_{s+t}y \iff xR_sR_ty\iff \exists w.\,xR_sw\land wR_ty$$

Even if not well behaved as the iteration of functions we can still study and make explicit the network of "wires" that glues points of \(X\) and that is induced simultaneously by all the relations \(R_{r\in M}\).

Definition (Associated pullbacks bundles) Let \(R_s\times_XR_t\) the pulback of \(\pi_1:R_s\to X\) and \(\pi_0:R_t\to X\) then

$$(x,w,y):R_s\times_XR_t\implies xR_sR_ty \iff xR_{s+t}y$$

in particular we have a surjection \(\rho_{s,t}:R_s\times_X R_t\to R_sR_t=R_{s+t}\) defined by central projection and that gives a bundle s.t. its fibers are of the form $${\boldsymbol \rho}_{s,t}(x,y)\cong\{w:X.\,xR_sw\land wR_ty\}$$


Definition (associated graph) We can form a graph over \( X\) it by considering the left and right projections over the pullback. They are induced by the projections \(R_{s+t}\to X\) by precomposing with \(\rho_{s,t}\).


Definition (\(r\)-intermediate points) We define all the possible \(r\in M\)-intermediates of two points as $${\boldsymbol \rho}_r(x,y)=\coprod_{s+t=r} {\boldsymbol \rho}_{s,t}(x,y)\cong\{w:X.\,\exists s,t\in M.\,s+t=r\land xR_sw\land wR_ty\}$$

these sets are the fibers of the following bundle

Definition (Associated total pulback bundle over the time \(r\in M\)) Define it as

$${\boldsymbol \rho}_r:\coprod_{s+t=r}R_s\times_X R_t\to R_r$$

Many graph structures arise over \(X\) one for every \(r\in M\). We can define the total graph of the functor \(R\) at the time \(r\in M\) by precomposing the two left and right projections \(R_r\to X\) by \({\boldsymbol \rho}_r\)
$$\coprod_{s+t=r}R_s\times_X R_t\to  X$$



More basic examples and proof of basic properties are needed. I just leave this as a a todo-thread for me. Any idea/comment is welcome.

[*]Consider \(x\leq_t y :\iff |y-x|\leq t \) then clearly \(x\leq_t w\), i.e. \(|w-x|\leq t\), and \(w\leq_s y\), i.e. \(|y-w|\leq s\), then \(x\leq_{s+t}y\) because by triangle inequality \(|y-x|\leq|w-x|+|y-w|\leq s+t\). Vice versa if \(|y-x|\leq s+t\) then we take a point \(w\) in the intersections of two balls \(B_s(x)\cap B_t(y)\). It must be non-empty, we thus have opposite implication.

MSE MphLee
Mother Law \((\sigma+1)0=\sigma (\sigma+1)\)
S Law \(\bigcirc_f^{\lambda}\square_f^{\lambda^+}(g)=\square_g^{\lambda}\bigcirc_g^{\lambda^+}(f)\)
Reply


Possibly Related Threads…
Thread Author Replies Views Last Post
  Iterating at eta minor JmsNxn 22 1,719 08/05/2022, 02:01 AM
Last Post: JmsNxn
Question Continuously Iterating Modular Arithmetic Catullus 17 1,544 07/22/2022, 02:16 AM
Last Post: MphLee
  iterating z + theta(z) ? [2022] tommy1729 5 789 07/04/2022, 11:37 PM
Last Post: JmsNxn
  iterating exp(z) + z/(1 + exp(z)) tommy1729 0 2,072 07/17/2020, 12:29 PM
Last Post: tommy1729
  Iteration basics Ivars 27 50,152 01/02/2017, 05:21 PM
Last Post: Xorter
  iterating x + ln(x) starting from 2 tommy1729 2 5,845 04/29/2013, 11:35 PM
Last Post: tommy1729
  iterating non-analytic tommy1729 0 3,616 02/08/2011, 01:25 PM
Last Post: tommy1729
  Iterating at fixed points of b^x bo198214 28 46,665 05/28/2008, 07:37 AM
Last Post: Kouznetsov



Users browsing this thread: 1 Guest(s)