Uniform Computability of Isotypic Block Diagonalization for Finite-Group Representations

Konrad Burnik

Home/Archive/arXiv

arXiv · 2610.02547

Uniform Computability of Isotypic Block Diagonalization for Finite-Group Representations

Konrad Burnik

View original source ↗Read source document ↗Export metadata ↓

Abstract

We study the universal isotypic block-diagonalization problem in the Type-2 theory of effectivity (TTE). We obtain a uniform computability result for the universal block diagonalizer for commutants of given finite group representations. As an application, when the given representation is orthogonal, we compute ordinary $QR$ factorizations blockwise in the isotypic basis. After transforming back to the original coordinates this yields a factorization $A=QX$, where $Q$ is orthogonal and $X$ is generally not upper triangular. Moreover, given a Wedderburn-adapted orthogonal basis, the transformed-back factors can be computed within the commutant.

Explore related subjects

math.LO cs.NA math.NA math.RT

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Konrad Burnik. 2026-10-01. Uniform Computability of Isotypic Block Diagonalization for Finite-Group Representations. https://arxiv.org/abs/2610.02547

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Certain ideals in Autometrized Lattice Ordered Monoids

This paper introduces the concept of metric ideals in AL-monoids. We also examine the structure of AL-monoids and describe some of the properties of homomorphism and fundamentalisomorphism theorems.Additionaly we introduce and examine a direct product and subdirect products in AL-monoids.

math.LO↗

arXiv2026

On a slight weakening of Kripke-Platek Set Theory

The weak set theory $\mathsf{ReR}$ is obtained from Kripke-Platek Set Theory ($\mathsf{KP}$) by replacing the bounded collection scheme with the bounded replacement scheme. We show that $\mathsf{ReR}$ proves $\mathsf{TCo}$, which asserts that every set is contained in a transitive set. This is used to show that the theories obtained by adding the negation of the axiom of infinity to $\mathsf{ReR}$ and $\mathsf{KP}$ have the same consequences. Our proof of $\mathsf{TCo}$ relies on the availability of a fragment of class foundation in $\mathsf{ReR}$. To demonstrate the necessity of this reliance, even in the presence of infinity, we build a model of a significant fragment of $\mathsf{ZF}$ that includes bounded separation and collection, infinity, powerset, regularity and the axiom of choice, in which $\mathsf{TCo}$ fails.

math.LO↗

arXiv2026

Scott products and sobriety of countable meet-continuous dcpos

We study Scott-product compatibility and sobriety for countable meet-continuous directed-complete partial orders (dcpos). We construct a countable meet-continuous dcpo $\mathcal R$ whose Scott space is well-filtered but not sober, although the Scott topology on every finite power is the product of the factor Scott topologies. The ideals of $\mathcal R$ admit a unique finite-parameter description. We also construct a countable meet-continuous dcpo $\mathbb{H}$ with a greatest element whose Scott space is coherent and well-filtered, but whose Scott square has a topology strictly finer than the ordinary product topology. These constructions answer negatively two questions about countable meet-continuous dcpos. On the positive side, we prove that a meet-continuous $L$-dcpo, meaning a dcpo whose principal ideals are complete lattices, is Scott sober whenever its Scott square carries the ordinary product topology. This answers Jia's core-compactness question affirmatively for $L$-dcpos without any countability assumption. Finally, we characterize well-filteredness of $L$-dcpos by boundedness of closed Rudin sets and formulate related open questions.

math.LO↗