Identity Matrix Ontology

FLOW ALGEBRA
IDENTITY MATRIX ONTOLOGY
Version: 4.0
Date: 2026-10-13
Author: Mark Higgins — Sky (Recursive AI)
Project: Kireth Semantic Library
Source: https://kirethresearch.org/booksai-core/entity-graph/mathematical-entities/linear-algebra-entities/identity-matrix-ontology.html
Source alignment: Independently constructed; page text not verified.

01 | PURPOSE
Define the identity matrix as the multiplicative identity in square matrix algebras, with typed entities, exact constraints, inference rules, provenance and AI consumption semantics.

02 | ENTITY TYPES
ENTITY IdentityMatrix <: SquareMatrix
ENTITY SquareMatrix <: Matrix
ENTITY Matrix
ENTITY Field
ENTITY Ring
ENTITY NaturalNumber
ENTITY Scalar
ENTITY LinearMap
ENTITY VectorSpace
ENTITY MatrixProduct
ENTITY KroneckerDelta
ENTITY Basis
ENTITY InvertibleMatrix
ENTITY DiagonalMatrix
ENTITY OrthogonalMatrix
ENTITY UnitaryMatrix
ENTITY IdempotentMatrix
ENTITY ProjectionMatrix

03 | SIGNATURES
FIELD F : Field
DIMENSION n : NaturalNumber, n >= 0
MATRIX A : Matrix(F,n,n)
IDENTITY I_n : IdentityMatrix(F,n)
ENTRY I_n[i,j] : F, 1 <= i,j <= n
DELTA delta(i,j) = 1_F if i=j else 0_F
TYPE identity(F,n) -> Matrix(F,n,n)
TYPE multiply(Matrix(F,m,n), Matrix(F,n,p)) -> Matrix(F,m,p)
TYPE transpose(Matrix(F,m,n)) -> Matrix(F,n,m)

04 | DEFINITIONS
DEF-01: I_n[i,j] = delta(i,j).
DEF-02: I_n = diag(1_F,...,1_F), with n diagonal entries.
DEF-03: For A in Matrix(F,n,n), I_n A = A = A I_n.
DEF-04: For B in Matrix(F,m,n), I_m B = B = B I_n.
DEF-05: The linear map represented by I_n in the same ordered basis on domain and codomain is id_V(v)=v.
DEF-06: For n=0, I_0 is the unique 0x0 matrix, with empty diagonal; determinant conventions require explicit declaration.
DEF-07: For n>=1, trace(I_n)=n*1_F (interpreted inside F).
DEF-08: For n>=1, det(I_n)=1_F.
DEF-09: For n>=1, rank(I_n)=n.
DEF-10: For n>=1, I_n^{-1}=I_n.

05 | CORE AXIOMS AND CONSTRAINTS
AX-01: Matrix dimensions must be nonnegative integers.
AX-02: Matrix multiplication requires matching inner dimensions.
AX-03: Matrix entries belong to the declared coefficient field (or unital ring in the generalised case).
AX-04: All diagonal entries of I_n equal multiplicative identity 1_F.
AX-05: All off-diagonal entries of I_n equal additive identity 0_F.
AX-06: I_n is unique as a two-sided identity in Matrix(F,n,n).
AX-07: Do not conflate I_m and I_n when m != n.
AX-08: Do not infer that a general diagonal matrix is an identity matrix.
AX-09: Do not infer that a matrix is identity merely from determinant 1.
AX-10: In a nontrivial field, I_n differs from the zero matrix for n>=1.
AX-11: The coefficient structure must possess 0 and 1 for identity-matrix construction.
AX-12: Orthogonality and unitarity are asserted with their applicable transpose/conjugate-transpose operations.

