Relations Between Institutions | 机构间的关系

📚 Relations Between Institutions | 机构间的关系

In A-Level Further Mathematics, the topic of Relations provides a rigorous way to represent and analyse connections between elements of sets. When we map this abstract idea onto real-world organisations such as universities, charities, or government bodies, we uncover powerful methods to describe partnership networks, hierarchies, and dependencies. This article explores how binary relations—a core part of the Edexcel FP1 syllabus—can be used to model interactions between institutions.

在A-Level进阶数学中，关系这一主题提供了一种严谨的方式来表示和分析集合元素之间的联系。当我们把这个抽象概念映射到大学、慈善机构或政府机关等现实世界的组织时，我们可以用强有力的方法来描述合作网络、层级结构和依赖关系。本文探讨二元关系——Edexcel FP1大纲的核心内容——如何用来为机构之间的互动建模。

1. What Is a Relation? | 什么是关系？

In mathematics, a binary relation R from a set A to a set B is simply a subset of the Cartesian product A × B. If an institution a ∈ A is linked to an institution b ∈ B in a specific way, we write a R b, meaning (a, b) ∈ R. This definition is flexible enough to capture almost any type of organisational connection.

在数学中，从集合 A 到集合 B 的二元关系 R 就是笛卡尔积 A × B 的一个子集。如果机构 a ∈ A 以特定方式与机构 b ∈ B 相关联，我们记作 a R b，表示 (a, b) ∈ R。这个定义足够灵活，几乎能捕捉到任何组织联系。

Example: Let A be a set of {University X, College Y, Institute Z} and B be a set of {Funding Body P, Regulator Q}. The relation “receives grants from” could be R = {(University X, Funding Body P), (College Y, Regulator Q)}.
实例：设 A 为 {大学X, 学院Y, 研究院Z}，B 为 {资助机构P, 监管机构Q}。关系“接受拨款来源”可以是 R = {(大学X, 资助机构P), (学院Y, 监管机构Q)}。

2. Formalising Institutional Relations | 机构关系的形式化

We often work within a single universal set U of institutions. A relation on U is a subset of U × U. To visualise this, we can use a directed graph where vertices represent institutions and an arrow from a to b indicates a R b.

我们通常在所有机构组成的全集 U 内部进行讨论。在 U 上的关系就是 U × U 的子集。为了直观呈现，我们可以使用有向图，其中顶点表示机构，从 a 到 b 的箭头表示 a R b。

The Cartesian product itself can be enormous, but only meaningful ordered pairs belong to the relation. For instance, for U = {A, B, C}, we might define “has a partnership with” as R = {(A,B), (B,C)}. Notice that we do not assume symmetry yet.

笛卡尔积本身可能非常庞大，但只有有意义的序偶才属于这个关系。例如，对于 U = {A, B, C}，我们可以定义“存在合作关系”为 R = {(A,B), (B,C)}。注意我们还没有预设对称性。

3. Properties of Relations | 关系的性质

Edexcel FP1 requires us to investigate three fundamental properties: reflexive, symmetric, and transitive. When applied to institutions, these properties gain concrete meaning.

Edexcel FP1 要求我们研究三个基本性质：自反性、对称性和传递性。当应用到机构上时，这些性质获得了具体的含义。

A relation R is reflexive if ∀ a ∈ U, a R a. Example: “has the same accreditation body as” is reflexive because every institution shares its own accreditation body.
关系 R 是自反的，如果 ∀ a ∈ U，a R a。例如：“与……拥有同一认证机构”是自反的，因为每个机构都与自己共享认证机构。
R is symmetric if a R b ⇒ b R a. Example: “has a bilateral exchange agreement with” among universities is symmetric.
R 是对称的，如果 a R b ⇒ b R a。例如：大学之间的“签有双边交换协议”是对称的。
R is transitive if a R b and b R c ⇒ a R c. Example: “is under the same regulatory framework as” can be transitive.
R 是传递的，如果 a R b 且 b R c ⇒ a R c。例如：“与……处于同一监管框架下”可以是传递的。

4. Real-World Examples of Institutional Relations | 机构间关系的实例

Consider a set of public bodies U = {Home Office, Treasury, NHS Trust, Local Council}. Define R = {(x, y) | x shares data with y}. We can check whether this data-sharing relation is symmetric: if Home Office shares data with NHS Trust, does NHS Trust necessarily share data back? Not always. Therefore, the relation likely lacks symmetry.

考虑一组公共机构 U = {内政部, 财政部, NHS信托, 地方议会}。定义 R = {(x, y) | x 与 y 共享数据}。我们可以检查这个数据共享关系是否对称：如果内政部与NHS信托共享数据，NHS信托是否一定向内政部共享数据？并不总是。因此，这个关系可能缺乏对称性。

In contrast, a relation “has an official representative on the board of” between institutions is usually not symmetric (if University X sends a representative to Regulator Y, Y does not send a representative back to X). It is also rarely transitive, creating a complex network of influence.

