The Mathematics of Questions

• URL: http://arxiv.org/abs/2503.18992v2
• Date: Fri, 04 Apr 2025 22:35:43 GMT
• Title: The Mathematics of Questions
• Abstract summary: I report the existence of exactly one non-trivial solution to the equation $i(A,B)+i(A,neg B)+i(neg A,B)+i(neg A,neg B)= 0$, where $i(A,B)=logfracP(Atext and B)P(A)P(B)$, and $P(A)$ is the probability of the proposition $A$.<n>The solution is a new elementary informational relationship between logical propositions, which
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: I report the existence of exactly one non-trivial solution to the equation $i(A,B)+i(A,\neg B)+i(\neg A,B)+i(\neg A,\neg B)= 0$, where $i(A,B)=\log\frac{P(A\text{ and }B)}{P(A)P(B)}$, and $P(A)$ is the probability of the proposition $A$. The equation specifies an information balance condition between two logical propositions, which is satisfied only by independence and by this new solution. The solution is a new elementary informational relationship between logical propositions, which we denote as $A \sim B$. The $\sim$ relation cannot be expressed as a relationship between probabilities without the use of complex numbers. It can, however, be greatly simplified by expressing each proposition as a combination of a question and an answer, for example, writing, ``All men are mortal'', as (Are all men mortal?, Yes). We will study the mathematics of questions and find out what role the $\sim$ relationship plays inside the algebra. We will find that, like propositions, questions can act on probability distributions. A proposition, $X$, can be given, setting $P(X)$ to 1. The question of $X$ can be raised, setting $P(X)$ to $1/2$. Giving the proposition adds information to the probability distribution, but raising the question takes information away. Introducing questions into probability theory makes it possible to represent subtraction of information as well as addition. We will examine how questions can be related to each other geometrically. Remarkably, the simplest way of orienting questions in space has the same structure as the simplest quantum system -- the two-state system. We will find that the essential mathematical structure of the two-state quantum system can be derived from the mathematics of questions, including non-commutativity, complementarity, wavefunction collapse, the Hilbert space representation and the Born rule, as well as quantum entanglement and non-locality.

Related papers

• Statistical and computational challenges in ranking [53.03724383992195]
  We consider the problem of ranking $n$ experts according to their abilities, based on the correctness of their answers to $d$ questions.<n>We investigate here the existence of statistically optimal and computationally efficient procedures for this problem.
  arXiv  Detail & Related papers  (2025-12-24T11:18:06Z)
• On the Relativity of Quantumness as Implied by Relativity of Arithmetic and Probability [0.0]
  hierarchical structure of isomorphic arithmetics.<n>Probabilities $p_k=gk(p)$, where $g$ is the restriction of $g_mathbbR$ to the interval $[0,1]$.<n>Quantum binary probabilities are defined by $g(p)=sin2fracpi2p$.
  arXiv  Detail & Related papers  (2025-10-01T08:13:14Z)
• The Communication Complexity of Approximating Matrix Rank [50.6867896228563]
  We show that this problem has randomized communication complexity $Omega(frac1kcdot n2log|mathbbF|)$. As an application, we obtain an $Omega(frac1kcdot n2log|mathbbF|)$ space lower bound for any streaming algorithm with $k$ passes.
  arXiv  Detail & Related papers  (2024-10-26T06:21:42Z)
• Optimal level set estimation for non-parametric tournament and crowdsourcing problems [49.75262185577198]
  Motivated by crowdsourcing, we consider a problem where we partially observe the correctness of the answers of $n$ experts on $d$ questions. In this paper, we assume that the matrix $M$ containing the probability that expert $i$ answers correctly to question $j$ is bi-isotonic up to a permutation of it rows and columns. We construct an efficient-time algorithm that turns out to be minimax optimal for this classification problem.
  arXiv  Detail & Related papers  (2024-08-27T18:28:31Z)
