Formal proofs of operator identities by a single formal computation

A formal computation proving a new operator identity from known ones is, in principle, restricted by domains and codomains of linear operators involved, since not any two operators can be added or composed. Algebraically, identities can be modelled by noncommutative polynomials and such a formal computation proves that the polynomial corresponding to the new identity lies in the ideal generated by the polynomials corresponding to the known identities. In order to prove an operator identity, however, just proving membership of the polynomial in the ideal is not enough, since the ring of noncommutative polynomials ignores domains and codomains. We show that it suffices to additionally verify compatibility of this polynomial and of the generators of the ideal with the labelled quiver that encodes which polynomials can be realized as linear operators. Then, for every consistent representation of such a quiver in a linear category, there exists a computation in the category that proves the corresponding instance of the identity. Moreover, by assigning the same label to several edges of the quiver, the algebraic framework developed allows to model different versions of an operator by the same indeterminate in the noncommutative polynomials.     

Synthesis and Reactivity of the First Isolated Hydrogen‐Bridged Silanol–Silanolate Anions

We report on the first examples of isolated silanol–silanolate anions, obtained by utilizing weakly coordinating phosphazenium counterions. The silanolate anions were synthesized from the recently published phosphazenium hydroxide hydrate salt with siloxanes. The silanol–silanolate anions are postulated intermediates in the hydroxide‐mediated polymerization of aryl and alkyl siloxanes. The silanolate anions are strong nucleophiles because of the weakly coordinating character of the phosphazenium cation, which is perceptible in their activity in polysiloxane depolymerization.     

Absolutely indecomposable symmetric matrices

Let A be a symmetric matrix of size n×n with entries in some (commutative) field K. We study the possibility of decomposing A into two blocks by conjugation by an orthogonal matrix T∈Mat_n(K). We say that A is absolutely indecomposable if it is indecomposable over every extension of the base field. If K is formally real then every symmetric matrix A diagonalizes orthogonally over the real closure of K. Assume that K is a not formally real and of level s. We prove that in Mat_n(K) there exist symmetric, absolutely indecomposable matrices iff n is congruent to 0, 1 or −1 modulo 2s.     

Über die Einwirkung von Ammoniak auf Anthragallol

Ohne ZusammenfassungDiese Untersuchung ist vor mehr als Jahresfrist infolge Eintrittes in die chemische Praxis abgebrochen worden. Äussere Verhältnisse machen die Vollendung der begonnenen Versuche auch weiterhin unmöglich und sehe ich mich desshalb veranlasst, meine Beobachtungen zu veröffentlichen.     

On the continuation for variational inequalities depending on an eigenvalue parameter

In this paper we generalize recent theoretical results on the local continuation of parameter-dependent non-linear variational inequalities. The variational inequalities are rather general and describe, for example, the buckling of beams, plates or shells subject to obstacles. Under a technical hypothesis that is satisfied by the simply supported beam, we obtain the existence of a continuation of both the solution and the eigenvalue with respect to a local parameter. A numerical continuation method is presented that easily overcomes turning points. Numerical results are presented for the non-linear beam.     

On a compromise social choice correspondence

This paper analyzes the compromise social choice correspondence derived from the τ-value of digraph games. Monotonicity of this correspondence is shown. A connection between several properties of social choice correspondences based on game theoretical solutions and game theoretical properties of the underlying solutions is given. Applications to several game theoretic solutions are provided.