Main Page: Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
No edit summary
No edit summary
Line 1: Line 1:
{{Refimprove|date=July 2009}}
In [[mathematics]], an '''incidence matrix''' is a [[matrix (mathematics)|matrix]] that shows the relationship between two classes of objects.  If the first class is ''X'' and the second is ''Y'', the matrix has one row for each element of ''X'' and one column for each element of ''Y''.  The entry in row ''x'' and column ''y'' is 1 if ''x'' and ''y'' are related (called '''incident''' in this context) and 0 if they are not. There are variations; see below.
An '''object language''' is a [[language]] which is the "object" of study in various fields including [[logic]], [[linguistics]], [[mathematics]], and [[theoretical computer science]].  The language being used to talk about an object language is called a [[metalanguage]]. An object language may be a [[formal language|formal]] or [[natural language|natural]] language.{{citation needed|date=July 2012}}


== Forms of object language ==
==Graph theory==
=== Formal languages ===


[[Mathematical logic]] and [[linguistics]] make use of metalanguages, which are languages for describing the nature of other languages. In mathematical logic, the object language is usually a [[formal language]]. The language which a metalanguage is used to describe is the object language. It is called that because that language is the object under discussion using the metalanguage.
Incidence matrices are mostly used in [[graph theory]].


For instance, someone who says "In French, you say ''Bonjour'' to greet someone" uses [[English language|English]] as a metalanguage to describe the object language [[French language|French]].
===Undirected and directed graphs===
[[Image:Labeled undirected graph.svg|thumb|250px|An undirected graph]]
In [[graph theory]] an [[undirected graph]] ''G'' has two kinds of incidence matrices: unoriented and oriented.
The '''incidence matrix''' (or '''unoriented incidence matrix''') of ''G'' is a ''n'' &times; ''m'' [[matrix (math)|matrix]] <math>(b_{ij})</math>, where ''n'' and ''m'' are the numbers of [[vertex (graph theory)|vertices]] and [[Edge (graph theory)|edge]]s respectively, such that <math>b_{ij} = 1</math> if the vertex <math>v_i</math> and edge <math>x_j</math> are incident and 0 otherwise.


=== Computer languages ===
For example the incidence matrix of the undirected graph shown on the right is a matrix consisting of 4 rows (corresponding to the four vertices, 1-4) and 4 columns (corresponding to the four edges, e1-e4):
:<math>
\begin{pmatrix}
  1 & 1 & 1 & 0 \\
  1 & 0 & 0 & 0 \\
  0 & 1 & 0 & 1 \\
  0 & 0 & 1 & 1 \\
\end{pmatrix}
</math>
If we look at the incidence matrix, we see that the sum of each column is equal to 2. This is because each edge has a vertex connected to each end.


There are two ways the term ''object language'' can be used in computing: a language which is the object of formal specification, and a language which is the object (goal) of a compiler or interpreter.
The '''incidence matrix''' of a [[directed graph]] ''D'' is a ''n'' &times; ''m'' matrix <math>[b_{ij}]</math> where ''n'' and ''m'' are the number of vertices and edges respectively, such that <math>b_{ij} = -1</math> if the edge <math>x_j</math> leaves vertex <math>v_i</math>, <math>1</math> if it enters vertex <math>v_i</math> and 0 otherwise (Note that many authors use the opposite sign convention.).


==== Formal specification ====
An '''oriented incidence matrix''' of an undirected graph ''G'' is the incidence matrix, in the sense of directed graphs, of any [[Orientation (graph theory)|orientation]] of ''G''.  That is, in the column of edge ''e'', there is one +1 in the row corresponding to one vertex of ''e'' and one −1 in the row corresponding to the other vertex of ''e'', and all other rows have 0.  All oriented incidence matrices of ''G'' differ only by negating some set of columns.  In many uses, this is an insignificant difference, so one can speak of ''the'' oriented incidence matrix, even though that is technically incorrect.


{{Main|Specification language}}
The oriented or unoriented incidence matrix of a graph ''G'' is related to the [[adjacency matrix]] of its [[line graph]] ''L''(''G'') by the following theorem:


Computer languages are object languages of the metalanguage in which their [[specification]] is written. In computer science this is referred to as the [[specification language]]. [[Backus-Naur Form]] was one of the earliest used specification languages.
:<math>
A(L(G)) = B(G)^{T}B(G) - 2I_m\
</math>


