1 Introduction

1.1 Discrete Holomorphic Functions

Functions on the ring of Gaussian integers \(\mathbf {Z}[\mathrm {i}]= \mathbf {Z}+ \mathrm {i}\mathbf {Z}\subset \mathbf {C}\) that satisfy a discrete convolution equation corresponding to the Cauchy–Riemann equation have been studied since the 1940s. Rufus Philip Isaacs [6, 7] developed a theory for these functions. He called them monodiffric, meaning that the quotients of differences in two different directions are equal. Those for the direction from 0 to 1 versus the direction from 0 to \(\mathrm {i}\) (illustrated by the arrows ) he called monodiffric of the first kind; those for the direction from 0 to \(1 + \mathrm {i}\) versus the orthogonal direction from 1 to \(\mathrm {i}\) (illustrated by the arrows ) he called monodiffric of the second kind. He expressed the opinion that the latter “seemed less promising than the present course” [7: 258]. I therefore think that it is justifiable to associate the monodiffric functions of the first kind with the name of Isaacs, as I did in my paper [9]. More recent research on this class includes that of Nakamura and Rosenfeld [17].

The monodiffric functions of the second kind were studied by Jacqueline Ferrand (1944) [5], which is the reason why I associated them with her name in my paper (2008) [10]. She called these functions préholomorphes. Later studies on this class include those by Duffin (1956) [4], Lovász (2000) [15], Kenyon (2000) [8] and Benjamini and Lovász (2000) [1].

For these two most studied classes, we shall prove that a Cauchy problem has a unique solution: for those of the first kind with data given on

$$\begin{aligned} \{z \in \mathbf {Z}[\mathrm {i}]; \ \mathrm{Im}\,z = 0\} \cup \{z \in \mathbf {Z}[\mathrm {i}]; \ \mathrm{Re}\,z = 0 \text { and } \mathrm{Im}\,z \hbox {\,\,\char 054\,\,}0\}; \end{aligned}$$

for those of the second kind with data given on the axes:

$$\begin{aligned} \mathbf {Z}\cup \mathrm {i}\mathbf {Z}= \{z \in \mathbf {Z}[\mathrm {i}]; \ \mathrm{Im}\,z = 0\} \cup \{z \in \mathbf {Z}[\mathrm {i}]; \ \mathrm{Re}\,z = 0\}. \end{aligned}$$

For the question discussed here the functions of the second kind are more symmetric than those of the first kind and require less work—you can compare Propositions 7.4 and 8.4.

1.2 Duality of Convolution Operators

