Fourier / CONCEPT
Binary Character Redundancy Criterion
A binary character is redundant exactly when it lies in the existing span.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES2
PROOF DEPTH2
DOCUMENT LINKS1
Kernel preservation, span membership, and output recovery are equivalent
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
Certified topology / DOWNSTREAM
Consequences
RELATED KNOWLEDGE
Structural connections
- Binary Character Basis Minimalitystructural-affinity · Closed
- Binary Character Profile Rank Cardinalitystructural-affinity · Closed
- Binary Character Rank And Redundancystructural-affinity · Closed
- Binary Character Semantic Redundancystructural-affinity · Closed
- Binary Character Subfamily Criterionstructural-affinity · Closed
- Binary Character Uniform Information Exactnessstructural-affinity · Closed
- Binary Role Minimum Cardinalitystructural-affinity · Closed
- Quotient-Fiber Entropy Decompositionstructural-affinity · Closed
Documents & exposition
Other authored & advisory relationships
None recorded in this release.
LIBRARY / RELEASE VERSIONS
Content history
Loading release versions...
Browse the archiveCertified provenance