• A polynomial quantum computing algorithm for solving the dualization problem [75.38606213726906]
  Given two monotone prime functions $f:0,1n to 0,1$ and $g:0,1n to 0,1$ the dualization problem consists in determining if $g$ is the dual of $f$. We present a quantum computing algorithm that solves the decision version of the dualization problem in time.
  arXiv  Detail & Related papers  (2023-08-28T18:12:54Z)
• Nonlocality under Computational Assumptions [51.020610614131186]
  A set of correlations is said to be nonlocal if it cannot be reproduced by spacelike-separated parties sharing randomness and performing local operations. We show that there exist (efficient) local producing measurements that cannot be reproduced through randomness and quantum-time computation.
  arXiv  Detail & Related papers  (2023-03-03T16:53:30Z)
• Learning and Covering Sums of Independent Random Variables with Unbounded Support [4.458210211781738]
  We study the problem of covering and learning sums $X = X_1 + cdots + X_n$ of independent integer-valued random variables $X_i$ with unbounded, or even infinite, support. We show that the maximum value of the collective support of $X_i$'s necessarily appears in the sample complexity of learning $X$.
  arXiv  Detail & Related papers  (2022-10-24T15:03:55Z)
• On Computing Probabilistic Explanations for Decision Trees [4.406418914680962]
  "sufficient reasons" are a kind of explanation in which given a decision tree $T$ and an instance $x$, one explains the decision $T(x)$. Our paper settles the computational complexity of $delta$-sufficient-reasons over decision trees. We identify structural restrictions of decision trees that make the problem tractable, and show how SAT solvers might be able to tackle these problems in practical settings.
  arXiv  Detail & Related papers  (2022-06-30T21:58:31Z)
• Uncertainties in Quantum Measurements: A Quantum Tomography [52.77024349608834]
  The observables associated with a quantum system $S$ form a non-commutative algebra $mathcal A_S$. It is assumed that a density matrix $rho$ can be determined from the expectation values of observables. Abelian algebras do not have inner automorphisms, so the measurement apparatus can determine mean values of observables.
  arXiv  Detail & Related papers  (2021-12-14T16:29:53Z)
• Threshold Phenomena in Learning Halfspaces with Massart Noise [56.01192577666607]
  We study the problem of PAC learning halfspaces on $mathbbRd$ with Massart noise under Gaussian marginals. Our results qualitatively characterize the complexity of learning halfspaces in the Massart model.
  arXiv  Detail & Related papers  (2021-08-19T16:16:48Z)
• Quantum double aspects of surface code models [77.34726150561087]
  We revisit the Kitaev model for fault tolerant quantum computing on a square lattice with underlying quantum double $D(G)$ symmetry. We show how our constructions generalise to $D(H)$ models based on a finite-dimensional Hopf algebra $H$.
  arXiv  Detail & Related papers  (2021-06-25T17:03:38Z)
• Stochastic behavior of outcome of Schur-Weyl duality measurement [45.41082277680607]
  We focus on the measurement defined by the decomposition based on Schur-Weyl duality on $n$ qubits. We derive various types of distribution including a kind of central limit when $n$ goes to infinity.
  arXiv  Detail & Related papers  (2021-04-26T15:03:08Z)
• On the complexity of zero gap MIP* [0.11470070927586014]
  We show that the class $mathsfMIP*$ is equal to $mathsfRE$. In particular this shows that the complexity of approximating the quantum value of a non-local game $G$ is equivalent to the complexity of the Halting problem.
  arXiv  Detail & Related papers  (2020-02-24T19:11:01Z)
• Towards Optimal Separations between Quantum and Randomized Query Complexities [0.30458514384586394]
  We show that a quantum algorithm can be solved by making $2O(k)$ queries to the inputs. For any constant $varepsilon>0$, this gives a $O(1)$ vs. $N2/3-varepsilon$ separation.
  arXiv  Detail & Related papers  (2019-12-29T01:42:31Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.