User tobias fritz - MathOverflow most recent 30 from http://mathoverflow.net 2013-05-24T07:01:55Z http://mathoverflow.net/feeds/user/27013 http://www.creativecommons.org/licenses/by-nc/2.5/rdf http://mathoverflow.net/questions/128260/tannaka-duality-for-c-algebras Tannaka duality for C*-algebras? Tobias Fritz 2013-04-21T17:00:59Z 2013-04-21T20:06:54Z <p><a href="https://en.wikipedia.org/wiki/Tannaka%E2%80%93Krein_duality" rel="nofollow">Tannaka-Krein duality</a> shows how to recover a group $G$ from its category $\mathbf{Rep}(G)$ of finite-dimensional complex representations and the forgetful functor $F:\mathbf{Rep}(G)\to \mathbf{Vect}_{\mathbb{C}}$.</p> <p>On the other hand, there is <a href="http://www.jstor.org/discover/10.2307/1970350?uid=3739256&amp;uid=369944801&amp;uid=2&amp;uid=3&amp;uid=60&amp;sid=21101931931083" rel="nofollow">Takesaki's theorem</a> which shows how to recover a (separable) $C^*$-algebra $A$ from its representation theory. We have just started looking into the details of this and trying to reformulate this in categorical terms. It seems tantalizingly similar to the Tannaka-Krein reconstruction theorem. In particular, it seems that Takesaki secretly also considers natural transformations from the forgetful functor $F:\mathbf{Rep}(A)\to\mathbf{Hilb}$ to itself.</p> <p>So, the question is:</p> <blockquote> <p>Can Takesaki's duality theorem indeed be formulated in categorical terms similar to Tannaka-Krein duality? Where can we read about it?</p> </blockquote> <p>We're mostly interested in the unital case. Follow-up question:</p> <blockquote> <p>Consider the category of unital $C^*$-algebras and unital completely positive maps. Is there a "nice" description of its opposite as a concrete category?</p> </blockquote> http://mathoverflow.net/questions/120128/realizing-universal-c-algebras-as-concrete-c-algebras/120130#120130 Answer by Tobias Fritz for Realizing universal C*-algebras as concrete C*-algebras Tobias Fritz 2013-01-28T17:42:45Z 2013-01-28T19:15:37Z <p><strong>Edit</strong>: as pointed out in the comments, the following answers the question for <em>unital</em> C*-algebras presented in terms of generators and relations. When I say C*-algebra, I really mean unital C*-algebra.</p> <p>It may depend on what exactly you mean by "concrete", but I highly doubt that there is a general solution to this; finding a concrete realization of a universal C*-algebra requires classifying all the representations of the given generators and relations on Hilbert space, and this is an extremely difficult problem in general. For a more rigorous argument, see below.</p> <p>But in your four examples, the universal C*-algebras are all commutative, and simple answers are possible:</p> <ol> <li>$C([-1,1])$.</li> <li>$C([0,1])$.</li> <li>$C(\mathbb{D})$ where $\mathbb{D}$ is the unit disk.</li> <li><code>$C(\{0,1\})=\mathbb{C}^2$</code>.</li> </ol> <p>In each case, the generator is the identity function, just as in your $C(\mathbb{T})$ example. It is a good exercise to verify the required universal property in each of these cases.</p> <p>Another good example is the C*-algebra freely generated by two projections. This turns out to be the group C*-algebra $C^*(\mathbb{Z}_2\ast \mathbb{Z}_2)=C^*(\mathbb{Z}\rtimes\mathbb{Z}_2)$ and can be realized concretely as the subalgebra of $C([0,1],M_2(\mathbb{C}))$ containing those matrix-valued functions which are diagonal on the endpoints $0$ and $1$. See <a href="http://www.mscand.dk/article.php?id=1231" rel="nofollow">this paper</a> of Raeburn and Sinclair.</p> <p>So why do I think that a general solution is impossible? Consider the word problem for groups: <a href="http://projecteuclid.org/DPubS?verb=Display&amp;version=1.0&amp;service=UI&amp;handle=euclid.ijm/1256044631&amp;page=record" rel="nofollow">there are</a> groups given in terms of generators and relations for which there is no algorithm that can decide whether a given word in the generators represents the unit element. Now we can look at the maximal group C*-algebra of such a group. This C*-algebra is itself given by the same generators and relations together with additional relations requiring the generators to be unitary. If your intended meaning of a "concrete representation" comprises the existence of an algorithm that decides whether a given formal combination of generators represents $0$, then it follows that such a concrete representation cannot exist.</p> http://mathoverflow.net/questions/108851/graphs-with-independence-number-shannon-capacity graphs with independence number = Shannon capacity Tobias Fritz 2012-10-04T19:31:38Z 2012-12-18T08:31:34Z <p>For $G$ a graph, let $\alpha(G)$ be its independence number and $\Theta(G)=\lim_n \sqrt[n]{\alpha(G^{\boxtimes})}$ its <a href="http://en.wikipedia.org/wiki/Lov%C3%A1sz_number#Shannon_capacity_of_a_graph" rel="nofollow">Shannon capacity</a>, where $\boxtimes$ denotes <a href="http://en.wikipedia.org/wiki/Strong_graph_product" rel="nofollow">strong product</a>.</p> <p>Consider graphs $G$ and $H$ satisfying $\alpha(G)=\Theta(G)$ and $\alpha(H)=\Theta(H)$. For example, $G$ and $H$ could be perfect, but the more interesting situations arise when neither of them is perfect.</p> <p><strong>Question:</strong> Does this assumption imply<br> (1) $\alpha(G\boxtimes H) = \alpha(G)\alpha(H)$ ?<br> (2) $\Theta(G\boxtimes H) = \Theta(G)\Theta(H)$ ?<br> (3) $\Theta(G + H) = \Theta(G) + \Theta(H)$ ? </p> <p>Here, $G+H$ stands for the disjoint union of $G$ and $H$.</p> <p>If my reasoning is correct, then (1) and (2) are equivalent and imply (3).</p> <p>As far as I can see, neither the work of <a href="http://ieeexplore.ieee.org/xpl/login.jsp?tp=&amp;arnumber=1056027&amp;url=http%3A%2F%2Fieeexplore.ieee.org%2Fxpls%2Fabs_all.jsp%3Farnumber%3D1056027" rel="nofollow">Haemers</a> nor the results of <a href="http://www.cs.umd.edu/~gasarch/const_ramsey/alon98.pdf" rel="nofollow">Alon</a> have anything directly to say about these questions. But then again, I am not an expert on this, so I might have missed something obvious.</p> <p><em>Edit</em> (see Will Traves' answer): Actually, I am specifically interested in those $G$ and $H$ which are <a href="http://en.wikipedia.org/wiki/Well-covered_graph" rel="nofollow">well-covered</a>.</p> <p><em>Edit</em>: The paper is <a href="http://arxiv.org/abs/1212.4084" rel="nofollow">here</a>.</p> http://mathoverflow.net/questions/114589/upper-bound-on-shannon-capacity-based-on-independence-number/114608#114608 Answer by Tobias Fritz for Upper bound on Shannon capacity based on independence number Tobias Fritz 2012-11-26T23:51:33Z 2012-11-26T23:51:33Z <p>An inequality as simple as $\Theta(G)\leq \alpha(G)+1$ can certainly not hold for all $G$: take some $G$ with $\Theta(G)>\alpha(G)$ and consider the disjoint union $G+G$. Since $\alpha$ is additive under disjoint union while $\Theta$ is superadditive, this $G+G$ will have a gap between $\Theta$ and $\alpha$ which is at least twice as big as $G$'s. Now repeat this process if necessary.</p> <p><a href="http://arxiv.org/abs/cs/0608021" rel="nofollow">This paper</a> of Alon and Lubetzky seems highly relevant. After proving several negative results (which I don't fully grasp), they conjecture that $$\Theta(G) \leq 2\max_{k=1,\ldots,|G|} \sqrt[k]{\alpha(G^k)} ,$$ where $|G|$ is the number of vertices.</p> http://mathoverflow.net/questions/111200/skew-fraction-fields-of-algebras/111216#111216 Answer by Tobias Fritz for Skew fraction fields of *-algebras Tobias Fritz 2012-11-01T21:28:23Z 2012-11-03T20:21:04Z <p>If I'm not mistaken, it follows immediately from abstract nonsense that the $*$-operation extends uniquely from $R$ to the field of fractions.</p> <p>The notion of <a href="http://en.wikipedia.org/wiki/Localization_of_a_ring" rel="nofollow">localization</a> is more general than that of field of fractions, and hence it is sufficient to prove that if $S\subseteq R$ is any set with <code>$S^*=S$</code>, then $RS^{-1}$ inherits a unique $*$-operation.</p> <p>But this is an immediate consequence of the universal property of $RS^{-1}$: the <code>$*$</code>-operation is a homomorphism $R^{op}\to R$, which can be composed with $R\to RS^{-1}$ to give $R^{op}\to RS^{-1}$. By <code>$S^*=S$</code>, this homomorphism maps every element of $S$ to an invertible element, and hence this induces <code>$*:(RS^{-1})^{op}\to RS^{-1}$</code> which is compatible with the original <code>$*:R\to R$</code>. In particular, this compatibility guarantees also that the extended <code>$*$</code>-operation is antilinear.</p> <p>The universal property should also guarantee that the extended <code>$*$</code> is an involution as well.</p> <p><em>Edit (see comments)</em>: The following is a proof sketch showing that $(RS^{-1})^{op}$ and $R^{op}S^{-1}$ are canonically isomorphic.</p> <p>I think the easiest way to see this is to show that $(RS^{-1})^{op}$ has the universal property of $R^{op}S^{-1}$, i.e. that the canonical morphism $R^{op}\to (RS^{-1})^{op}$, which is defined simply as the opposite of $R\to RS^{-1}$, is the universal morphism with domain $R^{op}$ which maps $S$ to invertibles.</p> <p>To see this, consider any $R^{op}\to T$ which maps $S$ to invertibles. Then its opposite $R\to T^{op}$ also maps $S$ to invertibles, and hence factors through $RS^{-1} \to T^{op}$. Taking opposites again gives the desired $(RS^{-1})^{op}\to T$.</p> http://mathoverflow.net/questions/109489/making-a-graph-well-covered-without-changing-its-shannon-capacity making a graph well-covered without changing its Shannon capacity Tobias Fritz 2012-10-12T20:17:00Z 2012-10-12T20:17:00Z <p>This strongly relates to <a href="http://mathoverflow.net/questions/108851/graphs-with-independence-number-shannon-capacity" rel="nofollow">an earlier question</a> of mine.</p> <p>Let $G$ be a graph, $\alpha(G)$ its independence number and $\Theta(G)$ its Shannon capacity.</p> <p><strong>Question:</strong> can one 'add new vertices' to $G$ such that $G\subseteq G'$ becomes an induced subgraph of some <a href="http://en.wikipedia.org/wiki/Well-covered_graph" rel="nofollow">well-covered</a> $G'$ with $\alpha(G')=\alpha(G)$ and $\Theta(G') = \Theta(G)$?</p> <p>If so, this would be a way to 'uniformize' a graph without changing its Shannon capacity. Has anyone considered this question before?</p> <p>Thanks!</p> http://mathoverflow.net/questions/128260/tannaka-duality-for-c-algebras/128280#128280 Comment by Tobias Fritz Tobias Fritz 2013-04-21T21:15:54Z 2013-04-21T21:15:54Z Thanks for this, that's a good start. Those Yoneda lemma applications are incredibly sneaky! http://mathoverflow.net/questions/121390/semirings-where-solving-linear-systems-is-in-p Comment by Tobias Fritz Tobias Fritz 2013-02-10T21:51:32Z 2013-02-10T21:51:32Z What do you mean exactly by &quot;solving&quot; a linear system? Deciding whether it has a solution? Interesting semirings are $\mathbb{R}_{\geq 0}$ and $\mathbb{Q}_{\geq 0}$, over which deciding whether a solution exists is linear programming and hence in $P$. On the other hand, finding a minimal set of generating solutions such that every other solution is a linear combination of the given ones is very difficult (vertex enumeration problem, e.g. for polytopes). http://mathoverflow.net/questions/120128/realizing-universal-c-algebras-as-concrete-c-algebras/120130#120130 Comment by Tobias Fritz Tobias Fritz 2013-01-28T21:38:38Z 2013-01-28T21:38:38Z @Benjamin: you certainly know this, but just to make things clear: the universal representation is the direct sum of the GNS representations associated to all states. In particular, it is also a faithful representation on a Hilbert space, just like the left regular rep. I agree that the latter is much more &quot;concrete&quot; than the universal rep, but the difference seems to lie in how explicit the rep itself and its underlying Hilbert space are defined. My (possibly naive) idea was to try and make the notion of concreteness precise by relating it to decidability. http://mathoverflow.net/questions/120128/realizing-universal-c-algebras-as-concrete-c-algebras/120130#120130 Comment by Tobias Fritz Tobias Fritz 2013-01-28T19:37:30Z 2013-01-28T19:37:30Z @Benjamin: the reduced C*-algebra of a discrete group coincides with the universal one if and only if the group is amenable. And yes, there are amenable groups with undecidable word problem! (Kharlampovich constructed a solvable fp group with undecidable wp.) Hence my question about what the OP exactly means by &quot;concrete&quot;: if it entails decidability, then the answer to the OP's main question is negative. On the other hand, if e.g. the left regular representation of a group still counts as concrete, then why not regard the universal representation as concrete as well? http://mathoverflow.net/questions/120128/realizing-universal-c-algebras-as-concrete-c-algebras/120130#120130 Comment by Tobias Fritz Tobias Fritz 2013-01-28T18:46:47Z 2013-01-28T18:46:47Z @Nik: thanks, I just clarified this. I haven't thought about the non-unital case. http://mathoverflow.net/questions/119641/geometric-picture-of-scalar-curvature Comment by Tobias Fritz Tobias Fritz 2013-01-28T03:54:26Z 2013-01-28T03:54:26Z If you're willing to consider pseudo-Riemannian manifolds as well, then any solution to the Einstein field equations of general relativity will give you a perfectly nice example of a Ricci-flat manifold. Many of these, for example the Schwarzschild or Kerr solutions, are not flat. http://mathoverflow.net/questions/119953/definition-of-area/119955#119955 Comment by Tobias Fritz Tobias Fritz 2013-01-27T02:21:48Z 2013-01-27T02:21:48Z See also geometric measure theory and Hadwiger's theorem, which is very nicely explained in a series of posts on the n-Category Caf&#233; starting here: golem.ph.utexas.edu/category/2011/06/hadwigers_theorem_part_1.html http://mathoverflow.net/questions/118903/elementary-applications-of-linear-algebra-over-finite-fields/118904#118904 Comment by Tobias Fritz Tobias Fritz 2013-01-14T23:48:23Z 2013-01-14T23:48:23Z A neat application of linear codes also arises in network coding: <a href="http://en.wikipedia.org/wiki/Network_coding#The_butterfly_network_example" rel="nofollow">en.wikipedia.org/wiki/&hellip;</a> http://mathoverflow.net/questions/117660/sufficient-condition-for-a-matrix-to-be-hermitian Comment by Tobias Fritz Tobias Fritz 2012-12-30T19:27:11Z 2012-12-30T19:27:11Z duplicate: <a href="http://mathoverflow.net/questions/115421/why-do-we-need-to-specify-to-symmetric-matrix-when-defining-real-positive-definit" rel="nofollow" title="why do we need to specify to symmetric matrix when defining real positive definit">mathoverflow.net/questions/115421/&hellip;</a> http://mathoverflow.net/questions/117494/math-for-a-cake/117501#117501 Comment by Tobias Fritz Tobias Fritz 2012-12-29T20:12:15Z 2012-12-29T20:12:15Z Yes, if I recall correctly, this one can also be admired on the glass front of the MPIM's reception desk. http://mathoverflow.net/questions/117185/direct-proof-that-a-group-is-hopfian Comment by Tobias Fritz Tobias Fritz 2012-12-25T08:22:53Z 2012-12-25T08:22:53Z Is a free product of Hopfian groups again Hopfian? http://mathoverflow.net/questions/108851/graphs-with-independence-number-shannon-capacity Comment by Tobias Fritz Tobias Fritz 2012-12-12T18:22:27Z 2012-12-12T18:22:27Z @Graphth: thanks a bunch, that's very helpful! We didn't know about that paper of Haemers. It will take us some time now to revise our paper now that we have this new information. Leave me a PM if we can use your real name in the acknowledgments. http://mathoverflow.net/questions/115799/factoring-objects-in-a-category Comment by Tobias Fritz Tobias Fritz 2012-12-10T18:24:03Z 2012-12-10T18:24:03Z What do you mean by factoring in Groupoids? Are you referring to the category of groupoids or about your $\mathcal{C}$ being a groupoid? I assume that you don't mean the latter, because the only groupoids that have products are the empty one and those equivalent to the trivial group... Also, your question may need to make a bit more precise. Even with fixed $\mathcal{C}$, the answer may depend on how you represent the objects as data structures. In many cases, even isomorphism is not decidable, e.g. in the category of finitely presented groups when a group is given in terms of a presentation. http://mathoverflow.net/questions/108851/graphs-with-independence-number-shannon-capacity Comment by Tobias Fritz Tobias Fritz 2012-12-08T17:32:57Z 2012-12-08T17:32:57Z One can also ask whether $\alpha(G)=\Theta(G)$ implies $\alpha(G)=\vartheta(G)$; if this is true, then the other conjectures immediately follow from the basic properties of the Lov&#225;sz number $\vartheta$. Alas, we haven't been able to answer any of these four questions yet; but since our work lies mainly in relating these questions to problems in the mathematical foundations of quantum mechanics, we also haven't tried really hard. Our paper should be on the arXiv within a few days; I will announce it here. http://mathoverflow.net/questions/115799/factoring-objects-in-a-category Comment by Tobias Fritz Tobias Fritz 2012-12-08T15:35:34Z 2012-12-08T15:35:34Z A brief search reveals this, which might be of relevance: <a href="https://research.microsoft.com/pubs/102435/groupfactoring.pdf" rel="nofollow">research.microsoft.com/pubs/102435/&hellip;</a>