Multilinearity of Sketches
نویسنده
چکیده
We give a precise characterization for when the models of the tensor product of sketches are structurally isomorphic to the models of either sketch in the models of the other. For each base category K call the just mentioned property (sketch) K-multilinearity. Say that two sketches are K-compatible with respect to base category K just in case in each K-model, the limits for each limit specification in each sketch commute with the colimits for each colimit specification in the other sketch and all limits and colimits are pointwise. Two sketches are K-multilinear if and only if the two sketches are K-compatible. This property then extends to strong Colimits of sketches. We shall use the technically useful property of limited completeness and completeness of every category of models of sketches. That is, categories of sketch models have all limits commuting with the sketched colimits and and all colimits commuting with the sketched limits. Often used implicitly, the precise statement of this property and its proof appears here.
منابع مشابه
On Multilinearity and Skew-symmetry of Certain Symbols in Motivic Cohomology of Fields
The purpose of the present article is to show the multilinearity for symbols in Goodwillie-Lichtenbaum motivic complex in two cases. The first case shown is where the degree is equal to the weight. In this case, the motivic cohomology groups of a field are isomorphic to the Milnor’s K-groups as shown by Nesterenko-Suslin, Totaro and Suslin-Voevodsky for various motivic complexes, but we give an...
متن کاملIdeal Multilinear Maps based on Ideal Lattices
Cryptographic multilinear maps have many applications, such as multipartite key exchange and software obfuscation. However, the encodings of three current constructions are “noisy” and their multilinearity levels are fixed and bounded in advance. In this paper, we describe a candidate construction of ideal multilinear maps by using ideal lattices, which supports arbitrary multilinearity levels....
متن کاملIdeal Multilinear Maps Based on Ideal Lattices
Cryptographic multilinear maps have many applications, such as multipartite key exchange and software obfuscation. However, the encodings of three current constructions are “noisy” and their multilinearity levels are fixed and bounded in advance. In this paper, we describe a candidate construction of ideal multilinear maps by using ideal lattices, which supports arbitrary multilinearity levels....
متن کاملSimulation of Arithmetical Circuits by Branching Programs with Preservation of Constant Width and Syntactic Multilinearity
We study structural properties of restricted width arithmetical circuits. It is shown that syntactically multilinear arithmetical circuits of constant width can be efficiently simulated by syntactically multilinear algebraic branching programs of constant width, i.e. that sm-VSC ⊆ sm-VBWBP. Also, we obtain a direct characteriztion of poly-size arithmetical formulas in terms of multiplicatively ...
متن کامل18.700 Fall 2010, Final Exam Solutions
Bonus: This is the unique function on matrices that satisfies multilinearity, alternation, and such that det(I) = 1. Here multilinearity means that the function is linear in each column separately, i.e., it is multiadditive and multihomogeneous: multiadditive means that, if A and B are two matrices which have the same columns except for the k-th column, and C is the matrix which has the same co...
متن کامل