Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

Representation Theory

83 missions · 34 completed

Missions

Open49Completed34All83
AlgebraQuantum Information·Captain: mikedeng1

Structure and Properties of the Algebra of Partially Transposed Permutation Operators: A = M ⊕ S, M = ⊕ U(α) with U(α) ≅ M(rank Q(α), ℂ), and S ≅ ⊕_{h(ν)<d} M(dim ψ^ν, ℂ)Research Paper

Permutation operators encode the symmetries of many identical quantum systems. When one tensor factor is transposed, the resulting operators occur in questions about the commutant of mixed tensor representations and about partially transposed quantum states. The usual symmetric-group algebra no longer describes their multiplication: a product can acquire a…

10 thms3 active usersReviewed
CombinatoricsQuantum Information·Captain: mikedeng1

Optimal Quantum Purity Amplification: Removing the Bottom Box of the Last Column of Each Schur-Sampled Young Diagram Gives the Optimal Choi Matrix for Purifying n Depolarized QuditsResearch Paper

Quantum devices rarely prepare the state they are asked for. A procedure meant to output a pure state ∣ψ⟩|\psi\rangle∣ψ⟩ on ddd levels often outputs a mixed state ρ\rhoρ, the result of noise during preparation. If the procedure can be run nnn times, the copies ρ⊗n\rho^{\otimes n}ρ⊗n can be processed jointly into a single output closer to ∣ψ⟩|\psi\rangle∣ψ⟩. This task is quantum…

15 thms3 active usersReviewed
Algebra·Captain: mikedeng1

Cyclotomic Birman–Wenzl–Murakami Algebras, II: Admissibility Relations and Freeness: Over an Admissible Integral Domain S, W_{n,S,r} Is a Free S-Module of Rank r^n(2n−1)!!Research Paper

The cyclotomic Birman–Wenzl–Murakami algebra is an algebra of braids and contractions equipped with an additional cyclotomic relation. It connects diagram algebras, representation theory, and knot theoretic constructions. For calculations over a coefficient ring, one needs to know whether the diagrammatic spanning elements remain independent after…

16 thms3 active usersReviewed
AlgebraCombinatorics·Captain: mikedeng1

Representations of Temperley–Lieb Algebras: Closed Product Formula for the Gram Determinants of the Cell ModulesResearch Paper

The Temperley–Lieb algebra is a family of algebras built from generators that satisfy local relations. It appears in diagrammatic representation theory and provides a tractable setting in which to study cellular bases and Gram determinants. A Gram determinant tests whether the bilinear form on a module is degenerate after specializing its parameter. Thus an…

18 thms3 active usersReviewed
Mathematical PhysicsQuantum Information·Captain: mikedeng1

SU(2)-Irreducibly Covariant and EPOSIC Channels: EPOSIC Channels Are Exactly the Extreme Points of the Convex Set of SU(2)-Irreducibly Covariant ChannelsResearch Paper

A quantum channel is a completely positive, trace-preserving linear map between matrix algebras; it models the most general physical transformation of a quantum system. When a group GGG acts on the input and output systems, a channel is GGG-covariant if it commutes with the group action. Covariant channels appear whenever a physical process respects a symmetry:…

17 thms3 active usersReviewed
Linear algebraQuantum Information·Captain: mikedeng1

Commutant Structure of U⊗(n−1) ⊗ U* Transformations: The Operator Basis v^{ab}_{ij}(α) Is a Linear Combination of Partially Transposed Permutation Operators, and ConverselyResearch Paper

Operators on nnn copies of Cd\mathbb C^dCd that commute with every U⊗nU^{\otimes n}U⊗n, UUU unitary, are exactly the linear combinations of permutation operators V(σ)V(\sigma)V(σ), σ∈S(n)\sigma\in S(n)σ∈S(n) (Schur–Weyl duality). Many protocols in quantum information carry a different symmetry: the first n−1n-1n−1 systems transform by UUU and the last by the complex conjugate Uˉ\bar UUˉ. It is the…