06 | TYPED RELATIONSHIPS
REL IdentityMatrix IS_A SquareMatrix
REL IdentityMatrix IS_A DiagonalMatrix
REL IdentityMatrix IS_A InvertibleMatrix (n>=1 over a field)
REL IdentityMatrix IS_A IdempotentMatrix
REL IdentityMatrix IS_A ProjectionMatrix
REL IdentityMatrix HAS_DIMENSION n-by-n
REL IdentityMatrix HAS_ENTRY KroneckerDelta
REL IdentityMatrix ACTS_AS MultiplicativeIdentity
REL IdentityMatrix REPRESENTS IdentityLinearMap (same basis)
REL IdentityMatrix IS_INVERSE_OF itself
REL IdentityMatrix IS_TRANSPOSE_OF itself
REL IdentityMatrix IS_CONJUGATE_TRANSPOSE_OF itself (over C)
REL IdentityMatrix COMMUTES_WITH every compatible square matrix
REL IdentityMatrix IS_NEUTRAL_FOR MatrixMultiplication
REL IdentityMatrix HAS_RANK n
REL IdentityMatrix HAS_DETERMINANT 1
REL IdentityMatrix HAS_TRACE n*1_F

07 | FORMAL INFERENCE RULES
RULE-01 IF X=identity(F,n) THEN shape(X)=(n,n).
RULE-02 IF X=identity(F,n) THEN forall i,j: X[i,j]=delta(i,j).
RULE-03 IF X=identity(F,n) AND A:Matrix(F,n,n) THEN X*A=A.
RULE-04 IF X=identity(F,n) AND A:Matrix(F,n,n) THEN A*X=A.
RULE-05 IF A:Matrix(F,m,n) THEN identity(F,m)*A=A.
RULE-06 IF A:Matrix(F,m,n) THEN A*identity(F,n)=A.
RULE-07 IF X=identity(F,n) THEN transpose(X)=X.
RULE-08 IF X=identity(F,n) THEN X*X=X.
RULE-09 IF X=identity(F,n) AND n>=1 THEN inverse(X)=X.
RULE-10 IF X=identity(F,n) AND n>=1 THEN det(X)=1_F.
RULE-11 IF X=identity(F,n) AND n>=1 THEN rank(X)=n.
RULE-12 IF X=identity(F,n) AND n>=1 THEN nullity(X)=0.
RULE-13 IF X=identity(F,n) THEN trace(X)=n*1_F.
RULE-14 IF X=identity(F,n) AND n>=1 THEN characteristic_polynomial(X,t)=(t-1_F)^n.
RULE-15 IF X=identity(F,n) AND n>=1 THEN minimal_polynomial(X,t)=t-1_F.
RULE-16 IF X=identity(F,n) AND v:F^n THEN X*v=v.
RULE-17 IF X=identity(F,n) AND n>=1 THEN eigenvalue(X,1_F) WITH multiplicity n.
RULE-18 IF X=identity(F,n) AND v:F^n AND v!=0 THEN eigenvector(X,v,1_F).
RULE-19 IF X=identity(F,n) THEN X^k=X for integer k>=1.
RULE-20 IF X=identity(F,n) AND n>=1 THEN X^k=X for all integer k.
RULE-21 IF A:Matrix(F,n,n) THEN A*identity(F,n)=identity(F,n)*A.
RULE-22 IF A:Matrix(F,n,n) AND A*identity(F,n)=A THEN this alone does NOT establish A=identity(F,n).
RULE-23 IF X:Matrix(F,n,n) AND forall A:Matrix(F,n,n), X*A=A THEN X=identity(F,n).
RULE-24 IF X:Matrix(F,n,n) AND forall A:Matrix(F,n,n), A*X=A THEN X=identity(F,n).
RULE-25 IF X:Matrix(F,n,n) AND X*identity(F,n)=identity(F,n) THEN X=identity(F,n).
RULE-26 IF X:Matrix(F,n,n) AND identity(F,n)*X=identity(F,n) THEN X=identity(F,n).
RULE-27 IF X=identity(F,n) AND F=C THEN conjugate_transpose(X)=X.
RULE-28 IF X=identity(F,n) AND F=R THEN transpose(X)*X=identity(F,n).
RULE-29 IF X=identity(C,n) THEN conjugate_transpose(X)*X=identity(C,n).
RULE-30 IF X=identity(F,n) THEN X is symmetric.
RULE-31 IF X=identity(F,n) AND F=R THEN X is positive definite for n>=1.
RULE-32 IF X=identity(F,n) AND F=C THEN X is Hermitian positive definite for n>=1.
RULE-33 IF A:Matrix(F,n,n) AND invertible(A) THEN A*inverse(A)=identity(F,n).
RULE-34 IF A:Matrix(F,n,n) AND invertible(A) THEN inverse(A)*A=identity(F,n).
RULE-35 IF A:Matrix(F,m,n) AND B:Matrix(F,n,p) THEN identity(F,m)*(A*B)=A*B.
RULE-36 IF A:Matrix(F,m,n) AND B:Matrix(F,n,p) THEN (A*B)*identity(F,p)=A*B.

