Formal Definition
Let V be a vector space of dimension n over a field F (with n≥2), and let Fun(V,V) denote the linear transformations on V. An n-trace diagram is a graph, where the sets Vi (i = 1, 2, n) are composed of vertices of degree i, together with the following additional structures:
- a ciliation at each vertex in the graph, which is an explicit ordering of the adjacent edges at that vertex;
- a labeling V2 → Fun(V,V) associating each degree-2 vertex to a linear transformation.
Note that V2 and Vn should be considered as distinct sets in the case n = 2. A framed trace diagram is a trace diagram together with a partition of the degree-1 vertices V1 into two disjoint ordered collections called the inputs and the outputs.
The "graph" underlying a trace diagram may have the following special features, which are not always included in the standard definition of a graph:
- Loops are permitted (a loop is an edges that connects a vertex to itself).
- Edges that have no vertices are permitted, and are represented by small circles.
- Multiple edges between the same two vertices are permitted.
Read more about this topic: Trace Diagram
Famous quotes containing the words formal and/or definition:
“That anger can be expressed through words and non-destructive activities; that promises are intended to be kept; that cleanliness and good eating habits are aspects of self-esteem; that compassion is an attribute to be prized—all these lessons are ones children can learn far more readily through the living example of their parents than they ever can through formal instruction.”
—Fred Rogers (20th century)
“Although there is no universal agreement as to a definition of life, its biological manifestations are generally considered to be organization, metabolism, growth, irritability, adaptation, and reproduction.”
—The Columbia Encyclopedia, Fifth Edition, the first sentence of the article on “life” (based on wording in the First Edition, 1935)