Incidence structure
Builds on Binary relation
Definition
An incidence structure is a triple in which and are disjoint sets and is a binary relation from to . The elements of are the points, the elements of are the lines (or blocks), and is the incidence relation. A point and a line are incident, and one says that lies on , when .
Remarks
Example: let , let , and let . Check: and are disjoint and is a subset of , so is an incidence structure, a path of two lines meeting at the point .
Non-example: with the same and , a set that contains the pair is not an incidence relation, because is not in .
The dual of is , where exactly when . An isomorphism from to is a pair of bijections and that preserves incidence in both directions. Often lines are taken to be subsets of , with incidence given by membership. The general definition also allows two different lines with the same set of points. A finite incidence structure is described by its incidence matrix.
Reading path
To understand this page from the ground up, read these 2 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Binary relation concept
- Incidence structure definition
Further reading
About this page
| Tag | S8FNWJYVXM |
|---|---|
| URI | m2://S8FNWJYVXM |
| Kind | definition |
| Writing | W0 stub |
| MSC | 51A05, 05B25 |
| Defines | Incidence structure |
| Uses | Binary relation |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.