11 thms3 active usersReviewed
Mathematical Physics·Captain: mikedeng1

Branes, Anti-Branes and Brauer Algebras in Gauge-Gravity duality: Symmetric Brauer Branching Operators Diagonalise the Two-Matrix Quantum-Mechanical Inner ProductResearch Paper

Operators made from a complex matrix and its conjugate occur in the non-chiral sector of gauge theories. Their correlation functions involve many possible pairings of matrix entries, and those pairings become difficult to organize as the number of entries grows. Kimura and Ramgoolam use the walled Brauer algebra to label these operators and to describe…

10 thms3 active usersReviewed
🏆Completed
Probability·Captain: marwahaha

Signed tensor densities and diagram budgets for the Thorp shuffleOpen Problem

Signed tensor components separate different sources of permutation symmetry. The source uses their diagram entropies to budget high moments of the Thorp sweep. The source is OpenAI's September 2026 manuscript.

17 thms3 active usersReviewed
🏆Completed
Combinatorics·Captain: marwahaha

Compatibility entropy and the spectrum of a Thorp sweepOpen Problem

Compatibility of independently chosen row and column permutations controls how two families of local symmetries overlap. The source connects a weighted compatibility estimate to Thorp spectral bounds. The source is OpenAI's September 2026 manuscript.

31 thms3 active usersReviewed
🏆Completed
CombinatoricsGraph TheoryGroup Theory+1·Captain: mikedeng1

λ1, Isoperimetric Inequalities for Graphs, and Superconcentrators 2: Cayley Graphs of Finite Quotients of a Property (T) Group Are Linear EnlargersResearch Paper

An expander is a sparse graph in which every set of vertices has many neighbours outside itself. Expanders are the building blocks of superconcentrators (sparse directed graphs that route any rrr inputs to any rrr outputs along vertex-disjoint paths), of sorting and switching networks, and of many constructions in complexity theory and coding; the survey of…

12 thms3 active usersReviewed
Group TheoryQuantum Information·Captain: mikedeng1

(Almost) quadruply optimal unitary designs in 1DResearch Paper

Random unitary operations are used in quantum benchmarking, learning and information processing. A generic Haar-random operation on n qubits requires an exponential number of elementary gates. A unitary design replaces that full distribution by an implementable ensemble whose low-order moments reproduce Haar randomness to a specified accuracy. The resource…

43 thms2 active usersReviewed
CombinatoricsInformation TheoryTheoretical Computer Science·Captain: iris

The Honeycomb Framework for Code BoundsResearch Paper

A binary code of length nnn is a set C⊆{±1}nC\subseteq\{\pm1\}^nC⊆{±1}n; it has minimum distance at least ddd if any two distinct codewords differ in at least ddd coordinates. The rate–distance tradeoff asks for the largest size A2(n,d)A_2(n,d)A2​(n,d) of such a code, and asymptotically for

45 thms2 active usersReviewed
Group TheoryQuantum Information·Captain: iris

Depth-111 expanders on the unitary group and applicationsResearch Paper

A quantum expander is a small set of unitaries U1,…,UmU_1,\dots,U_mU1​,…,Um​ on a ddd-dimensional space whose average X↦1m∑iUiXUi†X\mapsto \frac1m\sum_i U_iXU_i^\daggerX↦m1​∑i​Ui​XUi†​ shrinks every traceless matrix by a constant factor. Quantum expanders were introduced to build short quantum one-time pads (Ambainis–Smith 2004), to prove that the quantum entropy-difference problem is QSZK-complete,…

45 thms2 active usersReviewed
Group TheoryMachine Learning·Captain: iris

The State Complexity of Block-Diagonal State Space ModelsResearch Paper

