紧群表示的数值分解的证明
Certifying Numerical Decompositions of Compact Group Representations
摘要:
我们提出了一个高性能和严格的算法,证明矩阵是接近于被投影到一个不可约子空间的一个给定的组表示。这解决了一个问题时,一个寻求解决方案的半定计划(SDP)与组对称性。实际上,在这种情况下,如果群作用的不可约表示是明确已知的,则SDP的维数可以显著减小。用于将给定的群表示分解成irrep的严格数值算法是已知的,但是相当昂贵。为了避免这种性能问题,现有的软件包-例如RepLAB,这激励了本工作-使用随机化的算法。虽然这些在实践中似乎运作良好,但出现了结果在多大程度上可以信任的问题。在这里,我们提供严格的保证适用于有限和紧凑的群体,以及软件实现,可以与RepLAB接口。在自然的假设下,Babai和Friedl的一个常用的方法对于n维表示的时间复杂度为O(n^5)。在我们的方法中,运行启发式分解和认证步骤的复杂度是O(max{n^3 log n,D d^2 log d}),其中d是不可约子表示的最大维数,D是将群的元素相乘所需的时间。提供了一个与RepLAB接口的参考实现。
英文摘要:
We present a performant and rigorous algorithm for certifying that a matrix is close to being a projection onto an irreducible subspace of a given group representation. This addresses a problem arising when one seeks solutions to semi-definite programs (SDPs) with a group symmetry. Indeed, in this context, the dimension of the SDP can be significantly reduced if the irreducible representations of the group action are explicitly known. Rigorous numerical algorithms for decomposing a given group representation into irreps are known, but fairly expensive. To avoid this performance problem, existing software packages -- e.g. RepLAB, which motivated the present work -- use randomized heuristics. While these seem to work well in practice, the problem of to which extent the results can be trusted arises. Here, we provide rigorous guarantees applicable to finite and compact groups, as well as a software implementation that can interface with RepLAB. Under natural assumptions, a commonly used previous method due to Babai and Friedl runs in time O(n^5) for n-dimensional representations. In our approach, the complexity of running both the heuristic decomposition and the certification step is O(max{n^3 log n, D d^2 log d}), where d is the maximum dimension of an irreducible subrepresentation, and D is the time required to multiply elements of the group. A reference implementation interfacing with RepLAB is provided.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。