相比之下，机构间“在……的董事会中设有官方代表”的关系通常不对称（如果大学X向监管机构Y派驻代表，Y不会向X派驻代表）。它也很少是传递的，从而形成了一个复杂的影响力网络。

5. Equivalence Relations and Institutional Classification | 等价关系与机构分类

A relation that is reflexive, symmetric, and transitive is called an equivalence relation. This partitions the set into disjoint equivalence classes. In the institutional world, we might use “operates under the same legal framework” as an equivalence relation.

同时满足自反性、对称性和传递性的关系称为等价关系。它将集合划分为互不相交的等价类。在机构世界里，我们可以用“在相同的法律框架下运作”作为一个等价关系。

For instance, suppose U = {School A, School B, Academy C, College D}. If all state schools follow the same national curriculum requirements, then the relation “follows the same curriculum regulation” may form classes of state schools, academies, and independent colleges. This helps policymakers group institutions effectively.

例如，设 U = {学校A, 学校B, 学院C, 专科学校D}。如果所有公立学校遵循相同的国家课程要求，那么关系“遵循同样的课程规定”可能形成公立学校、学院和独立学院的等价类。这有助于政策制定者有效地对机构进行分组。

Mathematically, the equivalence class of an element a is [a] = {x ∈ U | x R a}. The set of all equivalence classes forms a partition of U.

从数学上看，元素 a 的等价类为 [a] = {x ∈ U | x R a}。全体等价类的集合构成了 U 的一个划分。

6. Partial Orders and Hierarchies | 偏序关系与层级结构

Another important type of relation is a partial order, which is reflexive, anti-symmetric (if a R b and b R a, then a = b), and transitive. These relations model hierarchical structures. A typical example among institutions is “has authority over” or “reports to”.

另一种重要的关系类型是偏序关系，它满足自反性、反对称性（若 a R b 且 b R a，则 a = b）以及传递性。这些关系用来给层级结构建模。机构之间一个典型例子是“对……拥有管辖权”或“向……报告”。

Suppose we have a set of government offices: {Ministry, Department X, Agency Y, Unit Z}. The relation “supervises” might form a partial order if no two distinct elements supervise each other. We can draw a Hasse diagram to illustrate the hierarchy clearly.

假设有一组政府办公室：{部, 部门X, 机构Y, 小组Z}。关系“监督”如果没有两个不同元素互相监督，就可能形成一个偏序。我们可以画出哈斯图来清晰地展示这个层级结构。

In a Hasse diagram, we remove loops and transitive edges. For example, Ministry supervises Department X, Department X supervises Agency Y, Ministry also supervises Agency Y indirectly, but we only draw the direct connections.

在哈斯图中，我们去掉自环和传递边。例如，部监督部门X，部门X监督机构Y，部也间接监督机构Y，但我们只画直接连线。

7. Relation Matrices and Institutional Networks | 关系矩阵与机构网络

A relation on a finite set can be represented by a square Boolean matrix: entry (i, j) is 1 if aᵢ R aⱼ, and 0 otherwise. This representation is especially useful for analysing large institutional networks, such as consortia of universities or inter-agency collaborations.

有限集上的关系可以用一个方形的布尔矩阵表示：若 aᵢ R aⱼ，则 (i, j) 元为 1，否则为 0。这种表示法对分析大型机构网络尤其有用，比如高校联盟或跨部门合作。

Let U = {Inst₁, Inst₂, Inst₃}. The relation “jointly bids for projects” might be represented by matrix M:

设 U = {机构₁, 机构₂, 机构₃}。关系“联合投标项目”可用矩阵 M 表示：

	Inst₁	Inst₂	Inst₃
Inst₁	1	1	0
Inst₂	1	1	0
Inst₃	0	0	1

Note that the diagonal entries are all 1 because the relation is defined to be reflexive (an institution can always bid alone). The matrix is symmetric, confirming that the joint-bidding relation is symmetric.

注意对角线元素全为 1，因为该关系被定义为自反的（机构总能单独投标）。矩阵是对称的，证实联合投标关系是对称的。

8. Composition of Relations and Supply Chains | 关系的复合与供应链

The composition of two relations R and S on a set U, denoted S ∘ R, is defined by a(S ∘ R)c if there exists an institution b such that a R b and b S c. This powerful concept models indirect links, such as supply chains or referral systems between institutions.

两个关系 R 和 S 的复合，记作 S ∘ R，定义为：若存在机构 b 使得 a R b 且 b S c，则 a(S ∘ R)c。这一有力概念能为间接联系建模，例如机构之间的供应链或转介系统。

Example: Let R be “sends goods to” and S be “processes raw materials for”. Then S ∘ R would represent a two‑step flow: Institution a sends goods to b, and b processes them for c. Thus a is indirectly delivering processed materials to c.