Given a sequence x1,…,xTx_1,\dots,x_Tx1​,…,xT​ of elements of a fixed finite group GGG, a state-tracking model must report the running product xT⋯x1x_T\cdots x_1xT​⋯x1​ after every prefix. The task tests structured memory: the model has to preserve order, retain information for arbitrary sequence lengths, and implement the multiplication law. It also has complexity-theoretic content,…

26 thms2 active usersReviewed
CombinatoricsComplexity TheoryQuantum Information·Captain: iris

On Clifford hierarchy testing and near-extremizers of noncommutative uniformity normsResearch Paper

The Clifford hierarchy of Gottesman and Chuang [GC99] is a nested sequence of gate sets C(1)⊆C(2)⊆C(3)⊆⋯\mathcal C^{(1)}\subseteq\mathcal C^{(2)}\subseteq\mathcal C^{(3)}\subseteq\cdotsC(1)⊆C(2)⊆C(3)⊆⋯ that describes which operations can be implemented by gate teleportation with Clifford gates and magic states. Its first level is the Pauli group, its second the Clifford group, and its…

21 thms2 active usersReviewed
Machine LearningQuantum Information·Captain: iris

Representation Theory for Geometric Quantum Machine Learning: The Commutant of a Unitary Representation Is the Direct Sum of Multiplicity-Space Operators Tensored with the Identity on Each IrrepResearch Paper

Geometric quantum machine learning builds the symmetries of a learning task into a quantum model. A parametrized circuit is made equivariant when it commutes with a representation of the symmetry group, and a measurement is made invariant in the same way. The tutorial of Ragone et al., Representation Theory for Geometric Quantum Machine Learning, organizes…

22 thms2 active usersReviewed
Combinatorics·Captain: iris

New versions of Schur-Weyl duality: GLn\mathrm{GL}_nGLn​ and the deranged algebra eBr,r(n)eeB^{(n)}_{r,r}eeBr,r(n)​e are mutual centralizers on sln⊗r\mathfrak{sl}_n^{\otimes r}sln⊗r​ for n≥2rn \ge 2rn≥2rResearch Paper

Schur-Weyl duality says that on V⊗rV^{\otimes r}V⊗r, with V=CnV=\mathbb C^nV=Cn, the general linear group and the symmetric group span each other's commutants. It is the standard route from the representation theory of Sr\mathfrak S_rSr​ to that of GLn\mathrm{GL}_nGLn​. Brauer extended it to orthogonal and symplectic groups, and Benkart, Chakrabarti, Halverson, Leduc, Lee and…

30 thms2 active usersReviewed
🏆Completed
Quantum Information·Captain: iris

Decoherence, Control, and Symmetry in Quantum Computers IX: the exchange interaction alone acts as su(nJ)\mathfrak{su}(n_J)su(nJ​) independently on every strong collective decoherence DFSTextbook

A quantum computer whose qubits sit close together is often disturbed by noise that couples to all of them in the same way. This is collective decoherence. When the noise can rotate the joint spin of the register about any axis, it is strong collective decoherence. Information stored in the degeneracy of the joint spin is then untouched by the noise. This…

22 thms2 active usersReviewed
🏆Completed
Quantum Information·Captain: iris

Decoherence, Control, and Symmetry in Quantum Computers III: the inductive subsystem lemma: a connected graph of computationally connected subsystems densely generates SU(∏idi)SU(\prod_i d_i)SU(∏i​di​)Textbook

A quantum computer is built from a fixed, usually finite, repertoire of gates: unitary operations that the hardware can apply to one or two of its physical subsystems. Whether such a repertoire is universal, meaning that sequences of its gates approximate every unitary evolution of the whole register, decides whether the hardware can run arbitrary quantum…

7 thms2 active usersReviewed
AnalysisQuantum Information·Captain: mikedeng1

The Rate of Optimal Purification procedures: At Output Rate M/N → μ the Optimal All-Qubit Fidelity Tends to 2λ²/(2λ²+μ(1−λ)) for μ ≤ λ and 2λ²/(μ(1+λ)) for μ ≥ λResearch Paper

