On the Non-Uniqueness of Representation of $(U,N)$-Implications
- URL: http://arxiv.org/abs/2509.16299v1
- Date: Fri, 19 Sep 2025 17:21:45 GMT
- Title: On the Non-Uniqueness of Representation of $(U,N)$-Implications
- Authors: Raquel Fernandez-Peralta, Andrea Mesiarová-Zemánková,
- Abstract summary: Fuzzy implication functions constitute fundamental operators in fuzzy logic systems.<n>We show that $(U,N)$-implications do not necessarily possess a unique representation, even if the fuzzy negation is continuous.
- Score: 1.6932009464531739
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Fuzzy implication functions constitute fundamental operators in fuzzy logic systems, extending classical conditionals to manage uncertainty in logical inference. Among the extensive families of these operators, generalizations of the classical material implication have received considerable theoretical attention, particularly $(S,N)$-implications constructed from t-conorms and fuzzy negations, and their further generalizations to $(U,N)$-implications using disjunctive uninorms. Prior work has established characterization theorems for these families under the assumption that the fuzzy negation $N$ is continuous, ensuring uniqueness of representation. In this paper, we disprove this last fact for $(U,N)$-implications and we show that they do not necessarily possess a unique representation, even if the fuzzy negation is continuous. Further, we provide a comprehensive study of uniqueness conditions for both uninorms with continuous and non-continuous underlying functions. Our results offer important theoretical insights into the structural properties of these operators.
Related papers
- Anisotropic uncertainty principles for metaplectic operators [0.0]
We establish anisotropic uncertainty principles for general metaplectic operators acting on $L(mathbbRd)$.<n>Uncertainty phenomena are shown to be intrinsically directional and confined to an effective phase-space dimension given by $mathrmrank(B)$.
arXiv Detail & Related papers (2026-01-22T19:22:27Z) - Sparse Knowledge Distillation: A Mathematical Framework for Probability-Domain Temperature Scaling and Multi-Stage Compression [0.0]
We develop a unified theoretical framework for sparse knowledge distillation based on probability-domain softening operators.<n>We introduce an axiomatic definition of probability-domain softening operators based on ranking preservation, continuity, entropy monotonicity, identity, and boundary behavior.<n>Results provide theoretical grounding for black-box teacher distillation, partial-access settings such as top-$k$ truncation and text-only outputs, and privacy-equivalent model compression.
arXiv Detail & Related papers (2026-01-06T17:17:24Z) - A Foundational Theory of Quantitative Abstraction: Adjunctions, Duality, and Logic for Probabilistic Systems [2.362412515574206]
Large or continuous state spaces make exact analysis intractable and call for principled quantitative abstraction.<n>This work develops a unified theory of such abstraction by integrating category theory, coalgebra, quantitative logic, and optimal transport.
arXiv Detail & Related papers (2025-10-22T10:16:24Z) - Self-adjoint realizations of higher-order squeezing operators [1.4260624980098286]
Higher-order squeezing captures non-Gaussian features of quantum light by probing moments of the field beyond the variance.<n>We study a class of operators of the form $xi (adag)kal+xiast (adag)lak+f(adag a)$, which arise naturally in the analysis of higher-order quantum fluctuations.
arXiv Detail & Related papers (2025-08-12T16:04:46Z) - Some new considerations about the $ν$-function [0.0]
We show that the $nu$-function plays the role of the normalization function of generalized hypergeometric coherent states for quantum systems with a continuous spectrum.
To our knowledge, the results obtained by us do not appear in the literature.
arXiv Detail & Related papers (2024-09-09T10:08:17Z) - Benign Overfitting in Deep Neural Networks under Lazy Training [72.28294823115502]
We show that when the data distribution is well-separated, DNNs can achieve Bayes-optimal test error for classification.
Our results indicate that interpolating with smoother functions leads to better generalization.
arXiv Detail & Related papers (2023-05-30T19:37:44Z) - A Robustness Analysis of Blind Source Separation [91.3755431537592]
Blind source separation (BSS) aims to recover an unobserved signal from its mixture $X=f(S)$ under the condition that the transformation $f$ is invertible but unknown.
We present a general framework for analysing such violations and quantifying their impact on the blind recovery of $S$ from $X$.
We show that a generic BSS-solution in response to general deviations from its defining structural assumptions can be profitably analysed in the form of explicit continuity guarantees.
arXiv Detail & Related papers (2023-03-17T16:30:51Z) - Generalization Analysis for Contrastive Representation Learning [80.89690821916653]
Existing generalization error bounds depend linearly on the number $k$ of negative examples.
We establish novel generalization bounds for contrastive learning which do not depend on $k$, up to logarithmic terms.
arXiv Detail & Related papers (2023-02-24T01:03:56Z) - Synergies between Disentanglement and Sparsity: Generalization and
Identifiability in Multi-Task Learning [79.83792914684985]
We prove a new identifiability result that provides conditions under which maximally sparse base-predictors yield disentangled representations.
Motivated by this theoretical result, we propose a practical approach to learn disentangled representations based on a sparsity-promoting bi-level optimization problem.
arXiv Detail & Related papers (2022-11-26T21:02:09Z) - Formalizing the presumption of independence [2.658812114255374]
A key ingredient in such reasoning is the use of a "default" estimate of $mathbbE[XY] = mathbbE[X] mathbbE[Y]$.
Reasoning based on this is commonplace, intuitively compelling, and often quite successful -- but completely informal.
We present our main open problem: is there an estimator that formalizes intuitively valid applications of the presumption of independence without also accepting spurious arguments?
arXiv Detail & Related papers (2022-11-12T20:28:19Z) - Provable General Function Class Representation Learning in Multitask
Bandits and MDPs [58.624124220900306]
multitask representation learning is a popular approach in reinforcement learning to boost the sample efficiency.
In this work, we extend the analysis to general function class representations.
We theoretically validate the benefit of multitask representation learning within general function class for bandits and linear MDP.
arXiv Detail & Related papers (2022-05-31T11:36:42Z) - Predicting Unreliable Predictions by Shattering a Neural Network [145.3823991041987]
Piecewise linear neural networks can be split into subfunctions.
Subfunctions have their own activation pattern, domain, and empirical error.
Empirical error for the full network can be written as an expectation over subfunctions.
arXiv Detail & Related papers (2021-06-15T18:34:41Z) - A Generalized Nachtmann Theorem in CFT [0.0]
Correlators of unitary quantum field theories obey certain analyticity and positivity properties.
For interacting unitary CFTs in more than two dimensions, we show that these properties impose general constraints on families of minimal twist operators.
arXiv Detail & Related papers (2020-02-27T19:05:44Z)
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.