## On Clarifying Some Thoughts Regarding Functions in the Unit Interval

Here's my attempt to clarify notions a bit. I have yet to include a lot more examples.

We focus our attention on the restricted space and polynomial functions of finite type (finite degree)

or infinite type

such that the area under the curve is bounded:

More specifically, we look at a subset of these functions that are well-behaved in the sense that they possess no discontinuities and are infinitely differentiable, thus the change in notation from to (double-u to omega).

By the Fundamental Theorem of Calculus, integration usually depends on two boundary points so that

In the particular case of integration in the unit interval and , it solely depends on one, the upper bound, since the lower bound is 0:

Also, powers of 1 are equal to 1, so in effect is a simple sum of polynomial coefficients. We want to tease out from this valuable area information, as follows:

**Definition**

(June 26, 2017)

Define the finite differentiator by

and the infinite differentiator by

Notice the following:

**Claim**

(June 26, 2017)

**Proof**

We may now rewrite

where is a vector of constants that describes how the area accumulates:

Since were defined to have bounded areas, it is clear that the sum must converge in the (countably) infinite case.

The equation is incredibly insightful because it provides us with a bijective map between convergent sums (finite, infinite) and polynomials . Furthermore, it tells us that there exists a class of infinite polynomial functions, namely , that have stable, bounded area in the unit interval, despite their infinite polynomial representation. In contrast, it also tells us that there exists a class of infinite polynomial functions with unstable, unbounded areas in the unit interval (such as would have divergent ).

Our main objective is to understand how probability distributions transform in the unit interval, so it seems natural to limit the realm of possibilities to those for which . Let us call this set . Unfortunately not all elements of the set are probability distributions in the unit interval, since this definition still includes functions that cross the x-axis and are negative for portions of the domain. What does seem clear is that the set of probability distributions is a subset: .

Although eventually we would like to analyze the complete geometry of that are probability distributions, we may want focus on a \emph{core} subset that allows us to understand essential transformation properties, as per our main objective. In order to construct it, observe that each entry of will be non-negative while lies in the interval . Thus, if we require that each entry in vector be non-negative, the dot product will also be non-negative in the unit interval.

Therefore, we have that with for all are probability distributions in the unit interval and define the core subset: .

Observe that vector itself can be interpreted as a discrete probability distribution. Thus from the core subset emerges a bijective correspondence between discrete probability distributions and continuous, bounded ones in the interval .

There are essentially two ways of constructing vectors that will produce in the core subset.

**Construction**

(June 26, 2017)

Pick any finite or countably infinite vector , such that its entries . Then define and lies in the core subset, provided and converges.

**Proof**

Since all , it follows that , and thus . This is one of the conditions that define the core subset. Another is that the sum must equal to one. This is easily checked:

We may call the previous construction a \emph{normalization} procedure of vectors with positive entries.

**Construction**

(June 26, 2017)

Suppose we want to construct with a finite number of entries . Pick so that for are in . Let the last element , because it is constrained. If , repeat the procedure and stop when this is positive.

Notice that we may permute the position of the constrained element as we wish. To construct , let the constrained element be in the first position or any indexable position; obviously the sum in the constraint is now an infinite convergent sum on elements that are not the constrained element.

This last construction is the one we choose to focus on, because it gives us a visual way of understanding of the core subset.

**Example**

(June 27, 2017)

Suppose we have . The last element is the constrained element, which we will denote by an overline to avoid confusion. We can construct the one-dimensional vector space parametrized as that describes the entirety of possibilities. The core subset are those elements for which . Polynomials in the unit interval up to linear terms are included.

**Example**

(June 27, 2017)

A more interesting example arises when we consider . If we forget about the constraint because it is fixed, this means we are in a two-dimensional vector space, parametrized by and : . Because polynomials up to parabolic terms are included, we will name this space the \emph{parabolic} set.

To see the geometry of the core subset, we look at the extreme values: suppose is zero, and will be maximally 1. Oppositely, is zero and is maximally 1. Finally, if the constrained entry is set to zero, then . The core subset is represented by an isosceles triangle and its interior.

**Definition**

(June 28, 2017)

Within this context, let us draw up a few definitions.

- A
*discrete transform*is a function }, , such that a matrix with discrete entries acts on . - A
*continuous transform*is a continuous path in the space , described by parametrizing entries of .- An
*open path*is one that connects two endpoints (a beginning and and end), such that the end is in the closure of the path (but not necessarily in the path). - A
*closed path*is one without a beginning or an end and is not a single point. In two-dimensional space it encloses an area.

- An
- A
*core transform*is a discrete transform that has the property of closure and therefore takes a vector in the core subset to another in the core subset. In the continuous case, the path lies within the core subset.

**Example** [Discrete Transform]

(July 5, 2017)

Define the discrete transform in the \emph{parabolic} set:

Observe that

takes

or, in other words,

Although in this particular case the transform took an element in the core subset into another in the core subset, the transform is not closed in the core subset (although it is in due to the constraint that the area equal to 1):

here the transform takes an element in the designated isosceles triangle to one outside it.

Because all of are positive, rendering it in effect a discrete probability distribution, there is an obvious mechanism that asserts the closure of the transform (in ), taking elements in the core subset to elements in the core subset.

**Example** [Discrete Regular Markov Matrix Core Transform]

(July 5, 2017)

Define the discrete regular Markov matrix

such that (the regularity property implies all entries of all powers of are nonnegative). For vectors in the \emph{core parabolic} set, the transforms

are closed in the \emph{core parabolic} set for and including the transform defined by

which is in the closure of the set of powers of . A known property of is that its rows are identical (and sum to 1):

It follows that any vector in the core subset is taken to , which itself lies in the core subset:

From this, we can conclude that we can design the core transform that takes \emph{any} element in the core subset to a specific another simply by repeating the vector to which it has to jump to in the transform matrix.

Because the difference in all entries of approaches zero

the collection of vectors draws a jumping point (often oscillating) path starting at the beginning vector and ending at . In our considerations, we may choose to include the endpoint or not, depending on whether we choose to include the matrix or not. This arises from the notion that is in the closure of the collection . Naturally and by extension, is in the closure of the collection .

Take

and so that

**Example** [Open Path Core Transform]

(July 7, 2017)

Again, in the core parabolic subset, an open path going from to can be constructed using the parameter :

with or .

**Example** [Circular Path Core Transform]

(July 7, 2017)

The largest circular path, in the core parabolic subset, is:

for or .