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:
“The conviction that the best way to prepare children for a harsh, rapidly changing world is to introduce formal instruction at an early age is wrong. There is simply no evidence to support it, and considerable evidence against it. Starting children early academically has not worked in the past and is not working now.”
—David Elkind (20th century)
“Perhaps the best definition of progress would be the continuing efforts of men and women to narrow the gap between the convenience of the powers that be and the unwritten charter.”
—Nadine Gordimer (b. 1923)