Properties of co-operations: diagrammatic proofs
نویسنده
چکیده
Traditionally, terms together with Sweedler notation are used to express computations in (generalized) bialgebras. Here, an algebra is a vector space equipped with an operation μ : ⊗→ and a bialgebra is an algebra equipped with a co-operation δ : → ⊗ . The operation μ must be (bi)linear and satisfy some properties, for instance associativity and/or commutativity. Similarly, the co-operation δ must be linear and satisfy some co-properties, for instance coassociativity and/or co-commutativity. Furthermore, a compatibility relation between μ and δ must be satisfied for instance the Hopf identity. For more details, see (Loday 2008).
منابع مشابه
On Automating Diagrammatic Proofs of Arithmetic Arguments
Theorems in automated theorem proving are usually proved by formal logical proofs. However, there is a subset of problems which humans can prove by the use of geometric operations on diagrams, so called diagrammatic proofs. Insight is often more clearly perceived in these proofs than in the corresponding algebraic proofs; they capture an intuitive notion of truthfulness that humans find easy to...
متن کاملAutomation of Diagrammatic Reasoning
Theorems in automated theorem proving are usually proved by logical formal proofs. However, there is a subset of problems which humans can prove in a different way by the use of geometric operations on diagrams, so called diagrammatic proofs. Insight is more clearly perceived in these than in the corresponding algebraic proofs: they capture an intuitive notion of truthfulness that humans find e...
متن کاملAutomation of Diagrammatic Proofs in Mathematics
It requires only basic secondary school knowledge of mathematics to realise that the diagram above is a proof of a theorem about the sum of odd naturals. It is an interesting property of diagrams that allows us to "see" and understand so much by looking at a simple diagram. Not only do we know what theorem the diagram represents, but we also understand the proof of the theorem and believe it is...
متن کاملProof Theory for Reasoning with Euler Diagrams: A Logic Translation and Normalization
Proof-theoretical notions and techniques, which are developed based on sentential/symbolic representations of formal proofs, are applied to Euler diagrams. A translation of an Euler diagrammatic system into a natural deduction system is given, and the soundness and faithfulness of the translation are proved. Some consequences of the translation are discussed in view of the notion of free ride, ...
متن کاملConstructing internal diagrammatic proofs from external logic diagrams
Internal syntactic operations on diagrams play a key role in accounting for efficacy of diagram use in reasoning. However, it is often held that in the case of complex deductive reasoning, diagrams can serve merely as an auxiliary source of information in interpreting sentences or constructing models. Based on experiments comparing subjects’ performances in syllogism solving where logic diagram...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Mathematical Structures in Computer Science
دوره 22 شماره
صفحات -
تاریخ انتشار 2012