# Techniques: Categories of sets with infinite addition

## What the paper contributes (one paragraph)
This is a pure category-theory and abstract-algebra paper on Sigma-monoids, that is sets equipped with a partial infinite-addition operation. It makes three foundational contributions. First, it gives a "weak" Sigma-monoid definition that subsumes earlier definitions from the literature, admits additive inverses, and relates the resulting categories through adjunctions. Second, it shows that every Hausdorff commutative monoid is a Sigma-monoid and that the forgetful functor has a left adjoint, giving a free Hausdorff commutative monoid for each Sigma-monoid. Third, it proves that Sigma-monoids, unlike topological abelian groups, have well-defined tensor products, so categories can be enriched over them. The stated motivation is to extend categorical semantics of iteration to quantum programs, where control-flow paths can carry complex (hence invertible) coefficients and parallel composition is the tensor product, supporting a semantics of quantum while loops.

## Techniques offered
- **Categorical semantics for quantum iteration (Sigma-monoid enrichment)** - Provides an algebraic framework (generalised Sigma-monoids with tensor products and inverses) for enriching categories so that hom-objects support infinite sums of morphisms, intended as semantics for quantum control flow and while loops.
  - guarantee: static proof; the tensor product of two Hausdorff commutative monoids is shown to be a Sigma-monoid, enabling well-defined enrichment, but no operational or numerical assurance about any quantum program is supplied.
  - quote: "This work originates from the effort to extend the categorical semantics of iteration from Manes and Arbib~\cite{ManesArbib} to quantum programs."

## Where it could apply
- Target primitive(s): none
- Target application group(s): platforms_tooling (only as upstream denotational-semantics foundations; not a runnable capability)

## Caveats
This is a foundational pure-mathematics paper (category theory and abstract algebra). It supplies no technique that can be applied to an external vendor result or quantum hardware or application output: there is no accreditation, decoding, error mitigation, compilation, benchmarking, resource estimation, simulation, or algorithm runnable against a quantum device. The quantum connection is motivational only, providing denotational semantics for quantum while loops in the first author's dissertation. The single bullet above is a best-fit framing of that motivation, not a suppliable capability; for the purpose of the pathfinder matrix this paper is effectively a non-supply.