Duality is a term which represents a collection of ideas where two sets of mathematical objects confront each other. A most successful duality is that between the space \(\mathscr {D}(\Omega )\) of test functions (smooth functions of compact support) and its dual \(\mathscr {D}'(\Omega )\) of distributions.

Similarly, the theory of analytic functionals, developed by André Martineau in his doctoral thesis [16]—also in (Œuvre de André Martineau [18]: 47–210)—is based on a duality, in many but not all respects analogous to distribution theory.

In complex geometry, lineal concavity and lineal convexity can be treated successfully using concepts of duality (see my publication 2019 [11] and my manuscript [12]).

In this paper we shall not treat these instances of duality but instead take a look at discrete versions of the Cauchy–Riemann operator.

Questions on duality gave rise to the study of Cauchy problems mentioned in Sect. 1.1.

1.3 Mathematical Morphology

A relatively new branch of science, mathematical morphology, can be quite helpful in providing guiding concepts and ideas in the study of discrete convolution operators and related topics, like discrete optimization. In fact, these ideas led to the questions on duality alluded to in Sect. 1.2. For more on mathematical morphology, see Serra [19], Serra, Ed. [20] and my manuscript (ms [13]).

We shall apply ideas from mathematical morphology to the duality of convolution operators, in particular those that define monodiffric functions.

1.3.1 Notation

We use the common symbols \(\mathbf {N}= \{0,1,2,\dots \}\), \(\mathbf {Z}\), \(\mathbf {R}\), \(\mathbf {C}\) for the semiring of natural numbers, the ring of integers, the fields of real and complex numbers, respectively. The Gaussian integers \(\mathbf {Z}[\mathrm {i}] = \mathbf {Z}+ \mathrm {i}\mathbf {Z}\) constitute a subring of \(\mathbf {C}\).

The family of all subsets of a set X is called the power set of X and will denoted by \(\mathscr {P}(X)\). Thus \(A \in \mathscr {P}(X)\) if and only if \(A \subset X\). This set is ordered by the relation that \(A \hbox {\,\,\char 054\,\,}B\) if and only if \(A \subset B\). We denote by \(\mathscr {P}_{\mathrm {finite}}(X)\) the family of all finite subsets of X.

Following Bourbaki ([2]: Chapter II, § 5, No. 1, p. 101) we shall denote the set of all mappings from X into Y by \(\mathscr {F}(X,Y)\). If H is an abelian semigroup with zero 0, we define the support of a function \(f :X \rightarrow H\) as the set where f is nonzero. We denote by \(\mathscr {F}_{\mathrm {finite}}(X,H)\) the subset of \(\mathscr {F}(X,H)\) consisting of all functions which are zero outside a finite subset of X.

We write \(l^p(X)\), \(1\hbox {\,\,\char 054\,\,}p \hbox {\,\,\char 054\,\,}\infty \), for the space of all functions \(f:X \rightarrow \mathbf {C}\) such that \(\sum _{x \in X} |f(x)|^p < +\infty \) (\(1 \hbox {\,\,\char 054\,\,}p < \infty \)) and \(\sup _{x \in X} |f(x)| < +\infty \) (\(p = \infty \)). They are equal if and only if X is finite; then \(l^p(X) = \mathscr {F}(X,H) = \mathscr {F}_{\mathrm {finite}}(X,H)\) for all p.

2 Convolution

Definition 2.1

If G is an abelian semigroup we define the convolution product \(h = f * g\) of two functions fg defined on G and with real or complex values by the formula

$$\begin{aligned} h(z) = \sum _{\begin{array}{c} x,y\, \in \, G\\ x+y\, =\, z \end{array}} f(x)g(y), \qquad z \in G, \end{aligned}$$
(2.1)

provided the sum can be given a meaning. \(\square \)

The semigroup G here will most often be the group \(\mathbf {Z}[\mathrm {i}]\), but we shall also consider other groups.

If one of fg is nonzero only in a finite subset of G, the sum is always well defined, but we need to consider more general situations.

The Kronecker delta \(\delta _a\) is the function which takes the value 1 at a and is zero elsewhere. For \(a = 0\) we get a neutral element: \(f * \delta _0 = f\) for all functions f.

As shown for instance in my texts (ms [12]: Example 5.2) and (ms [13]: Example 13.2.1), we cannot hope for a general convolution algebra, but we can confront a family of functions with another family, which is an instance of duality. The simplest example of this is that \(\mathscr {F}_{\mathrm {finite}}(G,\mathbf {C})\) can work against \(\mathscr {F}(G,\mathbf {C})\) and conversely. But there are several other cases of interest.

Provided that we accept \(+\infty \) as a value, we can define the convolution product \(|f| *|g|\) of the absolute values of any two functions \(f, g \in \mathscr {F}(G,\mathbf {C})\). The sum is simply defined to be the supremum of all finite partial sums:

and takes its value in \([0, +\infty ]\). Therefore it makes sense to require \(|f|*|g|\) to be finite everywhere. If this is so, then also \(f*g\) is well defined as a function with finite values; the sum defining it being absolutely convergent at every point. More precisely, we have the following result concerning commutativity and associativity.

Proposition 2.2

Let G be an abelian group and \(f_j:G \rightarrow \mathbf {C}\), \(j = 1,2,3\), three functions.

  1. 1.

    If \(|f_1|*|f_2|\) is finite everywhere, then \(f_1*f_2\) is defined everywhere as an absolutely converging series, \(f_1*f_2 = f_2*f_1\), and \(|f_1*f_2| \hbox {\,\,\char 054\,\,}|f_1|*|f_2|\).

  2. 2.

    If \((|f_1|*|f_2|)*|f_3|\) is finite everywhere, then \((f_1*f_2)*f_3\) and \(f_1*(f_2*f_3)\) are defined everywhere as absolutely converging series, and they are equal.

The proof of this proposition appears in my manuscripts (ms [12]: Proposition 5.3) and (ms [13]: Proposition 13.2.2) and is not difficult at all.

3 Duality in Convolution

Definition 3.1

Given an abelian semigroup G and any subfamily \(\mathscr {G}\) of \(\mathscr {F}(G,\mathbf {C})\), we define

$$\begin{aligned} \Gamma (\mathscr {G}) = \{f :G \rightarrow \mathbf {C}; \ \text { for all } g \in \mathscr {G}, |f|*|g| < +\infty \}, \end{aligned}$$
(3.1)

thus defining a transformation \( \Gamma :\mathscr {P}(\mathscr {F}(G,\mathbf {C})) \rightarrow \mathscr {P}(\mathscr {F}(G,\mathbf {C}))\). \(\square \)

If G is finite, we have \(\Gamma (\mathscr {G}) = \mathscr {F}(G,\mathbf {C})\).

Definition 3.2

We define a mapping \(\Psi \) by

$$\begin{aligned} \Psi (\mathscr {G}) = \{f \in \Gamma (\mathscr {G}); \text { for all } g \in \mathscr {G}, f * g = 0\}, \qquad \mathscr {G}\subset \mathscr {F}(G,\mathbf {C}), \end{aligned}$$
(3.2)

where the formula defines \(\Psi :\mathscr {P}(\mathscr {F}(G,\mathbf {C})) \rightarrow \mathscr {P}(\mathscr {F}(G,\mathbf {C}))\). \(\square \)

Clearly \(\Gamma \) and \(\Psi \) are decreasing, so that the compositions \(\Gamma \circ \Gamma \), \(\Psi \circ \Gamma \), \(\Gamma \circ \Psi \), \(\Psi \circ \Psi \) are all increasing. Together with the fact that \(\Psi \hbox {\,\,\char 054\,\,}\Gamma \) these facts give rise to order relations

The smallest of these compositions is \(\Psi \circ \Gamma \) as shown, and it maps all families to the singleton set of the zero function and is therefore idempotent. The composition \(\Gamma \circ \Psi \) is in general not idempotent.

It can happen that \(\Psi ^{\circ 2}(\mathscr {G})\) contains \(\Gamma ^{\circ 2}(\mathscr {G})\) strictly (Examples 3.9 and 3.11) as well as it being strictly contained in \(\Gamma ^{\circ 2}(\mathscr {G})\) (Example 3.10).

A mapping \(\eta :X \rightarrow X\), where X is a preordered set, is called an ethmomorphism if it is increasing and idempotent. An ethmomorphism \(\kappa \) is said to be a cleistomorphism if it is larger than the identity. A fixed point x for \(\kappa \), thus an element \(x \in X\) such that \(\kappa (x) = x\), is said to be closed for \(\kappa \).

Given two preordered sets X and Y, a Galois correspondence is a pair (FG) of mappings, \(F :X \rightarrow Y\) and \(G :X \rightarrow Y\), which are both decreasing and such that the two compositions \(G\circ F :X \rightarrow X\) and \(F\circ G :Y \rightarrow Y\) are larger than the identity mappings. Both \(G\circ F\) and \(F\circ G\) are increasing. It follows that they satisfy \(F\circ G\circ F = F\) and \(G \circ F \circ G = G\) and so are cleistomorphisms. See (Kuroš [14]) and (Cohn [3]) for general results on Galois correspondences.

The pairs \((\Gamma , \Gamma )\) and \((\Psi , \Psi )\) are Galois correspondences as we shall now prove.

Proposition 3.3

The mapping \(\Gamma \) is decreasing and satisfies

$$\begin{aligned} \bigcap _{j\in J} \Gamma (\mathscr {G}_j) = \textstyle \Gamma (\bigcup _{j\in J}\mathscr {G}_j) \end{aligned}$$
(3.3)

for all families \((\mathscr {G}_j)_{j \in J}\), from which is follows that \(\mathrm{\mathbf {id}}\hbox {\,\,\char 054\,\,}\Gamma \circ \Gamma \). As a consequence, the pair \((\Gamma , \Gamma )\) is a Galois correspondence.

Similarly for \(\varPsi \).

Proof

As already noted, \(\Gamma \) is decreasing, and like all decreasing mappings it satisfies \(\textstyle \bigcap _j\Gamma (\mathscr {G}_j) \supset \textstyle \Gamma (\bigcup _j\mathscr {G}_j)\). The inclusion in the other direction follows from the definition—in fact both inclusions are easily seen to hold from the definition.

If \(|g|*|h| < +\infty \), then \(g \in \Gamma (\{h\})\). If \(|g|*|h| < +\infty \) for all \(h \in \mathscr {H}\), then \(\textstyle g \in \bigcap _{h \in \mathscr {H}} \Gamma (\{h\}) = \textstyle \Gamma (\bigcup _{h \in \mathscr {H}}\{h\}) = \Gamma (\mathscr {H})\). If \(|g|*|h| < +\infty \) for all \(g \in \mathscr {G}\) and all \(h\in \mathscr {H}\), then \(\mathscr {G}\subset \Gamma (\mathscr {H})\). Finally, taking \(\mathscr {H}= \Gamma (\mathscr {G})\), we get \(\mathscr {G}\subset \Gamma (\Gamma (\mathscr {G}))\), proving \(\mathrm{\mathbf {id}}\hbox {\,\,\char 054\,\,}\Gamma \circ \Gamma \). \(\square \)

We shall investigate whether some classes of functions are closed for the corresponding cleistomorphisms, in particular for \(\Gamma \circ \Gamma \) and \(\Psi \circ \Psi \).

3.1 Adding Functions of Finite Support

Proposition 3.4

The image \(\Gamma (\mathscr {G})\) of an arbitrary family \(\mathscr {G}\) of functions is a vector subspace of \(\mathscr {F}(G,\mathbf {C})\) which contains \(\mathscr {F}_{\mathrm {finite}}(G,\mathbf {C})\). We shall use the notation

$$\begin{aligned} \mathscr {G}^{[+]}= \mathscr {G}+ \mathscr {F}_{\mathrm {finite}}(G,\mathbf {C}) = \{g + \rho ; \ g\in \mathscr {G}\text { and } \rho \in \mathscr {F}_{\mathrm {finite}}(G,\mathbf {C})\}. \end{aligned}$$
(3.4)

Thus \(\Gamma (\mathscr {G}^{[+]}) = \Gamma (\mathscr {G})\), which implies that \(\mathscr {G}\subset \mathscr {G}^{[+]}\subset \Gamma ^{\circ 2}(\mathscr {G})\) and that

$$\begin{aligned} \Gamma (\mathscr {G}) = \Gamma \big (\mathscr {G}^{[+]}\big ) = \Gamma (\Gamma ^{\circ 2}(\mathscr {G})) = \Gamma ^{\circ 3}(\mathscr {G}). \end{aligned}$$

Proof

This is easy so see. \(\square \)

We note the following easy consequence.

Corollary 3.5

The operation \(\Gamma \) can be defined on the quotient space \(\mathscr {F}(G,\mathbf {C})/\mathscr {F}_{\mathrm {finite}}(G,\mathbf {C})\). \(\square \)

This quotient space is analogous to the space of singularities \(\mathscr {D}'(\Omega )/\mathscr {E}(\Omega )\), the space of distributions modulo the subspace of smooth functions. Also the more elementary singularity space \(C^0(\Omega )/C^\infty (\Omega )\) is interesting—these spaces deserve being studied, I believe.

3.2 Forming Convolutions with Functions of Finite Support

Proposition 3.6

If \(\mathscr {G}\) is a subset of \(\mathscr {F}_{\mathrm {finite}}(\mathbf {C},\mathbf {C})\), the second dual \(\Gamma (\Gamma (\mathscr {G})) = \Gamma ^{\circ 2}(\mathscr {G})\) always contains the set of all convolution products \(g * \rho \), \(g \in \mathscr {G}\), where \(\rho \) is an arbitrary element of \(\mathscr {F}_{\mathrm {finite}}(G,\mathbf {C})\):

$$\begin{aligned} \Gamma ^{\circ 2}(\mathscr {G}) \supset \{g * \rho ; \ g \in \mathscr {G}\text { and } \rho \in \mathscr {F}_{\mathrm {finite}}(G,\mathbf {C})\} = \mathscr {G}^{[*]}, \end{aligned}$$
(3.5)

where the last equality defines the family \(\mathscr {G}^{[*]}\supset \mathscr {G}\).

Proof

If \(h = g * \rho \) with \(g \in \mathscr {G}\) and \(\rho \) has finite support, then as in all convolution products with three factors where only one of the three does not have finite support, we have commutativity and associativity and can calculate freely to obtain \(|h| * |g| = |g| * |\rho | *|f| < +\infty \) for all \(f \in \Gamma (\mathscr {G})\), proving that h belongs to the second dual of \(\{g\}\) for every \(g \in \mathscr {G}\), hence to the second dual of \(\mathscr {G}\).

Proposition 3.7

If \(\mathscr {G}\) is a subset of \(\mathscr {F}_{\mathrm {finite}}(\mathbf {C},\mathbf {C})\), the second dual \(\Psi (\Psi (\mathscr {G})) = \Psi ^{\circ 2}(\mathscr {G})\) always contains the set \(\mathscr {G}^{[*]}\):

$$\begin{aligned} \Psi (\Psi (\mathscr {G})) = \Psi ^{\circ 2}(\mathscr {G}) \supset \mathscr {G}^{[*]}. \end{aligned}$$
(3.6)

Proof

If \(h = g * \rho \) with \(g \in \mathscr {G}\) and \(\rho \) has finite support, then as in the previous proof we have commutativity and associativity and can calculate freely to obtain \(h * g = (g * \rho ) * f = (f * g) * \rho = 0 * \rho = 0\) for all \(f \in \Psi (\mathscr {G})\), proving that h belongs to the second dual of \(\mathscr {G}\) under \(\Psi \). \(\square \)

As we shall see in Examples 3.83.11, sometimes we have equality in (3.5) or (3.6), sometimes not. An example of strict inclusion is Theorem 4.1.

Example 3.8

Let us define \(\mathscr {G}_0 = \mathscr {F}_{\mathrm {finite}}(G,\mathbf {C})\) and \(\mathscr {G}_1 = \mathscr {F}(G,\mathbf {C})\). Then \(\Gamma (\mathscr {G}_0) = \mathscr {G}_1\) and \(\Gamma (\mathscr {G}_1) = \mathscr {G}_0 \); it follows that \((\Gamma ^{\circ 2})(\mathscr {G}_j) = \mathscr {G}_j\), \(j = 0,1\). So both \(\mathscr {G}_0\) and \(\mathscr {G}_1\) are closed for \(\Gamma ^{\circ 2}\).

We have \(\Psi (\mathscr {G}_0) = \Psi (\mathscr {G}_1) = \{0\}\) and

$$\begin{aligned} (\Psi \circ \Psi )(\mathscr {G}_0) = (\Psi \circ \Psi )(\mathscr {G}_1) = \mathscr {G}_1 = \Gamma ^{\circ 2}(\mathscr {G}_1) \supset \Gamma ^{\circ 2}(\mathscr {G}_0) = \mathscr {G}_0 \end{aligned}$$

with strict inclusion if and only if G is infinite. \(\square \)

Example 3.9

Take now \(G = \mathbf {Z}^n\) and \(\mathscr {G}= \{\delta _0\}\), a singleton set. Then \(\Gamma (\mathscr {G}) = \mathscr {F}(\mathbf {Z}^n,\mathbf {C})\), the space of all functions. It follows that \(\Gamma ^{\circ 2}(\mathscr {G}) = \mathscr {F}_{\mathrm {finite}}(\mathbf {Z}^n,\mathbf {C})\). The higher powers are \(\Gamma ^{\circ k}(\mathscr {G}) = \mathscr {F}(\mathbf {Z}^n,\mathbf {C})\) for odd \(k \hbox {\,\,\char 062\,\,}1\) and \(\Gamma ^{\circ k}(\mathscr {G}) = \mathscr {F}_{\mathrm {finite}}(\mathbf {Z}^n,\mathbf {C})\) for even \(k \hbox {\,\,\char 062\,\,}2\).

We see that \(\Psi (\mathscr {G}) = \{0\}\); the second dual is \(\Psi ^{\circ 2}(\mathscr {G}) = \mathscr {F}(\mathbf {Z}^n,\mathbf {C}) \supsetneqq \mathscr {G}^{[*]}= \mathscr {F}_{\mathrm {finite}}(\mathbf {Z}^n,\mathbf {C}) = \Gamma ^{\circ 2}(\mathscr {G})\).

Here \(\Psi ^{\circ 2}(\mathscr {G}) \supsetneqq \Gamma ^{\circ 2}(\mathscr {G})\). \(\square \)

Example 3.10

Let \(\mathscr {G}\) be the subfamily of \(\mathscr {F}(G,\mathbf {C})\) whose only member is the constant function with value 1. Then \(\Gamma (\mathscr {G}) = l^1(G)\). Moreover \(\Gamma ^{\circ 2}(\mathscr {G}) = l^\infty (G)\), the family of all bounded functions. The higher powers are alternatively equal to \(l^1(G)\) (odd \(k \hbox {\,\,\char 062\,\,}1\)) and \(l^ \infty (G)\) (even \(k \hbox {\,\,\char 062\,\,}2\)). So both \(l^1(G)\) and \(l^\infty (G)\) are fixed points for \(\Gamma \circ \Gamma \).

We have

$$\begin{aligned}\Psi (\mathscr {G}) = \textstyle \{f \in l^1(G); \ \sum f(x) = 0\} \end{aligned}$$

and

$$\begin{aligned}\Psi ^{\circ 2}(\mathscr {G}) = \{h \in \mathscr {F}(G,\mathbf {C}) ; \ h \text { is constant}\} = \mathscr {G}^{[*]}\subset \Gamma ^{\circ 2}(\mathscr {G}) = l^\infty (G) \end{aligned}$$

with strict inclusion if and only if G has more than one element. So here \(\Psi ^{\circ 2}(\mathscr {G}) \subsetneqq \Gamma ^{\circ 2}(\mathscr {G})\) unless G has one element. \(\square \)

Example 3.11

Next, take \(G = \mathbf {Z}\) and \(\mathscr {G}= \{\delta _{-1} - \delta _0\}\) defining a difference operator. Then \(\Gamma (\mathscr {G}) = \mathscr {F}(\mathbf {Z},\mathbf {C})\) and

$$\begin{aligned} \Gamma ^{\circ 2}(\mathscr {G}) = \mathscr {F}_{\mathrm {finite}}(\mathbf {Z},\mathbf {C}) \supsetneqq \mathscr {G}^{[*]}= \textstyle \{f \in \mathscr {F}_{\mathrm {finite}}(\mathbf {Z},\mathbf {C}); \ \sum f(x) < +\infty \}. \end{aligned}$$

We have

$$\begin{aligned}\Psi (\mathscr {G}) = \{f \in \mathscr {F}(\mathbf {Z},\mathbf {C}); \ f \text { is constant}\} \end{aligned}$$

and

$$\begin{aligned}\Psi ^{\circ 2}(\mathscr {G}) = \{h \in l^1(\mathbf {Z}); \ \textstyle \sum h(x) = 0\} \supsetneqq \mathscr {G}^{[*]}. \end{aligned}$$

Also here \(\Psi ^{\circ 2}(\mathscr {G}) \supsetneqq \Gamma ^{\circ 2}(\mathscr {G})\). \(\square \)

4 Affine Functions of a Real Variable

A function \(F:\mathbf {R}\rightarrow \mathbf {C}\) is said to be affine if it is of the form \(F(x) = ax+b\) for some constants a and b. Its restriction \(f = F|_{\mathbf {Z}} = F \circ j\) to \(\mathbf {Z}\), where \(j :\mathbf {Z}\rightarrow \mathbf {R}\) is the inclusion mapping, satisfies \(f * \mu _{\mathrm {aff}} = 0\), where \(\mu _{\mathrm {aff}} = \delta _{-1} - 2\delta _0 + \delta _1\). Conversely, if f is defined on \(\mathbf {Z}\), we can define an extension \(F(x+t) = (1-t)f(x) + tf(x+1)\), \((x,t) \in \mathbf {Z}\times [0,1]\), which is affine between any two neighboring integers. If \(f * \mu _{\mathrm {aff}} = 0\), then F is affine on the whole real line.

Let us define

Denote by \(\mathscr {A}\) the family of all restrictions to \(\mathbf {Z}\) of affine functions. Thus \(\mathscr {A}\) is by definition equal to \(\Psi (\mathscr {M})\).

Clearly \(\mathscr {M}^{[*]}\subset \mathscr {N}_0 \cap \mathscr {F}_{\mathrm {finite}}\). In fact we have equality here. That \(\mathscr {M}^{[*]}\) contains \(\mathscr {N}_0 \cap \mathscr {F}_{\mathrm {finite}}\) can be proved using the Fourier transformation and classical results from complex analysis, but since we do not need this, I will not prove it here.

Concerning \(\mathscr {N}\) and \(\mathscr {N}_0\), we note that

$$\begin{aligned} \mathscr {N}_0 \subset \mathscr {N}= \mathscr {N}_0 + \mathscr {F}_{\mathrm {finite}}. \end{aligned}$$
(4.1)

In fact, if \(f \in \mathscr {N}\), we can define \(f_0 = f + (a-b)\delta _0 + b\delta _1\), so that \(\sum f_0(x) = \sum f(x) + a\), which is zero if \(a = -\sum f(x)\), and \(\sum xf_0(x) = \sum xf(x) + b\), which is zero if \(b = -\sum xf(x)\). With these choices of a and b, \(f_0\) belongs to \(\mathscr {N}_0\) and f belongs to \(\mathscr {N}_0 + \mathscr {F}_{\mathrm {finite}}\).

Theorem 4.1

The duals of \(\mathscr {M}\), \(\mathscr {A}\), \(\mathscr {H}\), \(\mathscr {N}\) and \(\mathscr {N}_0\) under \(\Gamma \) and \(\Psi \) are:

  1. 1.

    \(\Gamma (\mathscr {M}) = \mathscr {F}\);

  2. 2.

    \(\Psi (\mathscr {M}) = \mathscr {A}\);

  3. 3.

    \(\Gamma (\mathscr {A}) = \mathscr {N}\);

  4. 4.

    \(\Psi (\mathscr {A}) = \mathscr {N}_0\);

  5. 5.

    \(\Gamma (\mathscr {H}) = \mathscr {N}\);

  6. 6.

    \(\Psi (\mathscr {H}) = \{0\}\);

  7. 7.

    \(\Gamma (\mathscr {N}) = \mathscr {H}\);

  8. 8.

    \(\Psi (\mathscr {N}) = \{0\}\);

  9. 9.

    \(\Gamma (\mathscr {N}_0) = \mathscr {H}\);

  10. 10.

    \(\Psi (\mathscr {N}_0) = \mathscr {A}\).

Proof

Property 1 follows from the fact that \(\mathscr {M}\subset \mathscr {F}_{\mathrm {finite}}\), implying that \(\Gamma (\mathscr {M}) \supset \Gamma (\mathscr {F}_{\mathrm {finite}}) = \mathscr {F}\).

Property 2 is the definition of \(\mathscr {A}\).

Property 3: We have \(\mathscr {A}\subset \mathscr {H}\) so that \(\Gamma (\mathscr {A}) \supset \Gamma (\mathscr {H}) = \mathscr {N}\) in view of 5 to be proved below. The inclusion \(\mathscr {N}\subset \Gamma (\mathscr {A})\) is easy to see directly. Property 4 follows.

Properties 5 and 7 follow from Example 3.10: \(\Gamma (l^\infty (\mathbf {Z})) = l^1(\mathbf {Z})\) and \(\Gamma (l^1(\mathbf {Z})) = l^\infty (\mathbf {Z})\). In fact, h belongs to \(\mathscr {H}\) if and only if \(x \mapsto h(x)/(1+|x|)\) belongs to \(l^\infty \) and \(\nu \) belongs to \(\mathscr {N}\) if and only if \(x \mapsto (1+|x|)\nu (x)\) is in \(l^1\), so that 5 and 7 are just the result from Example 3.10 with different weight functions.

Property 6 is obvious.

For property 7, see above on property 5.

Property 8 is obvious.

On property 9: We have a priori \(\Gamma (\mathscr {N}_0) \supset \Gamma (\mathscr {N})\), but in fact we have equality here since (4.1) implies that

$$\begin{aligned}\Gamma (\mathscr {N}_0) \supset \Gamma (\mathscr {N}) = \Gamma (\mathscr {N}_0 + \mathscr {F}_{\mathrm {finite}}) = \Gamma (\mathscr {N}_0). \end{aligned}$$

Here the last equality is a consequence of the fact that functions with finite support never influence \(\Gamma \).

10: Clearly \(f*\nu = 0\) if \(f \in \mathscr {A}\) and \(\nu \) belongs to \(\mathscr {N}_0\), so \(\mathscr {A}\subset \Gamma (\mathscr {N}_0)\). Since \(\mathscr {N}_0 \supset \mathscr {M}\), we have \(\Psi (\mathscr {N}_0) \subset \Psi (\mathscr {M}) = \mathscr {A}\) by property 2. \(\square \)

Corollary 4.2

The second duals of \(\mathscr {M}\), \(\mathscr {A}\), \(\mathscr {H}\), \(\mathscr {N}\) and \(\mathscr {N}_0\) under \(\Gamma \) and \(\Psi \) are:

  1. 1.

    \((\Gamma \circ \Psi )(\mathscr {M}) = \Gamma (\mathscr {A}) = \mathscr {N}\);

  2. 2.

    \((\Gamma \circ \Gamma )(\mathscr {M}) = \Gamma (\mathscr {F}) = \mathscr {F}_{\mathrm {finite}}\);

  3. 3.

    \((\Psi \circ \Psi )(\mathscr {M}) = \Psi (\mathscr {A}) = \mathscr {N}_0\);

  4. 4.

    \((\Psi \circ \Gamma )(\mathscr {M}) = \Psi (\mathscr {F}) = \{0\}\);

  5. 5.

    \((\Gamma \circ \Psi )(\mathscr {A}) = \Gamma (\mathscr {N}_0) = \mathscr {H}\);

  6. 6.

    \((\Gamma \circ \Gamma )(\mathscr {A}) = \Gamma (\mathscr {N}) = \mathscr {H}\);

  7. 7.

    \((\Psi \circ \Psi )(\mathscr {A}) = \Psi (\mathscr {N}_0) = \mathscr {A}\);

  8. 8.

    \((\Psi \circ \Gamma )(\mathscr {A}) = \Psi (\mathscr {N}) = \{0\}\);

  9. 9.

    \((\Gamma \circ \Psi )(\mathscr {H}) = \Gamma (\{0\}) = \mathscr {F}\);

  10. 10.

    \((\Gamma \circ \Gamma )(\mathscr {H}) = \Gamma (\mathscr {N}) = \mathscr {H}\);

  11. 11.

    \((\Psi \circ \Psi )(\mathscr {H}) = \Psi (\{0\}) = \mathscr {F}\);

  12. 12.

    \((\Psi \circ \Gamma )(\mathscr {H}) = \Psi (\mathscr {N}) = \{0\}\);

  13. 13.

    \((\Gamma \circ \Psi )(\mathscr {N}) = \Gamma (\{0\}) = \mathscr {F}\);

  14. 14.

    \((\Gamma \circ \Gamma )(\mathscr {N}) = \Gamma (\mathscr {H}) = \mathscr {N}\);

  15. 15.

    \((\Psi \circ \Psi )(\mathscr {N}) = \Psi (\{0\}) = \mathscr {F}\);

  16. 16.

    \((\Psi \circ \Gamma )(\mathscr {N}) = \Psi (\mathscr {H}) = \{0\}\);

  17. 17.

    \((\Gamma \circ \Psi )(\mathscr {N}_0) = \Gamma (\mathscr {A}) = \mathscr {N}\);

  18. 18.

    \((\Gamma \circ \Gamma )(\mathscr {N}_0) = \Gamma (\mathscr {H}) = \mathscr {N}\);

  19. 19.

    \((\Psi \circ \Psi )(\mathscr {N}_0) = \Psi (\mathscr {A}) = \mathscr {N}_0\);

  20. 20.

    \((\Psi \circ \Gamma )(\mathscr {N}_0) = \Psi (\mathscr {H}) = \{0\}\).

Proof

These twenty properties are easy consequences of Theorem 4.1. \(\square \)

The corollary shows that, for \(\Gamma \circ \Gamma \), \(\mathscr {H}\) and \(\mathscr {N}\) are closed, while \(\mathscr {M}\), \(\mathscr {A}\) and \(\mathscr {N}_0\) are not. For \(\Psi \circ \Psi \), \(\mathscr {A}\) and \(\mathscr {N}_0\) are closed, while \(\mathscr {M}\), \(\mathscr {H}\) and \(\mathscr {N}\) are not closed.

5 Affine Functions of a Complex Variable

A function \(F :\mathbf {Z}[\mathrm {i}]\rightarrow \mathbf {C}\) is said to be affine if it is of the form \(F(z) = az + b\bar{z} + c\) for some constants abc. We now redefine \(\mathscr {M}\) and the other classes in the previous section:

Let us also redefine \(\mathscr {A}\) to be the set of restrictions to \(\mathbf {Z}[\mathrm {i}]\) of affine functions on \(\mathbf {C}\). Thus \(\mathscr {A}= \Psi (\mathscr {M})\) by definition.

We note that, as before \(\mathscr {N}= \mathscr {N}_0 + \mathscr {F}_{\mathrm {finite}}\).

It is easy to see that if a function \(F :\mathbf {C}\rightarrow \mathbf {C}\) is affine, then its restriction f to \(\mathbf {Z}[\mathrm {i}]\) satisfies \(f * \mu _j = 0\), \(j = 1,2,3\).

If \(f :\mathbf {Z}[\mathrm {i}]\rightarrow \mathbf {C}\), we define an extension to \(\mathbf {C}\) by putting

$$\begin{aligned} F(sx + ty)&= (1-s)f(x+\mathrm {i}y) + sf(x + \mathrm {i}y +1 ) \\&\quad +\, (1-t)f(x+\mathrm {i}y) + tf(x + \mathrm {i}y + \mathrm {i})), \end{aligned}$$

where \((x+\mathrm {i}y,s,t) \in \mathbf {Z}[\mathrm {i}]\times [0,1] \times [0,1]\). If \(f * \mu _1 = 0\), then this extension is affine in each square with vertices in z, \(z +1 \), \(z + 1 + \mathrm {i}\), \(z + \mathrm {i}\). If f also satisfies \(f * \mu _2 = f * \mu _3 = 0\), then the extension is affine in all of \(\mathbf {C}\).

Theorem 5.1

The duals of \(\mathscr {M}\), \(\mathscr {A}\), \(\mathscr {N}\), \(\mathscr {N}_0\) and \(\mathscr {H}\) under \(\Gamma \) and \(\Psi \) are, with the new definitions introduced here, just as in Theorem 4.1.

Proof

We can argue just as in the proof of Theorem 4.1. \(\square \)

Corollary 5.2

The second duals of \(\mathscr {M}\), \(\mathscr {A}\), \(\mathscr {N}\), \(\mathscr {N}_0\) and \(\mathscr {H}\) under \(\Gamma \) and \(\Psi \) are just as in Corollary 4.2. \(\square \)

Concerning closed and not closed families under \(\Gamma \circ \Gamma \) and \(\Psi \circ \Psi \), the situation is the same as mentioned after the proof of Corollary 4.2.

6 Approaching Monodiffric Functions via Polygons

In analogy with the result that an integral \(\int _C h(z)\mathrm {d}z\) over a closed curve vanishes if h is holomorphic inside C, we shall look at integrals over a simple closed polygon P in the complex plane \(\mathbf {C}\).

Take P consisting of m segments \([a_0,a_1]\), \([a_1,a_2]\), ..., \([a_{m-1},a_0]\), where \(a_0,\dots ,a_{m-1}\) are given points in \(\mathbf {C}\). The polygon is thus determined by \((a_0,\dots ,a_{m-1})\in \mathbf {C}^m\). We shall say that a complex-valued function f defined on P is piecewise affine if f is affine on each segment \([a_j,a_{j+1}]\). This means that, if \(a_{j+1}\ne a_j\),

$$\begin{aligned} f(z) = \frac{a_{j+1}-z}{a_{j+1}-a_j}f(a_j) + \frac{z-a_j}{a_{j+1}-a_j}f(a_{j+1}), \quad z\in [a_j,a_{j+1}],\quad j=0,\dots ,m-1. \end{aligned}$$

Here and in the sequel we count indices modulo m. If \(a_{j+1} = a_j\) the formula reduces to \(f(z) = f(a_j) = f(a_{j+1})\).

The integral of a piecewise affine function is easy to calculate.

Proposition 6.1

Let f be piecewise affine on a closed polygon P determined by \((a_0,\dots ,a_{m-1})\). Then

$$\begin{aligned}\int _P f(z)\mathrm {d}z = {\textstyle \frac{1}{2}}\sum _0^{m-1}f(a_j)(a_{j+1}-a_{j-1}) = {\textstyle \frac{1}{2}}\sum _0^{m-1}\big (f(a_{j-1}) - f(a_{j+1})\big )a_j. \end{aligned}$$

Proof

If f is affine on a segment \([a_j,a_{j+1}]\) we can replace it by its average over the segment without changing the value of the integral. The average is \({\textstyle \frac{1}{2}}f(a_j)+{\textstyle \frac{1}{2}}f(a_{j+1})\). This implies that

$$\begin{aligned} \int _{a_j}^{a_{j+1}} f(z)\mathrm {d}z= & {} \int _{a_j}^{a_{j+1}}\left( {\textstyle \frac{1}{2}}f(a_j)+{\textstyle \frac{1}{2}}f(a_{j+1})\right) \mathrm {d}z \\= & {} \left( {\textstyle \frac{1}{2}}f(a_j)+{\textstyle \frac{1}{2}}f(a_{j+1})\right) (a_{j+1} - a_j). \end{aligned}$$

To finish we just need to sum over j and change the indices. \(\square \)

Definition 6.2

Given a simple closed polygon P in \(\mathbf {C}\) we shall say that a function f defined on its vertices is holomorphic inside P if \(\int _P f_{\mathrm {aff}}(z)\mathrm {d}z = 0\), where \(f_{\mathrm {aff}}\) is the unique piecewise affine function on P which takes the same values as f on the vertices. \(\square \)

Proposition 6.1 now yields the following result.

Corollary 6.3

Let \(a_0,\dots ,a_{m-1}\) be m points in the complex plane. A function defined on the vertices of the closed polygon P defined by \((a_0,\dots ,a_{m-1})\) is holomorphic inside P if and only if

$$\begin{aligned} \sum _0^{m-1}f(a_j)(a_{j+1}-a_{j-1}) = 0. \end{aligned}$$
(6.1)

\(\square \)

When \(m=1,2\), every function is holomorphic.

When \(m=3\) and \((a_0,a_1,a_2) = (a,b,c)\), the condition becomes

$$\begin{aligned} f(a)(b-c) + f(b)(c-a) + f(c)(a-b) = 0, \end{aligned}$$

which can be written as

$$\begin{aligned} \frac{f(b)-f(a)}{b-a} = \frac{f(c)-f(a)}{c-a}. \end{aligned}$$

This means that the difference quotient is the same in the direction from a to b as in the direction from a to c. In particular, if \(b=a+1\) and \(c = a+\mathrm {i}\), we get

$$\begin{aligned} \frac{f(a+1)-f(a)}{1} = \frac{f(a+\mathrm {i})-f(a)}{\mathrm {i}}. \end{aligned}$$
(6.2)

Definition 6.4

Let A be a subset of \(\mathbf {Z}[\mathrm {i}]\) which is a union of triples z, \(z+1\), \(z+\mathrm {i}\), \(z \in \mathbf {Z}[\mathrm {i}]\). A complex-valued function f defined on A shall be said to be monodiffric of the first kind or holomorphic in the sense of Isaacs if (6.2) holds for all \(a\in A\) such that also \(a+1\) and \(a+\mathrm {i}\) belong to A. \(\square \)

Isaacs [6, 7] studied functions that satisfy the equality (6.2). They satisfy \(\mu _{\mathrm {I}} * f = 0,\) where

$$\begin{aligned} \mu _{\mathrm {I}} = \delta _{-1} + \mathrm {i}\delta _{-\mathrm {i}} - (1+\mathrm {i})\delta _0 \end{aligned}$$
(6.3)

We shall denote by \(\mathscr {O}_{\mathrm {I}}(A)\) the set of functions \(f :A \rightarrow \mathbf {C}\) which satisfy \(\mu _{\mathrm {I}} * f = 0\) at the points where the convolution product is defined, the functions holomorphic in the sense of Isaacs.

When \(m=4\) and \((a_0,a_1,a_2,a_3) = (a,b,c,d)\), condition (6.1) becomes

$$\begin{aligned}f(a)(b-d) + f(b)(c-a) + f(c)(d-b) + f(d)(a-c) = 0,\end{aligned}$$

which may be written

$$\begin{aligned}\frac{f(c)-f(a)}{c-a} = \frac{f(d)-f(b)}{d-b}, \end{aligned}$$

meaning that the difference quotient in the direction from a to c is equal to that in the direction from b to d. This is the definition studied by Ferrand [5]. In particular, if we let \(b = a+1\), \(c = a+1+\mathrm {i}\) and \(d = a + \mathrm {i}\), we get

$$\begin{aligned} \frac{f(a+1+\mathrm {i}) - f(a)}{1 + \mathrm {i}} = \frac{f(a+\mathrm {i}) - f(a+1)}{\mathrm {i}- 1}. \end{aligned}$$
(6.4)

Definition 6.5

Let A be a subset of \(\mathbf {Z}[\mathrm {i}]\) which is a union of quadruples z, \(z+1\), \(z+1+\mathrm {i}\), \(z+\mathrm {i}\). A function \(f:A \rightarrow \mathbf {C}\) is said to be monodiffric of the second kind or holomorphic in the sense of Ferrand if (6.4) holds for all \(a\in A\) such that also \(a+1\), \(a+\mathrm {i}\), and \(a+1+\mathrm {i}\) all belong to A. \(\square \)

Functions satisfying (6.4) satisfy \(\mu _{\mathrm {F}} * f = 0,\) where

$$\begin{aligned} \mu _{\mathrm {F}} = \delta _{-1-\mathrm {i}} + \mathrm {i}\delta _{-\mathrm {i}} -\mathrm {i}\delta _{-1} - \delta _0. \end{aligned}$$

We shall denote by \(\mathscr {O}_{\mathrm {F}}(A)\) the set of functions \(f :A \rightarrow \mathbf {C}\) which satisfy \(\mu _{\mathrm {F}} * f = 0\) where the convolution product is defined, the functions holomorphic in the sense of Ferrand.

7 Cauchy Problems for Functions Holomorphic in the Sense of Isaacs

We can solve uniquely a Cauchy problem with data given on an infinite set:

Theorem 7.1

Given any functions \(\varphi :\mathbf {Z}\rightarrow \mathbf {C}\) and \(\psi :-\mathbf {N}\rightarrow \mathbf {C}\) with \(\varphi (0) = \psi (0)\), there exists a function \(f \in \mathscr {O}_{\mathrm {I}}(\mathbf {Z}[\mathrm {i}])\) such that \(f(x) = \varphi (x)\), \(x \in \mathbf {Z}\) and \(f(\mathrm {i}y) = \psi (y)\) for \(y \in -\mathbf {N}\).

Proof

We define \(f(x) = \varphi (x)\) for \(x \in \mathbf {Z}\) and then \(f(x+\mathrm {i})\) as required by the condition given by the difference operator \(\mu _{\mathrm {I}}\). This means that we must have \(f(x+\mathrm {i}) - f(x) = -\mathrm {i}(f(x+1) - f(x))\), implying that we must take \(f(x+\mathrm {i}) = -\mathrm {i}\varphi (x+1) + (1+\mathrm {i})\varphi (x)\). Continuing in this way, we see that f(z) is uniquely determined for \(z = x+\mathrm {i}y\), \(y \hbox {\,\,\char 062\,\,}0\).

For \(f(x+\mathrm {i}y)\) with \(y \hbox {\,\,\char 054\,\,}-1\) we proceed in the same way from the values of \(\psi \), now going to the right and left from \(x = 0\), \(y \hbox {\,\,\char 054\,\,}0\), and then downwards. \(\square \)

In particular this theorem shows that there are holomorphic functions in the sense of Isaacs which grow arbitrarily fast on the real axis, and in fact also in other sectors.

Proposition 7.2

If \(\varphi , \psi > 0\), then the solution \(f \in \mathscr {O}_{\mathrm {I}}(\mathbf {Z}[\mathrm {i}])\) to the Cauchy problem in Theorem 7.1 satisfies in the upper half plane

$$\begin{aligned} |f(x+\mathrm {i}y)| \hbox {\,\,\char 062\,\,}\varphi (x) + \varphi (x+y), \qquad (x,y) \in \mathbf {Z}\times \mathbf {N}; \end{aligned}$$
(7.1)

in the third quadrant

$$\begin{aligned} 2^{|y|/2}|f(x+\mathrm {i}y)| \hbox {\,\,\char 062\,\,}\varphi (x) + \psi (y), \qquad (x,y) \in (-\mathbf {N})\times (-\mathbf {N}); \end{aligned}$$
(7.2)

in the fourth quadrant

$$\begin{aligned} |f(x+\mathrm {i}y)| \hbox {\,\,\char 062\,\,}\psi (y) + \psi (x+y), \qquad (x,y) \in \mathbf {N}\times (-\mathbf {N}), \ x + y \hbox {\,\,\char 054\,\,}0; \text { and } \end{aligned}$$
(7.3)
$$\begin{aligned} |f(x+\mathrm {i}y)| \hbox {\,\,\char 062\,\,}\psi (y) + \varphi (x+y), \qquad (x,y) \in \mathbf {N}\times (-\mathbf {N}), \ x + y \hbox {\,\,\char 062\,\,}0. \end{aligned}$$
(7.4)

Proof

The induction follows different directions in the various sectors, which is why we shall estimate different terms in (6.2) by the other terms. Let us introduce a new function \(g(x+\mathrm {i}y) = \mathrm {i}^{-ax-by}f(x+\mathrm {i}y)\) and see what (6.2) means for g. The result is

$$\begin{aligned} \mathrm {i}^a g(z+1) + \sqrt{2}\mathrm {i}^{-3/2}g(z) + \mathrm {i}^{b+1}g(z + \mathrm {i}) = 0. \end{aligned}$$
(7.5)

In the upper half plane we choose \(a = -3/2\) and \(b = -1/2\) and get \(g(z+\mathrm {i}) = g(z+1) + \sqrt{2}g(z)\), an estimate of g at points with \(\mathrm{Im}\,z > \mathrm{Im}(z+1) = \mathrm{Im}\,z\). This implies (7.1) since \(|f| = |g|\).

In the third quadrant we choose \(a = 1/2\) and \(b = -1/2\) and get

$$\begin{aligned} \sqrt{2}g(z) = g(z+1) + g(z+\mathrm {i}), \end{aligned}$$

giving us an estimate of g(z) by the value at two points \(z+1\) and \(z+\mathrm {i}\) with \(\mathrm{Re}\,z + \mathrm{Im}\,z < \mathrm{Re}(z+1) + \mathrm{Im}(z+1) = \mathrm{Re}(z+\mathrm {i}) + \mathrm{Im}(z + \mathrm {i})\). (The induction goes along decreasing values of \(\mathrm{Re}\,z + \mathrm{Im}\,z\).) This implies (7.2) since \(|f| = |g|\).

In the fourth quadrant, finally, we take \(a = 1/2\) and \(b = 3/2\), and obtain \(g(z+\mathrm {i}) = g(z+1) + \sqrt{2}g(z)\), resulting in an estimate of \(g(z+\mathrm {i})\) by the value at two points \(z+1\) and z with \(\mathrm{Im}(z+1) - \mathrm{Re}(z+1) < \mathrm{Im}\,z - \mathrm{Re}\,z = \mathrm{Im}(z+\mathrm {i}) - \mathrm{Re}(z+\mathrm {i})\). (Here the induction goes along decreasing values of \(\mathrm{Im}\,z - \mathrm{Re}\,z\).) Hence (7.3) and (7.4). \(\square \)

It is crucial here that \(|f(x+\mathrm {i}y)|\) tends to plus infinity as \(|x| \vee |y| \rightarrow +\infty \) and not only as \(|x| \wedge |y| \rightarrow +\infty \). In fact, the construction in later proofs will fail if \(|f(x+\mathrm {i}y)|\) does not tend to \(+\infty \) in a sequence of points \(x+\mathrm {i}y\) such that y remains bounded. We shall therefore estimate \(|f(x+\mathrm {i}y)|\) from below by a function of \(|x|\vee |y|\) which tends to plus infinity as \(|x|\vee |y| \rightarrow +\infty \), equivalently as \(|z| \rightarrow +\infty \).

Definition 7.3

Define two functions \(\varphi _0\) and \(\psi _0\) of \(\varphi \) and \(\psi \) by

$$\begin{aligned} \varphi _0(x) = \inf _{|s| \hbox {\,\,\char 062\,\,}|x|}\varphi (s), \quad x \in \mathbf {Z}; \qquad \psi _0(y) = \inf _{t \hbox {\,\,\char 054\,\,}-|y|}\psi (t), \quad y \in \mathbf {Z}. \end{aligned}$$

\(\square \)

They are symmetric minorants of \(\varphi \) and \(\psi \) and tend to \(+\infty \) as \(|x| \vee |y|\) tends to \(+\infty \) provided \(\varphi \) and \(\psi \) do so.

We shall estimate |f| from below by \(\tau (z) = \tau (x+\mathrm {i}y) = \varphi _0(|x|\vee |y|) \wedge \psi _0(|x|\vee |y|)\), which also tends to \(+\infty \) as \(|z| \rightarrow +\infty \) if both \(\varphi \) and \(\psi \) do so. The arguments for the Cauchy data are x, \(x+y\) and y. We have to relate them to \(|x|\vee |y|\), to be done differently in various sectors.

Proposition 7.4

We consider eight sectors in the plane:

  1. 1.

    In the first quadrant, \(|x|\vee |y|\) is equal to \(x \vee y \hbox {\,\,\char 054\,\,}x+y\), so that \(\varphi (x+y) \hbox {\,\,\char 062\,\,}\varphi _0(|x|\vee |y|) \hbox {\,\,\char 062\,\,}\tau (z)\).

  2. 2.1.

    In the sector defined by \(0 \hbox {\,\,\char 054\,\,}-2x \hbox {\,\,\char 054\,\,}y\), \(|x|\vee |y|\) is equal to y and \(x+y \hbox {\,\,\char 062\,\,}{\textstyle \frac{1}{2}}y\), so that \(\varphi (x+y) \hbox {\,\,\char 062\,\,}\varphi _0({\textstyle \frac{1}{2}}y) = \varphi _0({\textstyle \frac{1}{2}}(|x|\vee |y|)) \hbox {\,\,\char 062\,\,}\tau ({\textstyle \frac{1}{2}}z)\);

  3. 2.2.

    In the sector defined by \(0 \hbox {\,\,\char 054\,\,}y \hbox {\,\,\char 054\,\,}-2x\), \(|x|\vee |y| \hbox {\,\,\char 054\,\,}|x|\vee 2|x| = 2|x|\) since now \(|x| \hbox {\,\,\char 062\,\,}{\textstyle \frac{1}{2}}y\), implying that \(\varphi (x) \hbox {\,\,\char 062\,\,}\varphi _0(|x|) \hbox {\,\,\char 062\,\,}\varphi _0({\textstyle \frac{1}{2}}(|x|\vee |y|)) \hbox {\,\,\char 062\,\,}\tau ({\textstyle \frac{1}{2}}z)\);

  4. 3.1.

    In the sector defined by \(x \hbox {\,\,\char 054\,\,}y \hbox {\,\,\char 054\,\,}0\), \(|x|\vee |y|\) is equal to \(-x = |x|\), so that we have \(\varphi (x) \hbox {\,\,\char 062\,\,}\varphi _0(|x|) = \varphi _0(|x| \vee |y|) \hbox {\,\,\char 062\,\,}\tau (z)\);

  5. 3.2.

    In the sector defined by \(y \hbox {\,\,\char 054\,\,}x \hbox {\,\,\char 054\,\,}0\), \(|x|\vee |y|\) is equal to \(-y = |y|\), so that

    \(\psi (y) \hbox {\,\,\char 062\,\,}\psi _0(|y|) = \psi _0(|x|\vee |y|) \hbox {\,\,\char 062\,\,}\tau (z)\);

  6. 4.1.

    In the sector defined by \(y \hbox {\,\,\char 054\,\,}- x \hbox {\,\,\char 054\,\,}0\), \(|x|\vee |y|\) is equal to |y|, so that

    \(\psi (y) = \psi _0(|x|\vee |y|) \hbox {\,\,\char 062\,\,}\tau (z)\);

  7. 4.2.

    In the sector defined by \(-x \hbox {\,\,\char 054\,\,}y \hbox {\,\,\char 054\,\,}-{\textstyle \frac{1}{2}}x\), \(|x|\vee |y|\) is equal to x, so that

    \(\psi (y) = \psi _0(|y|) \hbox {\,\,\char 062\,\,}\psi _0({\textstyle \frac{1}{2}}x) = \psi _0({\textstyle \frac{1}{2}}(|x|\vee |y|)) \hbox {\,\,\char 062\,\,}\tau ({\textstyle \frac{1}{2}}z)\);

  8. 4.3.

    In the sector defined by \(-{\textstyle \frac{1}{2}}x \hbox {\,\,\char 054\,\,}y \hbox {\,\,\char 054\,\,}0\), finally, \(|x|\vee |y|\) is equal to x and \(x+y \hbox {\,\,\char 062\,\,}{\textstyle \frac{1}{2}}x = {\textstyle \frac{1}{2}}(|x|\vee |y|)\), implying that \(\varphi (x+y) \hbox {\,\,\char 062\,\,}\varphi _0(|x+y|) \hbox {\,\,\char 062\,\,}\varphi ({\textstyle \frac{1}{2}}(|x|\vee |y|)) \hbox {\,\,\char 062\,\,}\tau ({\textstyle \frac{1}{2}}z)\).

Proof

In each of the eight cases, simple comparisons give the result. \(\square \)

Theorem 7.5

Functions in \(\mathscr {O}_{\mathrm {I}}(\mathbf {C})\) can grow as fast as we want.

Proof

Because of the weaker estimate (7.2) in the third quadrant we replace \(\varphi _0\) in sector 3.1 in Proposition 7.4 by \(\varphi _1(x) = 2^{|x|/2}\varphi _0(x)\). In sector 3.2 we replace instead \(\psi _0\) by \(\psi _1(y) = 2^{|y|/2}\psi _0(y)\). This proves that \(\tau (z)\) tends to \(+\infty \) as \(|z| \rightarrow +\infty \) ... as fast as we like. \(\square \)

Theorem 7.6

The second dual under \(\Psi \) of \(\{\mu _{\mathrm {I}}\}\) is

$$\begin{aligned} \Psi ^{\circ 2}(\{\mu _{\mathrm {I}}\}) = \{\mu _{\mathrm {I}} * \rho ; \ \rho \in \mathscr {F}_{\mathrm {finite}}(\mathbf {C},\mathbf {C})\} = {\mu _{\mathrm {I}}}^{[*]}. \end{aligned}$$

Thus the class \({\mu _{\mathrm {I}}}^{[*]}\) is closed for \(\Psi ^{\circ 2}\), in contrast to the situation in Theorems 4.1 and 5.1, where \(\Psi ^{\circ 2}(\mathscr {M}) = \mathscr {N}_0 \supsetneqq \mathscr {M}\) (see property 3 in Corollaries 4.2 and 5.2).

Proof

From Proposition 3.7 it follows that the second dual contains \({\mu _{\mathrm {I}}}^{[*]}\).

For the converse, suppose that there are infinitely many points z with \(\rho (z) \ne 0\). We then take \(f \in \mathscr {O}_{\mathrm {I}}(\mathbf {Z}[\mathrm {i}])\) so that \(|f(z)| \hbox {\,\,\char 062\,\,}1/|\rho (z)|\) for infinitely many points z with \(\rho (z) \ne 0\), preventing \(|f| * |\rho |\) from converging. \(\square \)

8 Cauchy Problems for Functions Holomorphic in the Sense of Ferrand

Also the family \(\mathscr {O}_{\mathrm {F}}(\mathbf {Z}[\mathrm {i}])\) is rich in fast-growing functions:

Theorem 8.1

Given any functions \(\varphi :\mathbf {Z}\rightarrow \mathbf {C}\) and \(\psi :\mathbf {Z}\rightarrow \mathbf {C}\) with \(\varphi (0) = \psi (0)\), there exists a function \(f \in \mathscr {O}_{\mathrm {F}}(\mathbf {Z}[\mathrm {i}])\) such that \(f(x) = \varphi (x)\), \(x \in \mathbf {Z}\) and \(f(\mathrm {i}y) = \psi (y)\), \(y \in \mathbf {Z}\).

Proof

In the first quadrant we define \(f(x) = \varphi (x)\) for \(x \in \mathbf {N}\) and \(f(\mathrm {i}y) = \psi (y)\), \(y \in \mathbf {N}\) and then \(f(1+\mathrm {i})\) as required by the condition given by the difference operator \(\mu _{\mathrm {F}}\). We then go on: if we have already found the values of f at three points \(x+\mathrm {i}y\), \(x+\mathrm {i}y + 1\) and \(x+\mathrm {i}y+\mathrm {i}\), then there is a unique value for f at \(x + \mathrm {i}y + 1 + \mathrm {i}\) which satisfies the condition.

Similary we can go on defining f in each of the other quadrants, always going from three vertices of a square to the fourth, the one which is farthest from the origin. \(\square \)

In particular Theorem 8.1 shows that there are holomorphic functions in the sense of Ferrand which grow arbitrarily fast on the axes, and in fact also in other sectors.

Theorem 8.2

If \(\varphi , \psi > 0\), the function constructed in Theorem 8.1 satisfies

$$\begin{aligned} |f(x+\mathrm {i}y)| \hbox {\,\,\char 062\,\,}\varphi (x) + \psi (y), \qquad (x,y) \in \mathbf {Z}\times \mathbf {Z}. \end{aligned}$$

Proof

We define \(g(x+\mathrm {i}y) = \mathrm {i}^{x-y}f(x+\mathrm {i}y)\), so that g satisfies

$$\begin{aligned} g(z + 1 + \mathrm {i}) = g(z) + g(z+i) + g(z+1) \end{aligned}$$

in the first quadrant. This proves that \(|f(x +\mathrm {i}y)| = g(x+\mathrm {i}y) \hbox {\,\,\char 062\,\,}\varphi (x) + \psi (y)\), \(x,y\in \mathbf {N}\), thus arbitrarily large for convenient choices of the Cauchy data. Because of the symmetry, similar estmates hold for the three other quadrants. \(\square \)

Definition 8.3

We keep the notation \(\varphi _0\) from Definition 7.3 and redefine \(\psi _0\) as

$$\begin{aligned} \qquad \quad \qquad \qquad \quad \qquad \ \psi _0(y) = \inf _{|t| \hbox {\,\,\char 062\,\,}|y|}\psi (t), \qquad y \in \mathbf {Z}. \qquad \quad \qquad \qquad \quad \qquad \qquad \quad \qquad \square \end{aligned}$$

Proposition 8.4

Here we consider four sectors only.

  1. 1.

    In the sectors defined by \(|y| \hbox {\,\,\char 054\,\,}|x|\), \(|x|\vee |y|\) is equal to |x|, so that

    \(\varphi (x) \hbox {\,\,\char 062\,\,}\varphi _0(|x|\vee |y|) \hbox {\,\,\char 062\,\,}\tau (z)\).

  2. 2.

    In the sectors defined by \(|x| \hbox {\,\,\char 054\,\,}|y|\), \(|x|\vee |y|\) is equal to |y|, so that

    \( \psi (y) \hbox {\,\,\char 062\,\,}\psi _0(|x| \vee |y|) \hbox {\,\,\char 062\,\,}\tau (z)\).

Proof

Simple comparisons will do. \(\square \)

Theorem 8.5

Functions in \(\mathscr {O}_{\mathrm {F}}(\mathbf {C})\) can grow as fast as we want.

Proof

This is clear in view of Proposition 8.4. \(\square \)

Theorem 8.6

The second dual under \(\Psi \) of \(\{\mu _{\mathrm {F}}\}\) is

$$\begin{aligned} \Psi ^{\circ 2}(\{\mu _{\mathrm {F}}\}) = \{\mu _{\mathrm {F}} * \rho ; \ \rho \in \mathscr {F}_{\mathrm {finite}}(\mathbf {C},\mathbf {C})\} = {\mu _{\mathrm {F}}}^{[*]}. \end{aligned}$$

Thus the class \({\mu _{\mathrm {F}}}^{[*]}\) is closed for \((\Psi )^{\circ 2}\) also in this case.

Proof

As before it is clear that the second dual contains \({\mu _{\mathrm {F}}}^{[*]}\).

For the converse, suppose that there are infinitely many points z with \(\rho (z) \ne 0\). We then take \(f \in \mathscr {O}_{\mathrm {F}}(\mathbf {Z}[\mathrm {i}])\) so that \(|f(z)| \hbox {\,\,\char 062\,\,}1/|\rho (z)|\) for infinitely many points z with \(\rho (z) \ne 0\), preventing \(|\rho | * |f|\) from converging.

Since it may happen that \(\rho \) is different from zero only in points \(x + \mathrm {i}y\) with y bounded, it is important here to be able to choose f large also at such points; cf. Propositions 7.4 and 8.4. \(\square \)