例如：设 R 为“向……运送货物”，S 为“为……加工原材料”。那么 S ∘ R 就表示两步流程：机构 a 向 b 运送货物，b 为 c 进行加工。因而 a 间接地向 c 交付了加工过的物料。

We can compute the Boolean matrix of S ∘ R by Boolean matrix multiplication of M_R and M_S (using logical OR and AND). This technique is invaluable for tracing dependencies in large institutional networks.

我们可以通过 M_R 与 M_S 的布尔矩阵乘法（使用逻辑或与逻辑与）来计算 S ∘ R 的布尔矩阵。在追踪大型机构网络的依赖关系时，该技术极为宝贵。

9. Anti‑Symmetry and Competing Institutions | 反对称性与竞争性机构

Anti‑symmetry adds a distinct constraint: if a R b and b R a both hold, then a and b must be the same institution. In competition relationships, this property often fails. Consider institutions competing for the same grant. If Inst₁ competes with Inst₂, then Inst₂ competes with Inst₁, so the relation is symmetric, not anti‑symmetric.

反对称性增加了一个独特的约束：如果 a R b 和 b R a 同时成立，那么 a 与 b 必须是同一个机构。在竞争关系中，这个性质通常不成立。试想机构争夺同一拨款。若机构₁ 与机构₂ 竞争，则机构₂ 也与机构₁ 竞争，所以该关系是对称的，而非反对称的。

By contrast, “has a higher performance ranking than” is an example of a strict anti‑symmetric relation (if a ranks higher than b and b ranks higher than a, then a = b, which is impossible unless they are the same). Such relations allow us to sort institutions into league tables without contradiction.

而“绩效排名高于……”则是一个严格的反对称关系例子（如果 a 排名高于 b 且 b 排名高于 a，则 a = b，除非它们相同，否则不可能）。这种关系使我们能够无矛盾地将机构排入名次表。

10. Closures of Relations and Institutional Expansion | 关系的闭包与机构拓展

Given a relation that lacks certain properties, we can form its transitive closure or symmetric closure by adding the minimal number of ordered pairs necessary. For institutional networks, this corresponds to forecasting indirect collaborations or mandatory reciprocal agreements.

对于缺少某些性质的关系，我们可以通过添加最少量的必要序偶来构造它的传递闭包或对称闭包。对机构网络而言，这对应于预测间接合作或强制互惠协议。

The transitive closure of “directly funds” would reveal the full funding reach of a grant‑making body. If Funding Council A directly funds University B, and University B awards sub‑grants to Institute C, then the transitive closure ensures (A, C) is included, showing total influence.

“直接资助”的传递闭包将揭示拨款机构完整的资助范围。如果拨款委员会 A 直接资助大学 B，而大学 B 又向研究所 C 发放子拨款，那么传递闭包将保证 (A, C) 包含在内，展示出全部的影响力。

11. Equivalence Relations in Accreditation Networks | 认证网络中的等价关系

International accreditation bodies often recognise one another through mutual agreements. The relation “is mutually recognised by” among accreditation agencies may form equivalence classes of agencies that accept each other’s standards. This directly affects the institutions under their purview, as moving from one accredited class to another requires additional inspections.

国际认证机构经常通过互认协议彼此承认。认证机构之间的“互认”关系可能形成接受彼此标准的机构等价类。这直接影响其管辖下的组织，因为要从一个被认证的类别转移到另一个，就需要额外的审查。

Using equivalence classes, an institution can quickly determine which qualifications are portable. The partition guarantees that any member of the same class provides equivalent recognition, simplifying cross‑border institutional partnerships.

利用等价类，一所机构可以迅速确定哪些资质是可迁移的。划分保证了同一等价类中的任何成员都提供相同的认可，从而简化了跨境机构合作。

12. Summary: A Mathematical Lens on Institutions | 总结：用数学眼光看机构

Relations, a concept firmly rooted in the Edexcel FP1 specification, offer a clean and powerful framework for dissecting how institutions interact. By checking reflexivity, symmetry, transitivity, and anti‑symmetry, we can classify connections as equivalence relations, partial orders, or simple networks. Matrix representations and closures deepen our ability to trace complex dependencies. Whether mapping regulatory oversight, funding flows, or data sharing, the mathematics of relations turns messy real‑world links into structured, analysable patterns.

关系——这一牢牢植根于Edexcel FP1大纲的概念——为我们剖析机构间的互动提供了一个干净而有力的框架。通过检验自反性、对称性、传递性和反对称性，我们可以将联系归类为等价关系、偏序关系或简单网络。矩阵表示和闭包则进一步增强了我们追踪复杂依赖的能力。不论是梳理监管监督、资金流动还是数据共享，关于关系的数学都能将杂乱无章的现实连接转变为结构清晰、可分析的模式。

Published by TutorHao | Mathematics Revision Series | aleveler.com

更多咨询请联系16621398022（同微信）

Relations Between Institutions | 机构间的关系