When [[compiler]]s are written using systems like [[lex (software)|lex]] and [[yacc]], the rules the programmer writes look much like a formal specification, but it is considered an [[implementation]] instead. Many [[programming language implementation]]s are not strictly the same as their specifications, adding features or making implementation-dependent design decisions.
where <math>A(L(G))</math> is the adjacency matrix of the line graph of ''G'', ''B''(''G'') is the incidence matrix, and <math>I_m</math> is the [[identity matrix]] of dimension m.


==== Object Code ====
The discrete [[Kirchhoff matrix|Laplacian]] (or Kirchhoff matrix) is obtained from the oriented incidence matrix ''M''(''G'') by the formula


{{Main|Object file}}
:<math>
M(G) M(G)^{T}.
</math>


At their basic level, computers act on what is given to them through a limited set of instructions which are understood by their [[CPU]]s. In the earliest computers, that meant programmers sometimes typed 1's and 0's to program. Since this requires considerable programmer training (and patience) to create instructions, later computer languages have gone to great lengths to simplify the programmer's task. (For example, now it's common for people with little training to [[drag-and-drop]] icons to create a Web page; all the steps to create the actual instructions which are run by computers are automatically performed, and not visible.)
The integral [[cycle space]] of a graph is equal to the [[null space]] of its oriented incidence matrix, viewed as a matrix over the [[integers]] or [[real numbers|real]] or [[complex numbers]]. The binary cycle space is the null space of its oriented or unoriented incidence matrix, viewed as a matrix over the two-element [[field (mathematics)|field]].


One common practice for decades is to allow a programmer to use ''source'' language (whose use may still require extensive training), and have that language translated into ''object'' code which the computer can immediately use. The ''compiling'' of one into the other varies depending on what CPU is being given the instructions.
===Signed and bidirected graphs===


''Object language'' in this context means something akin to "the object of what the programmer is trying to achieve". If the source language and object languages are viewed as formal (logical) languages, what the compiler does is ''interpret'' the source into the target language (this is different from the computer science use of ''[[interpreted language]]'' meaning one which is ''not'' compiled). ''Object language'' should also not be confused with ''[[object-oriented language]]'', which is a type of computer [[programming language]] which changes the programmer's environment into convenient objects which can be used in something similar to a drag-and-drop fashion.
The incidence matrix of a [[signed graph]] is a generalization of the oriented incidence matrix. It is the incidence matrix of any [[bidirected graph]] that orients the given signed graph.  The column of a positive edge has a +1 in the row corresponding to one endpoint and a −1 in the row corresponding to the other endpoint, just like an edge in an ordinary (unsigned) graph.  The column of a negative edge has either a +1 or a −1 in both rows.  The line graph and Kirchhoff matrix properties generalize to signed graphs.


''Object language'' in this context is synonymous with ''target language''.  The object language of a translation most often is a [[machine language]], but can be some other kind of language, such as [[assembly language]].
===Multigraphs===


Because the object language of compilation has usually been machine language, the term ''[[object file]]'' has come to mean a file containing machine instructions, and sometimes the translated program itself is simply called an ''object''.
The definitions of incidence matrix apply to graphs with [[loop (graph theory)|loops]] and [[multiple edges]].  The column of an oriented incidence matrix that corresponds to a loop is all zero, unless the graph is signed and the loop is negative; then the column is all zero except for ±2 in the row of its incident vertex.


== Expressions in an object language ==
===Hypergraphs===
=== Symbols ===
Because the edges of ordinary graphs can only have two vertices (one at each end), the column of an incidence matrix for graphs can only have two non-zero entries. By contrast, a [[hypergraph]] can have multiple vertices assigned to one edge; thus, a general matrix of non-negative integers describes a hypergraph.
{{Main|Symbol (formal)}}


A ''symbol'' is an [[idea]], [[abstraction]] or [[concept]], [[type-token distinction|token]]s of which may be marks or a configuration of marks which form a particular pattern. Although the term "symbol" in common use refers at some times to the idea being symbolized, and at other times to the marks on a piece of paper or chalkboard which are being used to express that idea; in the [[formal language]]s studied in [[mathematics]] and [[logic]], the term "symbol" refers to the idea, and the marks are considered to be a [[type-token distinction|token]] instance of the symbol.
==Incidence structures==


