Duality for dyadic triangles

This paper is a direct continuation of the paper “Duality for dyadic intervals” by the same authors, and can be considered as its second part. Dyadic rationals are rationals whose denominator is a power of 2. Dyadic triangles and dyadic polygons are, respectively, defined as the intersections with the dyadic plane of a triangle or polygon in the real plane whose vertices lie in the dyadic plane. The one-dimensional analogues are dyadic intervals. Algebraically, dyadic polygons carry the structure of a commutative, entropic and idempotent groupoid under the binary operation of arithmetic mean. The first paper dealt with the structure of finitely generated subgroupoids of the dyadic line, which were shown to be isomorphic to dyadic intervals. Then a duality between the class of dyadic intervals and the class of certain subgroupoids of the dyadic unit square was described. The present paper extends the results of the first paper, provides some characterizations of dyadic triangles, and describes a duality for the class of dyadic triangles. As in the case of intervals, the duality is given by an infinite dualizing (schizophrenic) object, the dyadic unit interval. The dual spaces are certain subgroupoids of the dyadic unit cube, considered as (commutative, idempotent and entropic) groupoids with additional constant operations.

Duality for dyadic intervals

In an earlier paper, Romanowska, Ślusarski and Smith described a duality between the category of (real) polytopes (finitely generated real convex sets considered as barycentric algebras) and a certain category of intersections of hypercubes, considered as barycentric algebras with additional constant operations. This paper is a first step in finding a duality for dyadic polytopes, analogues of real convex polytopes, but defined over the ring [Formula: see text] of dyadic rational numbers instead of the ring of reals. A dyadic [Formula: see text]-dimensional polytope is the intersection with the dyadic space [Formula: see text] of an [Formula: see text]-dimensional real polytope whose vertices lie in the dyadic space. The one-dimensional analogues are dyadic intervals. Algebraically, dyadic polytopes carry the structure of a commutative, entropic and idempotent groupoid under the operation of arithmetic mean. Such dyadic polytopes do not preserve all properties of real polytopes. In particular, there are infinitely many (pairwise non-isomorphic) dyadic intervals. We first show that finitely generated subgroupoids of the groupoid [Formula: see text] are all isomorphic to dyadic intervals. Then, we describe a duality for the class of dyadic intervals. The duality is given by an infinite dualizing (schizophrenic) object, the dyadic unit interval. The dual spaces are certain subgroupoids of the square of the dyadic unit interval with additional constant operations. A second paper deals with a duality for dyadic triangles.

Two remarks on primary spaces

We prove that for an operator T on ℓ∞(H1 ()), respectively ℓ∞(L1 ()), the identity factors through T or Id - T. Hence ℓ∞(H1 ()) and ℓ∞(L1 ()) are primary spaces. We re-prove analogous results of H.M. Wark for the spaces ℓ∞(Hp()), 1 < p < ∞. In the present paper direct combinatorics of colored dyadic intervals replaces the dependence on Szemerédi's theorem in [11].

DYADIC POLYGONS

Dyadic rationals are rationals whose denominator is a power of 2. Dyadic triangles and dyadic polygons are, respectively, defined as the intersections with the dyadic plane of a triangle or polygon in the real plane whose vertices lie in the dyadic plane. The one-dimensional analogs are dyadic intervals. Algebraically, dyadic polygons carry the structure of a commutative, entropic and idempotent algebra under the binary operation of arithmetic mean. In this paper, dyadic intervals and triangles are classified to within affine or algebraic isomorphism, and dyadic polygons are shown to be finitely generated as algebras. The auxiliary results include a form of Pythagoras' theorem for dyadic affine geometry.