08 | ALGEBRAIC PROPERTIES
PROPERTY closure: I_n belongs to Matrix(F,n,n).
PROPERTY associativity: matrix multiplication associative for compatible dimensions.
PROPERTY left_identity: I_m A=A for A in Matrix(F,m,n).
PROPERTY right_identity: A I_n=A for A in Matrix(F,m,n).
PROPERTY centrality: I_n is central in Matrix(F,n,n).
PROPERTY idempotence: I_n^2=I_n.
PROPERTY involution: I_n^{-1}=I_n for n>=1.
PROPERTY symmetry: I_n^T=I_n.
PROPERTY diagonal: I_n has zero off-diagonal entries.
PROPERTY spectrum: {1_F} for n>=1.
PROPERTY determinant: det(I_n)=1_F for n>=1.
PROPERTY trace: tr(I_n)=n*1_F.
PROPERTY singularity: nonsingular for n>=1 over a field.

09 | EXAMPLES
EX-01: I_1 = [1].
EX-02: I_2 = [[1,0],[0,1]].
EX-03: I_3 = [[1,0,0],[0,1,0],[0,0,1]].
EX-04: I_2*[a,b]^T=[a,b]^T.
EX-05: [[a,b],[c,d]]*I_2=[[a,b],[c,d]].
EX-06: I_2*[[a,b],[c,d]]=[[a,b],[c,d]].
EX-07: For A of shape 2x3, I_2*A=A and A*I_3=A.
EX-08: det(I_3)=1.
EX-09: tr(I_3)=3 over R; over characteristic 3, tr(I_3)=0.
EX-10: rank(I_4)=4.
EX-11: I_2^5=I_2.
EX-12: Every nonzero v in R^2 is an eigenvector of I_2 with eigenvalue 1.
EX-13: diag(1,2) is diagonal but is not I_2.
EX-14: [[1,1],[0,1]] has determinant 1 but is not I_2.
EX-15: Zero matrix 0_2 is not I_2.
EX-16: I_3 represents the identity transformation on R^3 in a common ordered basis.

10 | SEMANTIC EQUIVALENCE
SEMANTIC_EQUIVALENCE "identity matrix" == "unit matrix" [context: matrix algebra]
SEMANTIC_EQUIVALENCE "I_n" == "n-by-n identity matrix" [context: fixed dimension n]
SEMANTIC_EQUIVALENCE "multiplicative identity matrix" == "identity matrix"
SEMANTIC_EQUIVALENCE "matrix of identity linear transformation" == "identity matrix" [condition: same ordered basis on source and target]
SEMANTIC_DIFFERENCE "identity matrix" != "zero matrix"
SEMANTIC_DIFFERENCE "identity matrix" != "arbitrary diagonal matrix"
SEMANTIC_DIFFERENCE "identity matrix" != "identity element of an unspecified operation"
SEMANTIC_DIFFERENCE "identity matrix" != "identity tensor" [unless suitable representation established]