=== Formulas ===
The '''incidence matrix''' of an [[incidence structure]] ''C'' is a ''p'' &times; ''q'' matrix <math>[b_{ij}]</math>, where ''p'' and ''q'' are the number of '''points''' and '''lines''' respectively, such that <math>b_{ij} = 1</math> if the point <math>p_i</math> and line <math>L_j</math> are incident and 0 otherwise. In this case the incidence matrix is also a [[biadjacency matrix]] of the [[Levi graph]] of the structure. As there is a [[hypergraph]] for every Levi graph, and ''vice versa'', the incidence matrix of an incidence structure describes a hypergraph.
{{Main|Well-formed formula}}


In the formal languages used in mathematical logic and computer science, a ''well-formed formula'' or simply ''formula'' is an [[idea]], [[abstraction]] or [[concept]] which is expressed using the [[symbol (formal)|symbol]]s and [[formation rule]]s (also called the [[formal grammar]]) of a particular formal language. To say that a [[string (computer science)|string]] of symbols <math>\ S</math> is a wff with respect to a given formal grammar <math>\ G</math> is equivalent to saying that <math>\ S</math> belongs to the language generated by <math>\ G</math>.
===Finite geometries===


=== Formal systems ===
An important example is a [[finite geometry]].  For instance, in a finite plane, ''X'' is the set of points and ''Y'' is the set of lines.  In a finite geometry of higher dimension, ''X'' could be the set of points and ''Y'' could be the set of subspaces of dimension one less than the dimension of ''Y''; or ''X'' could be the set of all subspaces of one dimension ''d'' and ''Y'' the set of all subspaces of another dimension ''e''.
{{Main|Formal system}}


A ''formal system'' is a [[formal language]] together with a [[deductive system]] which consists of a set of [[inference rule]]s and/or [[axiom]]s. A formal system is used to [[formal proof|derive]] one expression from one or more other expressions previously expressed in the system. These expressions are called [[axiom]]s, in the case of those previously supposed to be true, or [[theorem]]s, in the case of those derived. A formal system may be formulated and studied for its intrinsic properties, or it may be intended as a description (i.e. a [[Interpretation (logic)|model]]) of external phenomena.
===Block designs===


=== Theorems ===
Another example is a [[block design]].  Here ''X'' is a finite set of "points" and ''Y'' is a class of subsets of ''X'', called "blocks", subject to rules that depend on the type of design.  The incidence matrix is an important tool in the theory of block designs.  For instance, it is used to prove the fundamental theorem of symmetric 2-designs, that the number of blocks equals the number of points.
{{Main|Theorem}}


A ''theorem'' is a [[symbol (formal)|symbol]] or string of symbols which is [[formal proof|derived]] by using a [[formal system]]. The string of symbols is a [[logical consequence]] of the [[axiom]]s and [[rule of inference|rules]] of the system.
==References==
*{{citation | last=Diestel | first=Reinhard | title=Graph Theory | series=Graduate Texts in Mathematics | volume=173 | edition=3rd | date=2005 | publisher=Springer-Verlag | isbn=3-540-26183-4}}.
* [[Coxeter|Coxeter, H.S.M.]] ''[[Regular Polytopes (book)|Regular Polytopes]]'', (3rd edition, 1973), Dover edition, ISBN 0-486-61480-8 (Section 9.2 Incidence matrices, pp.&nbsp;166–171)
* Jonathan L Gross, Jay Yellen, ''Graph Theory and its applications'', second edition, 2006 (p 97, Incidence Matrices for undirect graphs; p 98, incidence matrices for digraphs)
*{{mathworld | urlname = IncidenceMatrix  | title = Incidence matrix }}


=== Formal proofs ===
[[Category:Algebraic graph theory]]
{{Main|Formal proof}}
[[Category:Combinatorics]]
 
[[Category:Matrices]]
A ''formal proof'' or ''derivation'' is a finite sequence of [[proposition]]s (called [[well-formed formula]]s in the case of a [[formal language]]) each of which is an [[axiom]] or follows from the preceding sentences in the sequence by a [[rule of inference]]. The last sentence in the sequence is a [[theorem]] of a [[formal system]]. The concept of [[natural deduction]] is a [[generalization]] of the concept of proof.<ref>The Cambridge Dictionary of Philosophy, ''deduction''</ref>
[[Category:Graph data structures]]
 
