Representations of first order function types as terminal coalgebras

Cosmic rays provide an important source for free electrons in Earth's atmosphere and also in dense interstellar regions where they produce a prevailing background ionization. We utilize a Monte Carlo cosmic ray transport model for particle energies of 10(6) eV <E <10(9) eV, and an analytic cosmic ray transport model for particle energies of 10(9) eV <E <10(12) eV in order to investigate the cosmic ray enhancement of free electrons in substellar atmospheres of free-floating objects. The cosmic ray calculations are applied to Drift-Phoenix model atmospheres of an example brown dwarf with effective temperature T-eff = 1500 K, and two example giant gas planets (T-eff = 1000 K, 1500 K). For the model brown dwarf atmosphere, the electron fraction is enhanced significantly by cosmic rays when the pressure p(gas) <10(-2) bar. Our example giant gas planet atmosphere suggests that the cosmic ray enhancement extends to 10(-4)-10(-2) bar, depending on the effective temperature. For the model atmosphere of the example giant gas planet considered here (T-eff = 1000 K), cosmic rays bring the degree of ionization to f(e) greater than or similar to 10(-8) when p(gas) <10(-8) bar, suggesting that this part of the atmosphere may behave as a weakly ionized plasma. Although cosmic rays enhance the degree of ionization by over three orders of magnitude in the upper atmosphere, the effect is not likely to be significant enough for sustained coupling of the magnetic field to the gas.Publisher PDFPeer reviewe

Representations of stream processors using nested fixed points

We define representations of continuous functions on infinite streams of discrete values, both in the case of discrete-valued functions, and in the case of stream-valued functions. We define also an operation on the representations of two continuous functions between streams that yields a representation of their composite. In the case of discrete-valued functions, the representatives are well-founded (finite-path) trees of a certain kind. The underlying idea can be traced back to Brouwer's justification of bar-induction, or to Kreisel and Troelstra's elimination of choice-sequences. In the case of stream-valued functions, the representatives are non-wellfounded trees pieced together in a coinductive fashion from well-founded trees. The definition requires an alternating fixpoint construction of some ubiquity

Decomposition spaces in combinatorics

A decomposition space (also called unital 2-Segal space) is a simplicial object satisfying an exactness condition weaker than the Segal condition: just as the Segal condition expresses (up to homotopy) composition, the new condition expresses decomposition. It is a general framework for incidence (co)algebras. In the present contribution, after establishing a formula for the section coefficients, we survey a large supply of examples, emphasising the notion's firm roots in classical combinatorics. The first batch of examples, similar to binomial posets, serves to illustrate two key points: (1) the incidence algebra in question is realised directly from a decomposition space, without a reduction step, and reductions are often given by CULF functors; (2) at the objective level, the convolution algebra is a monoidal structure of species. Specifically, we encounter the usual Cauchy product of species, the shuffle product of L-species, the Dirichlet product of arithmetic species, the Joyal-Street external product of q-species and the Morrison `Cauchy' product of q-species, and in each case a power series representation results from taking cardinality. The external product of q-species exemplifies the fact that Waldhausen's S-construction on an abelian category is a decomposition space, yielding Hall algebras. The next class of examples includes Schmitt's chromatic Hopf algebra, the Fa\`a di Bruno bialgebra, the Butcher-Connes-Kreimer Hopf algebra of trees and several variations from operad theory. Similar structures on posets and directed graphs exemplify a general construction of decomposition spaces from directed restriction species. We finish by computing the M\Preprin

The fundamental pro-groupoid of an affine 2-scheme

A natural question in the theory of Tannakian categories is: What if you don't remember \Forget? Working over an arbitrary commutative ring $R$, we prove that an answer to this question is given by the functor represented by the \'etale fundamental groupoid \pi_1(\spec(R)), i.e.\ the separable absolute Galois group of $R$ when it is a field. This gives a new definition for \'etale \pi_1(\spec(R)) in terms of the category of $R$-modules rather than the category of \'etale covers. More generally, we introduce a new notion of "commutative 2-ring" that includes both Grothendieck topoi and symmetric monoidal categories of modules, and define a notion of $\pi_1$ for the corresponding "affine 2-schemes." These results help to simplify and clarify some of the peculiarities of the \'etale fundamental group. For example, \'etale fundamental groups are not "true" groups but only profinite groups, and one cannot hope to recover more: the "Tannakian" functor represented by the \'etale fundamental group of a scheme preserves finite products but not all products.Comment: 46 pages + bibliography. Diagrams drawn in Tik

Monoidal computer III: A coalgebraic view of computability and complexity

Monoidal computer is a categorical model of intensional computation, where many different programs correspond to the same input-output behavior. The upshot of yet another model of computation is that a categorical formalism should provide a much needed high level language for theory of computation, flexible enough to allow abstracting away the low level implementation details when they are irrelevant, or taking them into account when they are genuinely needed. A salient feature of the approach through monoidal categories is the formal graphical language of string diagrams, which supports visual reasoning about programs and computations. In the present paper, we provide a coalgebraic characterization of monoidal computer. It turns out that the availability of interpreters and specializers, that make a monoidal category into a monoidal computer, is equivalent with the existence of a *universal state space*, that carries a weakly final state machine for any pair of input and output types. Being able to program state machines in monoidal computers allows us to represent Turing machines, to capture their execution, count their steps, as well as, e.g., the memory cells that they use. The coalgebraic view of monoidal computer thus provides a convenient diagrammatic language for studying computability and complexity.Comment: 34 pages, 24 figures; in this version: added the Appendi