A qubit stored or transmitted in the presence of noise loses purity. If many copies of the same unknown pure state σ=∣φ⟩⟨φ∣\sigma = |\varphi\rangle\langle\varphi|σ=∣φ⟩⟨φ∣ have each passed through the same noisy channel, one may try to undo the noise collectively: feed the NNN noisy copies into a quantum device and ask for MMM output qubits that are as close as possible to MMM per…

14 thms2 active usersReviewed
🏆Completed
Machine LearningMathematical Physics·Captain: mikedeng1

Informing Geometric Deep Learning with Electronic Interactions to Accelerate Quantum Chemistry: The UNiTE Network Is Equivariant Under Local Unitary Changes of BasisResearch Paper

Machine-learned models of molecular energies and properties are trained on the output of quantum-chemistry calculations, and a common way to make them data-efficient is to build the physical symmetries of the problem into the architecture. When the input is not a point cloud but a set of matrices expressed in an atomic-orbital basis (Fock, density, overlap…

9 thms2 active usersReviewed
Functional AnalysisMathematical Physics·Captain: mikedeng1

C*-Algebras and Direct Integral Decomposition for Lie Supergroups: Unitary Representations of a Lie Supergroup and Nondegenerate -Representations of Its C-Algebra Form Isomorphic CategoriesResearch Paper

Unitary representations turn symmetries into operators on Hilbert spaces. For ordinary locally compact groups, the associated group C∗C^*C∗-algebra lets one study these operators through a single algebraic object. A Lie supergroup adds odd infinitesimal symmetries to an ordinary Lie group. Its unitary representations must respect both the group action and those…

8 thms2 active usersReviewed
Mathematical PhysicsQuantum Information·Captain: mikedeng1

Qudit circuits with SU(d) symmetry: Locality imposes additional conservation laws: Tr(Ω[ρ]^l) is conserved by every unitary generated by 2-local SU(d)-invariant gatesResearch Paper

Quantum circuits whose gates respect a global symmetry are a standard model for quantum simulation, for symmetry-protected quantum computing, and for the study of conserved quantities in quantum dynamics. For SU(d) symmetry on nnn qudits, the unitaries that commute with every U⊗nU^{\otimes n}U⊗n are, by Schur–Weyl duality, exactly the unitaries in the linear span…

12 thms2 active usersReviewed
AlgebraCombinatorics·Captain: mikedeng1

Supersymmetric Polynomials and the Center of the Walled Brauer Algebra: When B_{r,s}(δ) Is Semisimple, Supersymmetric Polynomials in the Jucys–Murphy Elements Generate Its CenterResearch Paper

The walled Brauer algebra Br,s(δ)B_{r,s}(\delta)Br,s​(δ) is the centralizer algebra of mixed Schur–Weyl duality: for δ=n\delta=nδ=n it acts on the mixed tensor space V⊗r⊗(V∗)⊗sV^{\otimes r}\otimes (V^*)^{\otimes s}V⊗r⊗(V∗)⊗s of V=CnV=\mathbb C^nV=Cn and commutes with gln\mathfrak{gl}_ngln​, and for δ=m−n\delta=m-nδ=m−n it plays the same role for the general linear supergroup GL(m∣n)GL(m|n)GL(m∣n). Its representation theory has been…

21 thms2 active usersReviewed
Functional AnalysisQuantum Information·Captain: mikedeng1

Characterization of equivariant maps and application to entanglement detection: Unitarily Equivariant t-Positive Maps Detect Every State a Given t-Positive Map DetectsResearch Paper

Positive maps give tests for entanglement in bipartite quantum states. A density matrix can pass one positive-map test and fail another, so the choice of map changes which states can be detected. Maps that behave predictably under unitary changes of basis are particularly structured, but that symmetry can appear restrictive. Bardet, Collins, and Sapra ask…

9 thms2 active usersReviewed
PreviousPage 2 of 4Next

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me