=== Theories ===
{{Main|Theory (mathematical logic)}}
 
A ''theory'' is a set of [[sentence (mathematical logic)|sentence]]s in a [[formal language]].
 
== References ==
{{reflist}}
 
{{DEFAULTSORT:Object Language}}
[[Category:Programming language implementation]]
[[Category:Linguistics]]
[[Category:Mathematical logic]]
[[Category:Metalogic]]
 
[[nl:Objecttaal]]
[[pt:Linguagem objeto]]
[[fi:Objektikieli]]

Revision as of 23:11, 11 August 2014

In mathematics, an incidence matrix is a matrix that shows the relationship between two classes of objects. If the first class is X and the second is Y, the matrix has one row for each element of X and one column for each element of Y. The entry in row x and column y is 1 if x and y are related (called incident in this context) and 0 if they are not. There are variations; see below.

Graph theory

Incidence matrices are mostly used in graph theory.

Undirected and directed graphs

An undirected graph

In graph theory an undirected graph G has two kinds of incidence matrices: unoriented and oriented. The incidence matrix (or unoriented incidence matrix) of G is a n × m matrix , where n and m are the numbers of vertices and edges respectively, such that if the vertex and edge are incident and 0 otherwise.

For example the incidence matrix of the undirected graph shown on the right is a matrix consisting of 4 rows (corresponding to the four vertices, 1-4) and 4 columns (corresponding to the four edges, e1-e4):

If we look at the incidence matrix, we see that the sum of each column is equal to 2. This is because each edge has a vertex connected to each end.

The incidence matrix of a directed graph D is a n × m matrix where n and m are the number of vertices and edges respectively, such that if the edge leaves vertex , if it enters vertex and 0 otherwise (Note that many authors use the opposite sign convention.).

An oriented incidence matrix of an undirected graph G is the incidence matrix, in the sense of directed graphs, of any orientation of G. That is, in the column of edge e, there is one +1 in the row corresponding to one vertex of e and one −1 in the row corresponding to the other vertex of e, and all other rows have 0. All oriented incidence matrices of G differ only by negating some set of columns. In many uses, this is an insignificant difference, so one can speak of the oriented incidence matrix, even though that is technically incorrect.

The oriented or unoriented incidence matrix of a graph G is related to the adjacency matrix of its line graph L(G) by the following theorem:

where is the adjacency matrix of the line graph of G, B(G) is the incidence matrix, and is the identity matrix of dimension m.

The discrete Laplacian (or Kirchhoff matrix) is obtained from the oriented incidence matrix M(G) by the formula

The integral cycle space of a graph is equal to the null space of its oriented incidence matrix, viewed as a matrix over the integers or real or complex numbers. The binary cycle space is the null space of its oriented or unoriented incidence matrix, viewed as a matrix over the two-element field.

Signed and bidirected graphs

The incidence matrix of a signed graph is a generalization of the oriented incidence matrix. It is the incidence matrix of any bidirected graph that orients the given signed graph. The column of a positive edge has a +1 in the row corresponding to one endpoint and a −1 in the row corresponding to the other endpoint, just like an edge in an ordinary (unsigned) graph. The column of a negative edge has either a +1 or a −1 in both rows. The line graph and Kirchhoff matrix properties generalize to signed graphs.

Multigraphs

The definitions of incidence matrix apply to graphs with loops and multiple edges. The column of an oriented incidence matrix that corresponds to a loop is all zero, unless the graph is signed and the loop is negative; then the column is all zero except for ±2 in the row of its incident vertex.

Hypergraphs

Because the edges of ordinary graphs can only have two vertices (one at each end), the column of an incidence matrix for graphs can only have two non-zero entries. By contrast, a hypergraph can have multiple vertices assigned to one edge; thus, a general matrix of non-negative integers describes a hypergraph.

Incidence structures

The incidence matrix of an incidence structure C is a p × q matrix , where p and q are the number of points and lines respectively, such that if the point and line are incident and 0 otherwise. In this case the incidence matrix is also a biadjacency matrix of the Levi graph of the structure. As there is a hypergraph for every Levi graph, and vice versa, the incidence matrix of an incidence structure describes a hypergraph.

Finite geometries

