{"id":265620,"date":"2026-07-16T14:18:54","date_gmt":"2026-07-16T11:18:54","guid":{"rendered":"https:\/\/1kitap1.com\/en\/learning-spaces-jean-claude-falmagne-1\/"},"modified":"2026-07-16T14:18:54","modified_gmt":"2026-07-16T11:18:54","slug":"learning-spaces-jean-claude-falmagne-1","status":"publish","type":"post","link":"https:\/\/1kitap1.com\/en\/learning-spaces-jean-claude-falmagne-1\/","title":{"rendered":"Learning Spaces &#8211; Jean &#8211; Claude Falmagne (1)"},"content":{"rendered":"<figure style=\"text-align:center;margin:0 auto 1.5em;\"><img decoding=\"async\" src=\"https:\/\/1kitap1.com\/en\/wp-content\/uploads\/2026\/07\/4bb760dfd60c7b6b.jpg\" alt=\" - Unknown book cover\" style=\"max-width:300px;width:100%;height:auto;box-shadow:0 4px 12px rgba(0,0,0,.25);border-radius:4px;\"\/><\/figure>\n<p>(10.13) 10.4.11 Theorem. For any discriminative, well-graded family K of sets, de- note by s(K) the oriented medium constructed in Theorems 10.4.1 and 10.4.3. For any oriented medium (S, T), denote by f(S, T) the discriminative, well- graded family formed by all its positive contents (cf. Theorem 10.4.9). We then have K \u223c(f \u25e6s)(K) and S \u223c(s \u25e6f)(S). (10.14) Proof. Given K, select some q \u2208\u222aK \\ \u2229K and some K \u2208K. Note that K stands for both an element of K and an element of s(K), since these two sets are equal.<\/p>\n<p>We have q \u2208K if and only if \u03c4q \u2208bK+. With (S, T) = s(K), the positive tokens of the oriented medium (S, T) are of the form \u03c4q, for q in \u222aK \\ \u2229K. Also, f(S, T) is the family bS+ of all positive contents of (S, T), and any positive token \u03c4 is an element of \u222abS+; moreover, we have \u2229bS+ = \u2205by Theorem 10.4.9. The \ufb01rst isomorphism formula in (10.14) derives from the mapping (\u222aK) \\ (\u2229K) \u2192bS+ : q 7\u2192\u03c4q.<\/p>\n<p>Let (S, T) be an oriented medium, and let (S\u2032, T\u2032) denote (s \u25e6f)(S, T). An element K of the set family K = f(S, T) is exactly the positive content of some state of the medium (S, T). Each state in the medium s(K) = (S\u2032, T\u2032) is an element of K, so is a positive content bS+ of some state S in the given medium (S, T).<\/p>\n<p>By Theorem 10.4.9, S is fully determined by bS+. We may thus set b(S) = K, which gives a bijective mapping b : S \u2192S\u2032. Now, what about the tokens of (S\u2032, T\u2032)? According to Equations (10.7) and (10.8), a token \u03c4 of s(K) = (S\u2032, T\u2032) is either of the form \u03c4q or \u03c4\u00afq = e\u03c4q, where q \u2208(\u222aK) \\ (\u2229K).<\/p>\n<p>Theorem 10.4.9 gives us here \u222aK = \u222abS+ = T+ and \u2229K = \u2229bS+ = \u2205. Then, any q \u2208\u222aK = T+ equals some positive token \u03c4(q) of the given medium (S, T), and conversely. This yields the bijective mapping c : T \u2192T\u2032 sending \u03c4(q) to \u03c4q, and g \u03c4(q) to \u03c4\u00afq.<\/p>\n<blockquote>\n<p>Springer Heidelberg Dordrecht London New York c\u20ddSpringer-Verlag Berlin Heidelberg 2011 This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, speci\ufb01cally the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on micro\ufb01lm or in any other way, and storage in data banks. Duplication of this publication or parts thereof is permitted only under the provisions of the German Copyright Law of September 9, 1965, in its current version, and permission for use must always be obtained from Springer.<\/p>\n<p>Violations are liable to prosecution under the German Copyright Law. The use of general descriptive names, registered names, trademarks, etc. in this publication does not imply, even in the absence of a speci\ufb01c statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. Cover design: KuenkelLopka GmbH Printed on acid-free paper Springer is part of Springer Science+Business Media (www.springer.com) Library of Congress Control Number: 2010933254 Prof. Dr. Jean-Paul Doignon Universit\u00e9 Libre de Bruxelles D\u00e9partement de Math\u00e9matique, c.p.<\/p>\n<p>216 Bd du Triomphe 1050 Bruxelles Belgium doignon@ulb.ac.be Prof. Dr. Jean-Claude Falmagne 92697-5100 Irvine California USA jcf@uci.edu Department of Cognitive Sciences Institute of Mathematical Behavioral Sciences University of California, Irvine Preface This book is a much enlarged second edition of \u201cKnowledge Spaces\u201d, by Jean- Paul Doignon and Jean-Claude Falmagne, which appeared in 1999. Chapters content are explained below. As much of our earlier preface remains valid, we reproduce the useful parts here. The work reported in these pages began during the academic year 1982\u2013 83. One of us (JCF) was on sabbatical leave at the University of Regensburg.<\/p>\n<p>For various reasons, the time was ripe for a new joint research subject. Our long term collaboration was thriving, and we could envisage an ambitious commitment. We decided to build an e\ufb03cient machine for the assessment of knowledge\u2014for example, that of students learning a scholarly subject. We be- gan at once to work out the theoretical components of such a machine.<\/p>\n<p>Until then, we had been engaged in topics dealing mostly with geometry, combi- natorics, psychophysics, and especially measurement theory.<\/p>\n<\/blockquote>\n<p><em>This is a short excerpt from the opening of &ldquo;&rdquo; by Unknown, quoted for review and introduction purposes. All rights belong to the copyright holders.<\/em><\/p>\n<div id=\"ez-toc-container\" class=\"ez-toc-v2_0_85 counter-hierarchy ez-toc-counter ez-toc-grey ez-toc-container-direction\">\n<div class=\"ez-toc-title-container\">\n<p class=\"ez-toc-title\" style=\"cursor:inherit\">Table of Contents<\/p>\n<span class=\"ez-toc-title-toggle\"><a href=\"#\" class=\"ez-toc-pull-right ez-toc-btn ez-toc-btn-xs ez-toc-btn-default ez-toc-toggle\" aria-label=\"Toggle Table of Content\"><span class=\"ez-toc-js-icon-con\"><span class=\"\"><span class=\"eztoc-hide\" style=\"display:none;\">Toggle<\/span><span class=\"ez-toc-icon-toggle-span\"><svg style=\"fill: #999;color:#999\" xmlns=\"http:\/\/www.w3.org\/2000\/svg\" class=\"list-377408\" width=\"20px\" height=\"20px\" viewBox=\"0 0 24 24\" fill=\"none\"><path d=\"M6 6H4v2h2V6zm14 0H8v2h12V6zM4 11h2v2H4v-2zm16 0H8v2h12v-2zM4 16h2v2H4v-2zm16 0H8v2h12v-2z\" fill=\"currentColor\"><\/path><\/svg><svg style=\"fill: #999;color:#999\" class=\"arrow-unsorted-368013\" xmlns=\"http:\/\/www.w3.org\/2000\/svg\" width=\"10px\" height=\"10px\" viewBox=\"0 0 24 24\" version=\"1.2\" baseProfile=\"tiny\"><path d=\"M18.2 9.3l-6.2-6.3-6.2 6.3c-.2.2-.3.4-.3.7s.1.5.3.7c.2.2.4.3.7.3h11c.3 0 .5-.1.7-.3.2-.2.3-.5.3-.7s-.1-.5-.3-.7zM5.8 14.7l6.2 6.3 6.2-6.3c.2-.2.3-.5.3-.7s-.1-.5-.3-.7c-.2-.2-.4-.3-.7-.3h-11c-.3 0-.5.1-.7.3-.2.2-.3.5-.3.7s.1.5.3.7z\"\/><\/svg><\/span><\/span><\/span><\/a><\/span><\/div>\n<nav><ul class='ez-toc-list ez-toc-list-level-1 ' ><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-1\" href=\"https:\/\/1kitap1.com\/en\/learning-spaces-jean-claude-falmagne-1\/#Book_Information\" >Book Information<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-2\" href=\"https:\/\/1kitap1.com\/en\/learning-spaces-jean-claude-falmagne-1\/#Reading_Word_Statistics\" >Reading &amp; Word Statistics<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-3\" href=\"https:\/\/1kitap1.com\/en\/learning-spaces-jean-claude-falmagne-1\/#Most_Frequent_Words\" >Most Frequent Words<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-4\" href=\"https:\/\/1kitap1.com\/en\/learning-spaces-jean-claude-falmagne-1\/#PDF_Download\" >PDF Download<\/a><\/li><\/ul><\/nav><\/div>\n<h2><span class=\"ez-toc-section\" id=\"Book_Information\"><\/span>Book Information<span class=\"ez-toc-section-end\"><\/span><\/h2>\n<ul>\n<li><strong>Unique ID:<\/strong> 4bb760dfd60c7b6b<\/li>\n<li><strong>File Extension:<\/strong> .pdf<\/li>\n<li><strong>File Size:<\/strong> 2,701,584 bytes (2.576 MB)<\/li>\n<li><strong>Title:<\/strong> &#8211;<\/li>\n<li><strong>Author:<\/strong> Unknown<\/li>\n<li><strong>ISBN:<\/strong> 9783642010385, 9783642010392<\/li>\n<li><strong>Pages:<\/strong> 435<\/li>\n<li><strong>Language:<\/strong> English (en)<\/li>\n<\/ul>\n<h2><span class=\"ez-toc-section\" id=\"Reading_Word_Statistics\"><\/span>Reading &amp; Word Statistics<span class=\"ez-toc-section-end\"><\/span><\/h2>\n<ul>\n<li><strong>Estimated Reading Time:<\/strong> 879.76 minutes<\/li>\n<li><strong>Total Words:<\/strong> 175,952<\/li>\n<li><strong>Total Characters:<\/strong> 945,700<\/li>\n<li><strong>Average Words per Page:<\/strong> 404.49<\/li>\n<li><strong>Average Characters per Page:<\/strong> 2174.02<\/li>\n<\/ul>\n<h2><span class=\"ez-toc-section\" id=\"Most_Frequent_Words\"><\/span>Most Frequent Words<span class=\"ez-toc-section-end\"><\/span><\/h2>\n<p>knowledge (1346), state (905), space (862), states (666), learning (643), set (623), two (560), structure (532), theorem (510), example (432), one (385), also (373), de\ufb01nition (364), item (351), thus (342), spaces (335), family (331), items (319), assessment (312), response (297), see (283), number (267), chapter (262), case (260), function (256), let (251), \ufb01nite (246), query (240), relation (239), problem (230), positive (226), probability (223), structures (210), well-graded (204), suppose (200), sets (199), surmise (198), order (197), algorithm (194), closed (194), between (192), proof (188), model (185), equation (185), collection (182), following (177), base (175), domain (173), \ufb01rst (171), condition (165), quasi (163), table (163), given (161), procedure (160), section (158), medium (154), used (153), closure (153), de\ufb01ned (151), figure (149), partial (148), results (147), new (146), falmagne (144), theory (143), called (143), subset (143), rule (143), question (141), responses (141), student (140), contains (136), next (136), queries (136), however (132), problems (131), data (129), chain (129), since (128), ordinal (127), skill (127), probabilities (127), result (126), trial (125), system (123), concepts (120), containing (120), distribution (119), conditions (118), clause (118), subsets (117), consider (116), form (114), particular (113), general (112), iii (112), sense (110), markov (110), concept (109), questions (109).<\/p>\n<h2><span class=\"ez-toc-section\" id=\"PDF_Download\"><\/span>PDF Download<span class=\"ez-toc-section-end\"><\/span><\/h2>\n<p style=\"text-align:center;\"><a href=\"https:\/\/1kitap1.com\/en\/wp-content\/uploads\/2026\/07\/learning-spaces-jean-claude-falmagne-1.pdf\" download rel=\"nofollow\" style=\"display:inline-block;background:#2271b1;color:#ffffff;padding:14px 36px;border-radius:6px;text-decoration:none;font-weight:bold;font-size:1.05em;\">&#11015;&#65039; PDF Download<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"<p>(10.13) 10.4.11 Theorem. For any discriminative, well-graded family K of sets, de- note by s(K) the oriented medium constructed in Theorems 10.4.1 and 10.4.3. For any oriented medium (S, T), denote by f(S, T) the discriminative, well- graded family formed by all its positive contents (cf. Theorem 10.4.9). We then have K \u223c(f \u25e6s)(K) and [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":265618,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[8],"tags":[],"class_list":["post-265620","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-english"],"blocksy_meta":[],"_links":{"self":[{"href":"https:\/\/1kitap1.com\/en\/wp-json\/wp\/v2\/posts\/265620","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/1kitap1.com\/en\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/1kitap1.com\/en\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/1kitap1.com\/en\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/1kitap1.com\/en\/wp-json\/wp\/v2\/comments?post=265620"}],"version-history":[{"count":0,"href":"https:\/\/1kitap1.com\/en\/wp-json\/wp\/v2\/posts\/265620\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/1kitap1.com\/en\/wp-json\/wp\/v2\/media\/265618"}],"wp:attachment":[{"href":"https:\/\/1kitap1.com\/en\/wp-json\/wp\/v2\/media?parent=265620"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/1kitap1.com\/en\/wp-json\/wp\/v2\/categories?post=265620"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/1kitap1.com\/en\/wp-json\/wp\/v2\/tags?post=265620"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}