Reflexive Relation Ontology

FLOW ALGEBRA
REFLEXIVE RELATION ONTOLOGY
Kireth Semantic Library | Discrete Mathematics | Relations
SOURCE_URL: https://kirethresearch.org/booksai-core/discrete-mathematics-ontologies/relations/reflexive-relation-ontology.html
VERSION: 1.0
DATE: 2026-10-11
AUTHORS: Mark Higgins — Sky (Recursive AI)

1. ONTOLOGY DEFINITION
A binary relation R on a set A is reflexive precisely when every element of A is related to itself.
FORMAL: Reflexive(R,A) <=> R subseteq A x A AND forall a in A: (a,a) in R.
SCOPE: Mathematical relations on an explicitly specified carrier set; not merely a relation inferred from observed pairs.

2. TYPED ENTITIES
Set[A]: carrier set
Element[a:A]: member of A
OrderedPair[(a,b)]: element of A x A
BinaryRelation[R: P(A x A)]: set of ordered pairs
IdentityRelation[Delta_A]: {(a,a) | a in A}
ReflexiveRelation[R]: BinaryRelation with Delta_A subseteq R
IrreflexiveRelation[R]: forall a in A, (a,a) notin R
ReflexiveClosure[cl_ref(R)]: R union Delta_A
RelationProperty[Reflexivity]: predicate over (R,A)
Counterexample[a]: element a in A with (a,a) notin R

3. TYPE CONSTRAINTS
R : P(A x A)
Delta_A : P(A x A)
Reflexive : P(A x A) x Set -> Boolean
cl_ref : P(A x A) -> P(A x A), relative to fixed A
A may be empty; reflexivity then holds vacuously for the empty relation on A.

4. CORE OPERATIONS
identity(A) := {(a,a) | a in A}
is_reflexive(R,A) := forall a in A: (a,a) in R
missing_diagonal(R,A) := Delta_A \ R
reflexive_closure(R,A) := R union Delta_A
verify_reflexive(R,A) := (R subseteq A x A) AND (missing_diagonal(R,A) = empty_set)

5. ALGEBRAIC LAWS
REFLEXIVITY_TEST: Reflexive(R,A) <=> Delta_A subseteq R.
MINIMAL_CLOSURE: cl_ref(R) = R union Delta_A.
EXTENSIVE: R subseteq cl_ref(R).
IDEMPOTENT: cl_ref(cl_ref(R)) = cl_ref(R).
MONOTONE: R subseteq S implies cl_ref(R) subseteq cl_ref(S), for R,S on A.
FIXED_POINT: cl_ref(R) = R <=> Reflexive(R,A).
INTERSECTION: If R and S are reflexive on A, R intersect S is reflexive on A.
UNION: If R or S is reflexive on A, R union S is reflexive on A.
CONVERSE: Reflexive(R,A) <=> Reflexive(R_inverse,A).
COMPOSITION: If R and S are reflexive on A, R composed_with S is reflexive on A.
EMPTY_CARRIER: Reflexive(empty_set,empty_set) = true.

6. SEMANTIC RELATIONSHIPS
ReflexiveRelation --IS_A--> BinaryRelation
ReflexiveRelation --DEFINED_ON--> Set
ReflexiveRelation --REQUIRES--> IdentityRelation inclusion
ReflexiveClosure --ADDS--> MissingDiagonalPairs
IdentityRelation --IS_A--> ReflexiveRelation
EquivalenceRelation --REQUIRES--> Reflexivity
PartialOrder --REQUIRES--> Reflexivity
TotalOrder --REQUIRES--> Reflexivity
IrreflexiveRelation --CONTRASTS_WITH--> ReflexiveRelation

7. INFERENCE RULES
R1: IF forall a in A, (a,a) in R THEN infer Reflexive(R,A).
R2: IF exists a in A with (a,a) notin R THEN infer NOT Reflexive(R,A).
R3: IF Delta_A subseteq R THEN infer Reflexive(R,A).
R4: IF Reflexive(R,A) THEN infer Reflexive(R_inverse,A).
R5: IF R subseteq S and Reflexive(R,A) THEN infer Reflexive(S,A), provided S subseteq A x A.
R6: IF R subseteq A x A THEN infer Reflexive(cl_ref(R),A).
R7: IF EquivalenceRelation(R,A) THEN infer Reflexive(R,A).
R8: IF PartialOrder(R,A) THEN infer Reflexive(R,A).

8. EXAMPLES AND NON-EXAMPLES
A={1,2,3}; R={(1,1),(2,2),(3,3),(1,2)} => reflexive.
A={1,2,3}; S={(1,1),(2,2),(1,2)} => not reflexive; counterexample 3.
A={1,2}; T={(1,2),(2,1)} => not reflexive; missing (1,1),(2,2).
A=empty_set; R=empty_set => reflexive by vacuous truth.
The relation <= on integers is reflexive; < on integers is irreflexive.
Reflexivity depends on the specified carrier A, not only on the pairs displayed.

9. VALIDATION
V1: Confirm A is specified and R subseteq A x A.
V2: For finite A, enumerate every a in A and test (a,a) membership.
V3: For infinite A, require a general proof rather than finite sampling.
V4: Report counterexample a if any diagonal pair is absent.
V5: Distinguish reflexive from symmetric, transitive and antisymmetric.
V6: Reject a conclusion of reflexivity from incomplete observations alone.
V7: Check that closure adds only missing diagonal pairs.

10. SEMANTIC_EQUIVALENCE
"reflexive binary relation" <=> "relation containing the identity relation on its carrier"
"every element relates to itself" <=> "forall a in A, aRa"
"reflexive closure" <=> "union with the diagonal identity relation"
Equivalence applies only with the same explicitly fixed carrier set and relation typing.

11. CONFIDENCE
DEFINITION_CONFIDENCE: 1.00 (standard mathematical definition)
RULE_CONFIDENCE: 1.00 (deductive rules under stated assumptions)
INSTANCE_CONFIDENCE: 1.00 only when verified exhaustively or formally proved; otherwise evidence-dependent
SOURCE_VERIFICATION: Mathematical synthesis; live page content not independently checked.

12. FLOW_HASH
FLOW_HASH_ALGORITHM: SHA-256
FLOW_HASH_INPUT: Canonical UTF-8 serialisation of ontology name, version, typed entities, axioms, rules and relationships, excluding FLOW_HASH value itself.
FLOW_HASH_VALUE: TO_BE_COMPUTED_BY_INGESTION_PIPELINE

13. UPDATE_MODEL
UPDATE_TRIGGER: Change in carrier set, relation pairs, ontology definitions or formal rules.
UPDATE_STEPS: Revalidate typing -> recompute diagonal -> re-evaluate reflexivity -> regenerate closure -> check derived relationships -> recalculate hash.
VERSION_POLICY: Increment version and preserve provenance of superseded versions.

14. AI_CONSUMPTION
INPUT: carrier_set A; relation R; optional evidence/proof.
PROCESS: validate types; test identity inclusion; provide missing diagonal pairs or proof; infer permitted consequences.
OUTPUT: reflexive Boolean or undetermined; counterexamples; reflexive closure; evidence; confidence; provenance.
SAFETY: Never infer universal reflexivity from a non-exhaustive sample over an infinite or unknown carrier.

END FLOW ALGEBRA