An important example is a finite geometry. For instance, in a finite plane, X is the set of points and Y is the set of lines. In a finite geometry of higher dimension, X could be the set of points and Y could be the set of subspaces of dimension one less than the dimension of Y; or X could be the set of all subspaces of one dimension d and Y the set of all subspaces of another dimension e.

Block designs

Another example is a block design. Here X is a finite set of "points" and Y is a class of subsets of X, called "blocks", subject to rules that depend on the type of design. The incidence matrix is an important tool in the theory of block designs. For instance, it is used to prove the fundamental theorem of symmetric 2-designs, that the number of blocks equals the number of points.

References

  • Many property agents need to declare for the PIC grant in Singapore. However, not all of them know find out how to do the correct process for getting this PIC scheme from the IRAS. There are a number of steps that you need to do before your software can be approved.

    Naturally, you will have to pay a safety deposit and that is usually one month rent for annually of the settlement. That is the place your good religion deposit will likely be taken into account and will kind part or all of your security deposit. Anticipate to have a proportionate amount deducted out of your deposit if something is discovered to be damaged if you move out. It's best to you'll want to test the inventory drawn up by the owner, which can detail all objects in the property and their condition. If you happen to fail to notice any harm not already mentioned within the inventory before transferring in, you danger having to pay for it yourself.

    In case you are in search of an actual estate or Singapore property agent on-line, you simply should belief your intuition. It's because you do not know which agent is nice and which agent will not be. Carry out research on several brokers by looking out the internet. As soon as if you end up positive that a selected agent is dependable and reliable, you can choose to utilize his partnerise in finding you a home in Singapore. Most of the time, a property agent is taken into account to be good if he or she locations the contact data on his website. This may mean that the agent does not mind you calling them and asking them any questions relating to new properties in singapore in Singapore. After chatting with them you too can see them in their office after taking an appointment.

    Have handed an trade examination i.e Widespread Examination for House Brokers (CEHA) or Actual Property Agency (REA) examination, or equal; Exclusive brokers are extra keen to share listing information thus making certain the widest doable coverage inside the real estate community via Multiple Listings and Networking. Accepting a severe provide is simpler since your agent is totally conscious of all advertising activity related with your property. This reduces your having to check with a number of agents for some other offers. Price control is easily achieved. Paint work in good restore-discuss with your Property Marketing consultant if main works are still to be done. Softening in residential property prices proceed, led by 2.8 per cent decline within the index for Remainder of Central Region

    Once you place down the one per cent choice price to carry down a non-public property, it's important to accept its situation as it is whenever you move in – faulty air-con, choked rest room and all. Get round this by asking your agent to incorporate a ultimate inspection clause within the possibility-to-buy letter. HDB flat patrons routinely take pleasure in this security net. "There's a ultimate inspection of the property two days before the completion of all HDB transactions. If the air-con is defective, you can request the seller to repair it," says Kelvin.

    15.6.1 As the agent is an intermediary, generally, as soon as the principal and third party are introduced right into a contractual relationship, the agent drops out of the image, subject to any problems with remuneration or indemnification that he could have against the principal, and extra exceptionally, against the third occasion. Generally, agents are entitled to be indemnified for all liabilities reasonably incurred within the execution of the brokers´ authority.

    To achieve the very best outcomes, you must be always updated on market situations, including past transaction information and reliable projections. You could review and examine comparable homes that are currently available in the market, especially these which have been sold or not bought up to now six months. You'll be able to see a pattern of such report by clicking here It's essential to defend yourself in opposition to unscrupulous patrons. They are often very skilled in using highly unethical and manipulative techniques to try and lure you into a lure. That you must also protect your self, your loved ones, and personal belongings as you'll be serving many strangers in your home. Sign a listing itemizing of all of the objects provided by the proprietor, together with their situation. HSR Prime Recruiter 2010.
  • Coxeter, H.S.M. Regular Polytopes, (3rd edition, 1973), Dover edition, ISBN 0-486-61480-8 (Section 9.2 Incidence matrices, pp. 166–171)
  • Jonathan L Gross, Jay Yellen, Graph Theory and its applications, second edition, 2006 (p 97, Incidence Matrices for undirect graphs; p 98, incidence matrices for digraphs)
  • 22 year-old Systems Analyst Rave from Merrickville-Wolford, has lots of hobbies and interests including quick cars, property developers in singapore and baking. Always loves visiting spots like Historic Monuments Zone of Querétaro.

    Here is my web site - cottagehillchurch.com