Principles of Quantum Mechanics, Multi-Stage Quantum Recognition Systems and Subspace Methods Which We Employ to Recognize Patterns Based upon Recall of Pattern-Models
最大事後確率認識法がシャノン流の平均相互情報量を個々の入力パターンにつき最大ならしめる働きであると説明される。カテゴリ帰属確率がある部分空間(カテゴリ表現空間)に帰属する程度であると設定される"部分空間法的認識法"はこの最大事後確率認識法の1種として研究される。量子認識系とは量子力学原理が適用されたパターン認識システムであるが、カテゴリ表現空間としてある射影作用素の値域(ヒルベルト空間のある部分空間)として設定し、量子力学における"物理量を観測する確率"をカテゴリ帰属確率として採用する量子認識法は部分空間法的認識法の1種である。 S.Suzukiのパターン認識の数学的理論(SS理論)では、入力パターンφに対応するパターンモデルTφを求め、Tφから多段階にわたって不動点パターンモデルを連想する形で、φの帰属するカテゴリを決定する多段階パターン変換連想形不動点認識法(SS連想形不動点認識法)が考えられている。 認識システムの心理状態を導入可能な多段階量子認識の働きの基礎が研究されており、それには、物理量観測確率をS.Suzukiの発見したaxiom 2を満たすように類似度関数に構成し直し、かつ、処理の対象とする問題の入力パターンのモデルから心理状態に依存してパターン想起されるパターンをこの入力パターンの代りに採用すればよいことが指摘されている。 \n It is explained that a maximum. posterior-probability recognition method(MPPRM) has an ability to maximize an amount of mutual information concerning an input-pattern in question. We point out that a subspace recognition method where a probability(PPC) of that an iuput pattern belongs to a category is defined with a degree DS of that the pattern is contained in a subspace (called a categorical representation space(CRS)) of a Hilbert space ? is a special case of MPPRM. A recognition system which operates based upon a principle of quantum mechanics is called a quantum recognition system(QRS). If we set CRS to a range of a selected projector in ? and we adopt that PPC is a probability POPQ of observing a physical quantity according to the quantum mechanics,QRS is a kind of a subspace recognition system. A recognition system RECOGNITRON which has been presented in a mathematical theory(i.e.SS theory) of recognizing patterns suggested by S.Suzuki gets a corresponding pattern-model Tφ of an input pattern φ in question to be recognized, and determines a category to which φ belongs so that a fixed-point pattern-model that appeared on a final stage of a muti-stage structural-fertilization transformation of pattern-models may be recalled in such a way of solving a fixed-point equation of associative reconition about Tφ. A basis of muti-stage quantum recognition is presented here which can posseses a state of mind, because (1) POPQ is reconstructed to a similarity-measure function SM so as to satisfy axiom 2 suggested by S.Suzuki and (2) we treat a pattern which may be recalled in a state of mind from a corresponding model of an input- pattern in question to be recognized as if it may be the input-pattern.
最大事後確率認識法がシャノン流の平均相互情報量を個々の入力パターンにつき最大ならしめる働きであると説明される。カテゴリ帰属確率がある部分空間(カテゴリ表現空間)に帰属する程度であると設定される"部分空間法的認識法"はこの最大事後確率認識法の1種として研究される。量子認識系とは量子力学原理が適用されたパターン認識システムであるが、カテゴリ表現空間としてある射影作用素の値域(ヒルベルト空間のある部分空間)として設定し、量子力学における"物理量を観測する確率"をカテゴリ帰属確率として採用する量子認識法は部分空間法的認識法の1種である。 S.Suzukiのパターン認識の数学的理論(SS理論)では、入力パターンφに対応するパターンモデルTφを求め、Tφから多段階にわたって不動点パターンモデルを連想する形で、φの帰属するカテゴリを決定する多段階パターン変換連想形不動点認識法(SS連想形不動点認識法)が考えられている。 認識システムの心理状態を導入可能な多段階量子認識の働きの基礎が研究されており、それには、物理量観測確率をS.Suzukiの発見したaxiom 2を満たすように類似度関数に構成し直し、かつ、処理の対象とする問題の入力パターンのモデルから心理状態に依存してパターン想起されるパターンをこの入力パターンの代りに採用すればよいことが指摘されている。 \n It is explained that a maximum. posterior-probability recognition method(MPPRM) has an ability to maximize an amount of mutual information concerning an input-pattern in question. We point out that a subspace recognition method where a probability(PPC) of that an iuput pattern belongs to a category is defined with a degree DS of that the pattern is contained in a subspace (called a categorical representation space(CRS)) of a Hilbert space ? is a special case of MPPRM. A recognition system which operates based upon a principle of quantum mechanics is called a quantum recognition system(QRS). If we set CRS to a range of a selected projector in ? and we adopt that PPC is a probability POPQ of observing a physical quantity according to the quantum mechanics,QRS is a kind of a subspace recognition system. A recognition system RECOGNITRON which has been presented in a mathematical theory(i.e.SS theory) of recognizing patterns suggested by S.Suzuki gets a corresponding pattern-model Tφ of an input pattern φ in question to be recognized, and determines a category to which φ belongs so that a fixed-point pattern-model that appeared on a final stage of a muti-stage structural-fertilization transformation of pattern-models may be recalled in such a way of solving a fixed-point equation of associative reconition about Tφ. A basis of muti-stage quantum recognition is presented here which can posseses a state of mind, because (1) POPQ is reconstructed to a similarity-measure function SM so as to satisfy axiom 2 suggested by S.Suzuki and (2) we treat a pattern which may be recalled in a state of mind from a corresponding model of an input- pattern in question to be recognized as if it may be the input-pattern.
最大事後確率認識法がシャノン流の平均相互情報量を個々の入力パターンにつき最大ならしめる働きであると説明される。カテゴリ帰属確率がある部分空間(カテゴリ表現空間)に帰属する程度であると設定される"部分空間法的認識法"はこの最大事後確率認識法の1種として研究される。量子認識系とは量子力学原理が適用されたパターン認識システムであるが、カテゴリ表現空間としてある射影作用素の値域(ヒルベルト空間のある部分空間)として設定し、量子力学における"物理量を観測する確率"をカテゴリ帰属確率として採用する量子認識法は部分空間法的認識法の1種である。\n S.Suzukiのパターン認識の数学的理論(SS理論)では、入力パターンφに対応するパターンモデルTφを求め、Tφから多段階にわたって不動点パターンモデルを連想する形で、φの帰属するカテゴリを決定する多段階パターン変換連想形不動点認識法(SS連想形不動点認識法)が考えられている。\n 認識システムの心理状態を導入可能な多段階量子認識の働きの基礎が研究されており、それには、物理量観測確率をS.Suzukiの発見したaxiom 2を満たすように類似度関数に構成し直し、かつ、処理の対象とする問題の入力パターンのモデルから心理状態に依存してパターン想起されるパターンをこの入力パターンの代りに採用すればよいことが指摘されている。\n\n It is explained that a maximum. posterior-probability recognition method(MPPRM) has an ability to maximize an amount of mutual information concerning an input-pattern in question. We point out that a subspace recognition method where a probability(PPC) of that an iuput pattern belongs to a category is defined with a degree DS of that the pattern is contained in a subspace (called a categorical representation space(CRS)) of a Hilbert space ℌ is a special case of MPPRM. A recognition system which operates based upon a principle of quantum mechanics is called a quantum recognition system(QRS). If we set CRS to a range of a selected projector in ℌ and we adopt that PPC is a probability POPQ of observing a physical quantity according to the quantum mechanics,QRS is a kind of a subspace recognition system.\n A recognition system RECOGNITRON which has been presented in a mathematical theory(i.e.SS theory) of recognizing patterns suggested by S.Suzuki gets a corresponding pattern-model Tφ of an input pattern φ in question to be recognized, and determines a category to which φ belongs so that a fixed-point pattern-model that appeared on a final stage of a muti-stage structural-fertilization transformation of pattern-models may be recalled in such a way of solving a fixed-point equation of associative reconition about Tφ.\n A basis of muti-stage quantum recognition is presented here which can posseses a state of mind, because\n (1) POPQ is reconstructed to a similarity-measure function SM so as to satisfy axiom 2 suggested by S.Suzuki and\n (2) we treat a pattern which may be recalled in a state of mind from a corresponding model of an input- pattern in question to be recognized as if it may be the input-pattern.
This paper reconstructs foundational quantum mechanics from the 1925 Born–Jordan matrix formulation and proposes a symbolic fixed-point framework, φ^∞, as its categorical and conceptual inverse. While quantum measurement theory relies on non-commutative observables and probabilistic collapse from superposition to eigenstate, the φ^∞ system achieves deterministic stabilization via transfinite symbolic recursion. This yields a unique, entropy-minimizing fixed point that preserves all informational content. The φ-recursion is formalized using topos theory from Grothendieck’s SGA4, and its properties—existence, uniqueness, and comonadic rigidity—are proven within a sheaf-theoretic structure. This symbolic dynamics framework also minimizes conditional entropy and provides a recursive invariant under observer-independent transformation. Extensions to higher topoi ((∞,1)-categories), algorithmic theory, and information-theoretic applications such as optimal compression and invariant pattern recognition are discussed. The construction connects key foundations: Born–Jordan quantization (quantum collapse), φ-recursion (symbolic computation), topos fixed points, and entropy-based models of cognition. It contributes to the theory of categorical inverse systems, observer-independent models, and the dual formulation of measurement.
It is usually taken for granted that the natural mathematical framework for quantum mechanics is the theory of Hilbert spaces, where pure states of a quantum system correspond to complex vectors of unit length. These vectors can be combined to create more general states expressed in terms of positive semidefinite matrices of unit trace called density operators. A density operator tells us everything we know about a quantum system. In particular, it specifies a unique probability for any measurement outcome. Thus, to fully appreciate quantum mechanics as a statistical model for physical phenomena, it is necessary to understand the basic properties of its set of states. Studying the convex geometry of quantum states provides important clues as to why the theory is expressed most naturally in terms of complex amplitudes. At the very least, it gives us a new perspective into thinking about structure of quantum mechanics. \n \n \nThis thesis is concerned with the structure of quantum state space obtained from the geometry of the convex set of probability distributions for a special class of measurements called symmetric informationally complete (SIC) measurements. In this context, quantum mechanics is seen as a particular restriction of a regular simplex, where the state space is postulated to carry a symmetric set of states called SICs, which are associated with equiangular lines in a complex vector space. The analysis applies specifically to 3-dimensional quantum systems or qutrits, which is the simplest nontrivial case to consider according to Gleason's theorem. It includes a full characterization of qutrit SICs and includes specific proposals for implementing them using linear optics. The infinitely many qutrit SICs are classified into inequivalent families according to the Clifford group, where equivalence is defined by geometrically invariant numbers called triple products. The multiplication of SIC projectors is also used to define structure coefficients, which are convenient for elucidating some additional structure possessed by SICs, such as the Lie algebra associated with the operator basis defined by SICs, and a linear dependency structure inherited from the Weyl-Heisenberg symmetry. After describing the general one-to-one correspondence between density operators and SIC probabilities, many interesting features of the set of qutrits are described, including an elegant formula for its pure states, which reveals a permutation symmetry related to the structure of a finite affine plane, the exact rotational equivalence of different SIC probability spaces, the shape of qutrit state space defined by the radial distance of the boundary from the maximally mixed state, and a comparison of the 2-dimensional cross-sections of SIC probabilities to known results. Towards the end, the representation of quantum states in terms of SICs is used to develop a method for reconstructing quantum theory from the postulate of maximal consistency, and a procedure for building up qutrit state space from a finite set of points corresponding to a Hesse configuration in Hilbert space is sketched briefly.