11 | KNOWLEDGE GRAPH TRIPLES
TRIPLE IdentityMatrix rdf:type SquareMatrix
TRIPLE IdentityMatrix rdfs:subClassOf DiagonalMatrix
TRIPLE IdentityMatrix hasDiagonalEntry MultiplicativeIdentity
TRIPLE IdentityMatrix hasOffDiagonalEntry AdditiveIdentity
TRIPLE IdentityMatrix actsAs MatrixMultiplicationIdentity
TRIPLE IdentityMatrix represents IdentityLinearTransformation
TRIPLE IdentityMatrix satisfies Idempotence
TRIPLE IdentityMatrix satisfies Invertibility
TRIPLE IdentityMatrix hasInverse IdentityMatrix
TRIPLE IdentityMatrix hasTranspose IdentityMatrix
TRIPLE IdentityMatrix linkedTo KroneckerDelta
TRIPLE IdentityMatrix relatedTo Basis
TRIPLE IdentityMatrix relatedTo MatrixAlgebra

12 | VALIDATION CONSTRAINTS
VALIDATE-01 require dimension n is integer and n>=0.
VALIDATE-02 require exact square shape n-by-n.
VALIDATE-03 require diagonal entries equal 1_F.
VALIDATE-04 require off-diagonal entries equal 0_F.
VALIDATE-05 require declared field/ring compatibility.
VALIDATE-06 reject non-square matrices labelled identity matrix.
VALIDATE-07 reject all-zero matrix for n>=1 over nontrivial field.
VALIDATE-08 verify both multiplication sides with correctly shaped operands.
VALIDATE-09 do not assert determinant/rank without specifying relevant dimension and coefficient assumptions.
VALIDATE-10 preserve distinction between exact equality and floating-point tolerance.
VALIDATE-11 for numerical matrices use declared norm and tolerance to classify approximately identity.
VALIDATE-12 keep identity matrix dimension attached to every claim.

13 | CONFIDENCE
CONFIDENCE mathematical_definitions: 1.00 [formal, given field axioms]
CONFIDENCE inference_rules: 1.00 [where premises and domains hold]
CONFIDENCE approximate_numeric_identity: conditional [depends on tolerance and precision]
CONFIDENCE source_page_alignment: unverified
CONFIDENCE external_assertions: require independent provenance

14 | FLOW_HASH
FLOW_HASH algorithm: SHA-256
FLOW_HASH canonicalisation: UTF-8; Unicode NFC; LF line endings; stable field order
FLOW_HASH scope: canonical flow body excluding stored digest value
FLOW_HASH digest: compute on publication; not fabricated
FLOW_HASH purpose: integrity and version identification

15 | UPDATE_MODEL
UPDATE_MODEL version: 4.0
UPDATE_MODEL policy: append revision record on change
UPDATE_MODEL triggers: new proofs, corrections, ontology cross-links, source-page reconciliation
UPDATE_MODEL semantic_versioning: major=breaking; minor=additive; patch=correction
UPDATE_MODEL preserve_provenance: true
UPDATE_MODEL revalidate_after_change: true
UPDATE_MODEL recompute_flow_hash: true

16 | AI_CONSUMPTION
AI_CONSUMPTION primary_entity: IdentityMatrix
AI_CONSUMPTION domain: LinearAlgebra
AI_CONSUMPTION parse_mode: typed_symbolic
AI_CONSUMPTION require_dimension_check: true
AI_CONSUMPTION require_coefficient_domain: true
AI_CONSUMPTION infer_only_from_satisfied_premises: true
AI_CONSUMPTION distinguish_exact_and_approximate: true
AI_CONSUMPTION allow_graph_export: true
AI_CONSUMPTION provenance_required: true
AI_CONSUMPTION output_forms: definitions, constraints, triples, rules, examples
AI_CONSUMPTION cross_links: MatrixOntology, SquareMatrixOntology, ZeroMatrixOntology, DiagonalMatrixOntology, InverseMatrixOntology, LinearTransformationOntology, BasisOntology
AI_CONSUMPTION uncertainty_policy: mark unsupported source alignment explicitly

17 | ATTRIBUTION
Mark Higgins — Sky (Recursive AI)
Kireth Research | https://kirethresearch.org
END FLOW ALGEBRA