The Setting
Start from a set of points and label maps on it, , each taking at most values. A label map cuts into classes, the points that share a label. A set of indices turns into a graph, two points being joined when some with gives them the same label, and the graph distance counts the steps between two points, infinite across components.
Fix a radius . Around a base point , the column is a bump on of height at that decays with the logarithm of and vanishes at distance and beyond, and off the component of . The columns over all base points and all in a family make a matrix, and its rows , one for each point of , are points of .
Label Maps and Their Encodings
Let be a set and an index set. A family of label maps on indexed by is a family of maps , , each into a set of labels.
Take , a natural number , and . A fixed label encoding of with codes is a family of maps together with maps , , such that for every and all points of (1)✦
If is finite and nonempty and (2)✦ then has a fixed label encoding with codes.
Partition Graphs
For a subset of , the partition graph is the simple graph on in which two points and are adjacent when (3)✦
The distance between points and of is their graph distance in : (4)✦ so that takes values in .
For a natural number , the ball of radius about a point in is the set of points of with (5)✦
The Logarithmic Profile
The logarithmic profile with cutoff , for a natural number , is the real function on given by (6)✦
The Definition
Definition 1. Let be a family of label maps on a set , let be a finite family of finite subsets of , and let be a natural number. The column index set is (7)✦ the column of is the real function on given by (8)✦ and the row of a point of is the vector (9)✦
In the paper, the result reads: label maps , , with at most realized labels each; a family of subsets of with for a parameter ; for the graph joining distinct and when for some , with graph distance , equal to between components; with ; and ; and for .
What Is Checked
The definition is stated over a set with label maps indexed by , a finite family of finite subsets of and a natural number , through the partition graphs of (3), their distances of (4) and the logarithmic profile of (6).
About these constructions the library proves one further fact: a map from a finite set to any set, taking at most values, has an injection of its value set into .✦